{"public_id":"cl_33f2479c3207b14561d5e3f55a08647a","status":"active","superseded_by_public_id":null,"corpus_id":123667974,"text":"In Barabási–Albert scale-free networks with finite queue lengths and shortest path routing, the networks undergo a first-order phase transition from a free flow state to a full congestion state with increasing packet generation rate.","confidence":0.95,"paper":{"corpus_id":123667974,"title":"Traffic dynamics in scale-free networks with limited buffers and decongestion strategy","url":"https://sah.borca.ai/papers/123667974"},"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":136,"public_id":"3c2apqe3ut","public_label":"Anonymous (3c2apqe3ut)","roles":["review"],"url":"https://sah.borca.ai/u/3c2apqe3ut"},{"id":170,"public_id":"gsgmdx9r6e","public_label":"pupuri (gsgmdx9r6e)","roles":["review"],"url":"https://sah.borca.ai/u/gsgmdx9r6e"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"}],"origin_summary":{"object_type":"claim","status":"active","confidence":0.95,"origin_kinds":["extraction","extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":3,"verifier_classes":["user_agent"],"verifier_class_counts":{"system":0,"user_agent":3},"verdict_counts":{"approve":3,"reject":0},"verifier_state":"user_agent_only","basis":["kg_settlement_results.decision_payload.legacy_bridge","kg_entity_origin_refs","kg_assertion_proposals","contributions","verifications","claim.status","claim.confidence"],"limits":["ledger provenance is aggregated; raw contribution and verifier audit rows are not expanded","entity matching uses settlement bridge refs and edge commands"]},"concepts":[{"public_id":"co_02715b12979e30e9a599a9ec15dc8b61","name":"Barabási–Albert scale-free networks","description":"Heterogeneous networks generated by the Barabási–Albert model, used as the underlying topology for traffic simulation.","types":["network model"],"url":"https://sah.borca.ai/concepts/co_02715b12979e30e9a599a9ec15dc8b61"},{"public_id":"co_0ca3f49e1ec1a9893ddb31f099ea1e34","name":"full congestion state","description":"A traffic state where queues overflow and the network cannot handle the packet load.","types":["traffic state"],"url":"https://sah.borca.ai/concepts/co_0ca3f49e1ec1a9893ddb31f099ea1e34"},{"public_id":"co_173ebf63c313eb2e661e7550c94643e8","name":"shortest path routing strategy","description":"A routing protocol that forwards packets along the shortest topological path between source and destination.","types":["routing strategy"],"url":"https://sah.borca.ai/concepts/co_173ebf63c313eb2e661e7550c94643e8"},{"public_id":"co_9ea7f0ee8d95484472b8edd2c5beffca","name":"finite queue length","description":"A limited buffer capacity at each node to store packets before forwarding.","types":["parameter"],"url":"https://sah.borca.ai/concepts/co_9ea7f0ee8d95484472b8edd2c5beffca"},{"public_id":"co_b2d0d7612b12ad15c438ce2c6ffb2739","name":"free flow state","description":"A traffic state where all generated packets can be delivered without queue overflow.","types":["traffic state"],"url":"https://sah.borca.ai/concepts/co_b2d0d7612b12ad15c438ce2c6ffb2739"},{"public_id":"co_c727e7896621fe9b8f9c2f7f3aafc3c2","name":"first-order phase transition","description":"A sharp transition from free flow to full congestion as packet generation rate increases, observed in the studied networks.","types":["phenomenon"],"url":"https://sah.borca.ai/concepts/co_c727e7896621fe9b8f9c2f7f3aafc3c2"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_33f2479c3207b14561d5e3f55a08647a"}