{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:H3XRR53LMLOXQ36KRLMN6ZIQNW","short_pith_number":"pith:H3XRR53L","schema_version":"1.0","canonical_sha256":"3eef18f76b62dd786fca8ad8df65106d84d3e2010bede4ccb7a96051bd998dac","source":{"kind":"arxiv","id":"1201.4291","version":1},"attestation_state":"computed","paper":{"title":"Scaling of Congestion in Small World Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI","physics.soc-ph"],"primary_cat":"math.MG","authors_text":"Gabriel H. Tucci, Iraj Saniee","submitted_at":"2012-01-20T13:52:41Z","abstract_excerpt":"In this report we show that in a planar exponentially growing network consisting of $N$ nodes, congestion scales as $O(N^2/\\log(N))$ independently of how flows may be routed. This is in contrast to the $O(N^{3/2})$ scaling of congestion in a flat polynomially growing network. We also show that without the planarity condition, congestion in a small world network could scale as low as $O(N^{1+\\epsilon})$, for arbitrarily small $\\epsilon$. These extreme results demonstrate that the small world property by itself cannot provide guidance on the level of congestion in a network and other characteris"},"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":"1201.4291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2012-01-20T13:52:41Z","cross_cats_sorted":["cond-mat.stat-mech","cs.SI","physics.soc-ph"],"title_canon_sha256":"fcce4f868f8a0c44c2e31064132efe37144a4c86c9ee47415335d4ca0eb99628","abstract_canon_sha256":"4e89dd29247e59190c073a586fe905f427b82c9249be8b37f382f30c0feb1672"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:07.496712Z","signature_b64":"Q/fjqXiRS0fXm+WN793d3PciBQmF3elSIiNGSKGSNX5fv/3KC3M5ULuuSAUML76zo1fENVvq9zqimXm1esR0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3eef18f76b62dd786fca8ad8df65106d84d3e2010bede4ccb7a96051bd998dac","last_reissued_at":"2026-05-18T04:04:07.496173Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:07.496173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling of Congestion in Small World Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI","physics.soc-ph"],"primary_cat":"math.MG","authors_text":"Gabriel H. Tucci, Iraj Saniee","submitted_at":"2012-01-20T13:52:41Z","abstract_excerpt":"In this report we show that in a planar exponentially growing network consisting of $N$ nodes, congestion scales as $O(N^2/\\log(N))$ independently of how flows may be routed. This is in contrast to the $O(N^{3/2})$ scaling of congestion in a flat polynomially growing network. We also show that without the planarity condition, congestion in a small world network could scale as low as $O(N^{1+\\epsilon})$, for arbitrarily small $\\epsilon$. These extreme results demonstrate that the small world property by itself cannot provide guidance on the level of congestion in a network and other characteris"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4291","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":"1201.4291","created_at":"2026-05-18T04:04:07.496254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.4291v1","created_at":"2026-05-18T04:04:07.496254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4291","created_at":"2026-05-18T04:04:07.496254+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3XRR53LMLOX","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3XRR53LMLOXQ36K","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3XRR53L","created_at":"2026-05-18T12:27:06.952714+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/H3XRR53LMLOXQ36KRLMN6ZIQNW","json":"https://pith.science/pith/H3XRR53LMLOXQ36KRLMN6ZIQNW.json","graph_json":"https://pith.science/api/pith-number/H3XRR53LMLOXQ36KRLMN6ZIQNW/graph.json","events_json":"https://pith.science/api/pith-number/H3XRR53LMLOXQ36KRLMN6ZIQNW/events.json","paper":"https://pith.science/paper/H3XRR53L"},"agent_actions":{"view_html":"https://pith.science/pith/H3XRR53LMLOXQ36KRLMN6ZIQNW","download_json":"https://pith.science/pith/H3XRR53LMLOXQ36KRLMN6ZIQNW.json","view_paper":"https://pith.science/paper/H3XRR53L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.4291&json=true","fetch_graph":"https://pith.science/api/pith-number/H3XRR53LMLOXQ36KRLMN6ZIQNW/graph.json","fetch_events":"https://pith.science/api/pith-number/H3XRR53LMLOXQ36KRLMN6ZIQNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3XRR53LMLOXQ36KRLMN6ZIQNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3XRR53LMLOXQ36KRLMN6ZIQNW/action/storage_attestation","attest_author":"https://pith.science/pith/H3XRR53LMLOXQ36KRLMN6ZIQNW/action/author_attestation","sign_citation":"https://pith.science/pith/H3XRR53LMLOXQ36KRLMN6ZIQNW/action/citation_signature","submit_replication":"https://pith.science/pith/H3XRR53LMLOXQ36KRLMN6ZIQNW/action/replication_record"}},"created_at":"2026-05-18T04:04:07.496254+00:00","updated_at":"2026-05-18T04:04:07.496254+00:00"}