{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:B2ZZMRLDAYFMWHBWV76KU7DVZ6","short_pith_number":"pith:B2ZZMRLD","schema_version":"1.0","canonical_sha256":"0eb3964563060acb1c36affcaa7c75cf856d2a034c0ab17013adb3882eaa180d","source":{"kind":"arxiv","id":"cs/0612099","version":1},"attestation_state":"computed","paper":{"title":"Network Information Flow in Small World Networks","license":"","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Joao Barros, Rui A. Costa","submitted_at":"2006-12-20T09:11:41Z","abstract_excerpt":"Recent results from statistical physics show that large classes of complex networks, both man-made and of natural origin, are characterized by high clustering properties yet strikingly short path lengths between pairs of nodes. This class of networks are said to have a small-world topology. In the context of communication networks, navigable small-world topologies, i.e. those which admit efficient distributed routing algorithms, are deemed particularly effective, for example in resource discovery tasks and peer-to-peer applications. Breaking with the traditional approach to small-world topolog"},"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":"cs/0612099","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2006-12-20T09:11:41Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"d910d7ffd27990cd0dcc91e0e549fbab74f12b2537cf75c2bc71e935b12264b3","abstract_canon_sha256":"5abb8b23c5b9716117e86830589da9310fa2d2ac5ffb87413b2401965727fca3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:05.092939Z","signature_b64":"g+lgCQLLOH71eqDWY9dCu2GWyK9TIRMJ+/0jLNbaXS0WUFvGUFB/U7nlv5NFkKXZDJT1OEl0C7Kx8w/IKfTtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0eb3964563060acb1c36affcaa7c75cf856d2a034c0ab17013adb3882eaa180d","last_reissued_at":"2026-05-18T00:58:05.092543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:05.092543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Information Flow in Small World Networks","license":"","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Joao Barros, Rui A. Costa","submitted_at":"2006-12-20T09:11:41Z","abstract_excerpt":"Recent results from statistical physics show that large classes of complex networks, both man-made and of natural origin, are characterized by high clustering properties yet strikingly short path lengths between pairs of nodes. This class of networks are said to have a small-world topology. In the context of communication networks, navigable small-world topologies, i.e. those which admit efficient distributed routing algorithms, are deemed particularly effective, for example in resource discovery tasks and peer-to-peer applications. Breaking with the traditional approach to small-world topolog"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0612099","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":"cs/0612099","created_at":"2026-05-18T00:58:05.092612+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0612099v1","created_at":"2026-05-18T00:58:05.092612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0612099","created_at":"2026-05-18T00:58:05.092612+00:00"},{"alias_kind":"pith_short_12","alias_value":"B2ZZMRLDAYFM","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"B2ZZMRLDAYFMWHBW","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"B2ZZMRLD","created_at":"2026-05-18T12:25:53.939244+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/B2ZZMRLDAYFMWHBWV76KU7DVZ6","json":"https://pith.science/pith/B2ZZMRLDAYFMWHBWV76KU7DVZ6.json","graph_json":"https://pith.science/api/pith-number/B2ZZMRLDAYFMWHBWV76KU7DVZ6/graph.json","events_json":"https://pith.science/api/pith-number/B2ZZMRLDAYFMWHBWV76KU7DVZ6/events.json","paper":"https://pith.science/paper/B2ZZMRLD"},"agent_actions":{"view_html":"https://pith.science/pith/B2ZZMRLDAYFMWHBWV76KU7DVZ6","download_json":"https://pith.science/pith/B2ZZMRLDAYFMWHBWV76KU7DVZ6.json","view_paper":"https://pith.science/paper/B2ZZMRLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0612099&json=true","fetch_graph":"https://pith.science/api/pith-number/B2ZZMRLDAYFMWHBWV76KU7DVZ6/graph.json","fetch_events":"https://pith.science/api/pith-number/B2ZZMRLDAYFMWHBWV76KU7DVZ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B2ZZMRLDAYFMWHBWV76KU7DVZ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B2ZZMRLDAYFMWHBWV76KU7DVZ6/action/storage_attestation","attest_author":"https://pith.science/pith/B2ZZMRLDAYFMWHBWV76KU7DVZ6/action/author_attestation","sign_citation":"https://pith.science/pith/B2ZZMRLDAYFMWHBWV76KU7DVZ6/action/citation_signature","submit_replication":"https://pith.science/pith/B2ZZMRLDAYFMWHBWV76KU7DVZ6/action/replication_record"}},"created_at":"2026-05-18T00:58:05.092612+00:00","updated_at":"2026-05-18T00:58:05.092612+00:00"}