{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GCYXIOUOTLGRIRKDQDMJRRTXX5","short_pith_number":"pith:GCYXIOUO","schema_version":"1.0","canonical_sha256":"30b1743a8e9acd14454380d898c677bf65a227f33c6d3ca423684b2b295f7587","source":{"kind":"arxiv","id":"1109.0697","version":1},"attestation_state":"computed","paper":{"title":"Traffic dynamics in scale-free networks with limited packet-delivering capacity","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.NI","authors_text":"Bing-Hong Wang, Han-Xin Yang, Wen-Xu Wang, Zhi-Xi Wu","submitted_at":"2011-09-04T11:35:03Z","abstract_excerpt":"We propose a limited packet-delivering capacity model for traffic dynamics in scale-free networks. In this model, the total node's packet-delivering capacity is fixed, and the allocation of packet-delivering capacity on node $i$ is proportional to $k_{i}^{\\phi}$, where $k_{i}$ is the degree of node $i$ and $\\phi$ is a adjustable parameter. We have applied this model on the shortest path routing strategy as well as the local routing strategy, and found that there exists an optimal value of parameter $\\phi$ leading to the maximal network capacity under both routing strategies. We provide some ex"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1109.0697","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.NI","submitted_at":"2011-09-04T11:35:03Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"83a956c133170c84c315aac4c52e713a11c39b1587dfa4abf18d629578de29f5","abstract_canon_sha256":"8a652494c673e80fbaa313a2d7e3c088d7f730328004f7168ea6a973338e3f58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:40.251023Z","signature_b64":"NNY08shueapS0D80P2hX2NaFULL3OvHQD2JynU9/DQezUMlb+iIPr/bFq9UsDKOYG2iOpBGB+Is5INPs8wTBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30b1743a8e9acd14454380d898c677bf65a227f33c6d3ca423684b2b295f7587","last_reissued_at":"2026-05-18T02:00:40.250344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:40.250344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Traffic dynamics in scale-free networks with limited packet-delivering capacity","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.NI","authors_text":"Bing-Hong Wang, Han-Xin Yang, Wen-Xu Wang, Zhi-Xi Wu","submitted_at":"2011-09-04T11:35:03Z","abstract_excerpt":"We propose a limited packet-delivering capacity model for traffic dynamics in scale-free networks. In this model, the total node's packet-delivering capacity is fixed, and the allocation of packet-delivering capacity on node $i$ is proportional to $k_{i}^{\\phi}$, where $k_{i}$ is the degree of node $i$ and $\\phi$ is a adjustable parameter. We have applied this model on the shortest path routing strategy as well as the local routing strategy, and found that there exists an optimal value of parameter $\\phi$ leading to the maximal network capacity under both routing strategies. We provide some ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0697","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.0697","created_at":"2026-05-18T02:00:40.250452+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.0697v1","created_at":"2026-05-18T02:00:40.250452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0697","created_at":"2026-05-18T02:00:40.250452+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCYXIOUOTLGR","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCYXIOUOTLGRIRKD","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCYXIOUO","created_at":"2026-05-18T12:26:28.662955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GCYXIOUOTLGRIRKDQDMJRRTXX5","json":"https://pith.science/pith/GCYXIOUOTLGRIRKDQDMJRRTXX5.json","graph_json":"https://pith.science/api/pith-number/GCYXIOUOTLGRIRKDQDMJRRTXX5/graph.json","events_json":"https://pith.science/api/pith-number/GCYXIOUOTLGRIRKDQDMJRRTXX5/events.json","paper":"https://pith.science/paper/GCYXIOUO"},"agent_actions":{"view_html":"https://pith.science/pith/GCYXIOUOTLGRIRKDQDMJRRTXX5","download_json":"https://pith.science/pith/GCYXIOUOTLGRIRKDQDMJRRTXX5.json","view_paper":"https://pith.science/paper/GCYXIOUO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.0697&json=true","fetch_graph":"https://pith.science/api/pith-number/GCYXIOUOTLGRIRKDQDMJRRTXX5/graph.json","fetch_events":"https://pith.science/api/pith-number/GCYXIOUOTLGRIRKDQDMJRRTXX5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCYXIOUOTLGRIRKDQDMJRRTXX5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCYXIOUOTLGRIRKDQDMJRRTXX5/action/storage_attestation","attest_author":"https://pith.science/pith/GCYXIOUOTLGRIRKDQDMJRRTXX5/action/author_attestation","sign_citation":"https://pith.science/pith/GCYXIOUOTLGRIRKDQDMJRRTXX5/action/citation_signature","submit_replication":"https://pith.science/pith/GCYXIOUOTLGRIRKDQDMJRRTXX5/action/replication_record"}},"created_at":"2026-05-18T02:00:40.250452+00:00","updated_at":"2026-05-18T02:00:40.250452+00:00"}