{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:XTNALTZSU4LIYP4AAFCQL67LVP","short_pith_number":"pith:XTNALTZS","schema_version":"1.0","canonical_sha256":"bcda05cf32a7168c3f80014505fbebabcdadff2a639770945d4f6eb496dc0f41","source":{"kind":"arxiv","id":"0909.0028","version":1},"attestation_state":"computed","paper":{"title":"Cost of material or information flow in complex transportation networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"physics.soc-ph","authors_text":"J. K. L. da Silva, L. A. Barbosa","submitted_at":"2009-08-31T20:15:52Z","abstract_excerpt":"To analyze the transport of information or material from a source to every node of a network we use two quantities introduced in the study of river networks: the cost and the flow. For a network with $K$ nodes and $M$ levels, we show that an upper bound to the global cost is $C_{0,max}\\propto KM$. From numerical simulations for spanning tree networks with scale-free topology and with $10^2$ up to $10^7$ nodes, it is found, for large $K$, that the average number of levels and the global cost are given by $M\\propto \\ln(K)$ and $C_0\\propto K\\ln (K)$, respectively. These results agree very well wi"},"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":"0909.0028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2009-08-31T20:15:52Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"77604e51eb6b6485875ea0ca364b17ec2b496abb32d39946bc9acb3a1823df74","abstract_canon_sha256":"69416db522493d3eb80cc2c5293af5fd324366679c54d471d2bd57d5be5409d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:12.428384Z","signature_b64":"kPAqUj22kvzS4pq7E76wz+5G0d+txHIo07TFjzHZYBr0ONVIIX/+kH4q1ORVi0Zk1QgnhTYdOUCKUOeCMAVtAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcda05cf32a7168c3f80014505fbebabcdadff2a639770945d4f6eb496dc0f41","last_reissued_at":"2026-05-18T02:12:12.427667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:12.427667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cost of material or information flow in complex transportation networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"physics.soc-ph","authors_text":"J. K. L. da Silva, L. A. Barbosa","submitted_at":"2009-08-31T20:15:52Z","abstract_excerpt":"To analyze the transport of information or material from a source to every node of a network we use two quantities introduced in the study of river networks: the cost and the flow. For a network with $K$ nodes and $M$ levels, we show that an upper bound to the global cost is $C_{0,max}\\propto KM$. From numerical simulations for spanning tree networks with scale-free topology and with $10^2$ up to $10^7$ nodes, it is found, for large $K$, that the average number of levels and the global cost are given by $M\\propto \\ln(K)$ and $C_0\\propto K\\ln (K)$, respectively. These results agree very well wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.0028","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":"0909.0028","created_at":"2026-05-18T02:12:12.427771+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.0028v1","created_at":"2026-05-18T02:12:12.427771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.0028","created_at":"2026-05-18T02:12:12.427771+00:00"},{"alias_kind":"pith_short_12","alias_value":"XTNALTZSU4LI","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"XTNALTZSU4LIYP4A","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"XTNALTZS","created_at":"2026-05-18T12:26:02.257875+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/XTNALTZSU4LIYP4AAFCQL67LVP","json":"https://pith.science/pith/XTNALTZSU4LIYP4AAFCQL67LVP.json","graph_json":"https://pith.science/api/pith-number/XTNALTZSU4LIYP4AAFCQL67LVP/graph.json","events_json":"https://pith.science/api/pith-number/XTNALTZSU4LIYP4AAFCQL67LVP/events.json","paper":"https://pith.science/paper/XTNALTZS"},"agent_actions":{"view_html":"https://pith.science/pith/XTNALTZSU4LIYP4AAFCQL67LVP","download_json":"https://pith.science/pith/XTNALTZSU4LIYP4AAFCQL67LVP.json","view_paper":"https://pith.science/paper/XTNALTZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.0028&json=true","fetch_graph":"https://pith.science/api/pith-number/XTNALTZSU4LIYP4AAFCQL67LVP/graph.json","fetch_events":"https://pith.science/api/pith-number/XTNALTZSU4LIYP4AAFCQL67LVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XTNALTZSU4LIYP4AAFCQL67LVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XTNALTZSU4LIYP4AAFCQL67LVP/action/storage_attestation","attest_author":"https://pith.science/pith/XTNALTZSU4LIYP4AAFCQL67LVP/action/author_attestation","sign_citation":"https://pith.science/pith/XTNALTZSU4LIYP4AAFCQL67LVP/action/citation_signature","submit_replication":"https://pith.science/pith/XTNALTZSU4LIYP4AAFCQL67LVP/action/replication_record"}},"created_at":"2026-05-18T02:12:12.427771+00:00","updated_at":"2026-05-18T02:12:12.427771+00:00"}