{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DXJLVQMSRXRL2ICQDPLFJPJXYP","short_pith_number":"pith:DXJLVQMS","schema_version":"1.0","canonical_sha256":"1dd2bac1928de2bd20501bd654bd37c3c3c9e7c2a597bee80bd0fd1aee71750d","source":{"kind":"arxiv","id":"1302.6156","version":1},"attestation_state":"computed","paper":{"title":"Scalable Routing on Flat Names","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ankit Singla, Gianluca Iannaccone, Kevin Fall, P. Brighten Godfrey, Sylvia Ratnasamy","submitted_at":"2013-02-25T17:00:31Z","abstract_excerpt":"We introduce a protocol which routes on flat, location-independent identifiers with guaranteed scalability and low stretch. Our design builds on theoretical advances in the area of compact routing, and is the first to realize these guarantees in a dynamic distributed setting."},"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":"1302.6156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-02-25T17:00:31Z","cross_cats_sorted":[],"title_canon_sha256":"2d137339897c3a635322de939f2257a5778b345471818ed08089675143d3db99","abstract_canon_sha256":"0cd967b049eb6180171a216f4d0fbdbf403f08e59581fc7d04c885bcdced11ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:32.456772Z","signature_b64":"nnmvSb7M9dx9LKeUPruT26A0ivD8/d/egYYyS444kT1UPBleAnbvZvLyqtfqs2RXPMUg3/E/jVuoslt8eBZVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dd2bac1928de2bd20501bd654bd37c3c3c9e7c2a597bee80bd0fd1aee71750d","last_reissued_at":"2026-05-18T03:32:32.456080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:32.456080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Routing on Flat Names","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ankit Singla, Gianluca Iannaccone, Kevin Fall, P. Brighten Godfrey, Sylvia Ratnasamy","submitted_at":"2013-02-25T17:00:31Z","abstract_excerpt":"We introduce a protocol which routes on flat, location-independent identifiers with guaranteed scalability and low stretch. Our design builds on theoretical advances in the area of compact routing, and is the first to realize these guarantees in a dynamic distributed setting."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6156","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":"1302.6156","created_at":"2026-05-18T03:32:32.456169+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.6156v1","created_at":"2026-05-18T03:32:32.456169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6156","created_at":"2026-05-18T03:32:32.456169+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXJLVQMSRXRL","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXJLVQMSRXRL2ICQ","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXJLVQMS","created_at":"2026-05-18T12:27:43.054852+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/DXJLVQMSRXRL2ICQDPLFJPJXYP","json":"https://pith.science/pith/DXJLVQMSRXRL2ICQDPLFJPJXYP.json","graph_json":"https://pith.science/api/pith-number/DXJLVQMSRXRL2ICQDPLFJPJXYP/graph.json","events_json":"https://pith.science/api/pith-number/DXJLVQMSRXRL2ICQDPLFJPJXYP/events.json","paper":"https://pith.science/paper/DXJLVQMS"},"agent_actions":{"view_html":"https://pith.science/pith/DXJLVQMSRXRL2ICQDPLFJPJXYP","download_json":"https://pith.science/pith/DXJLVQMSRXRL2ICQDPLFJPJXYP.json","view_paper":"https://pith.science/paper/DXJLVQMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.6156&json=true","fetch_graph":"https://pith.science/api/pith-number/DXJLVQMSRXRL2ICQDPLFJPJXYP/graph.json","fetch_events":"https://pith.science/api/pith-number/DXJLVQMSRXRL2ICQDPLFJPJXYP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXJLVQMSRXRL2ICQDPLFJPJXYP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXJLVQMSRXRL2ICQDPLFJPJXYP/action/storage_attestation","attest_author":"https://pith.science/pith/DXJLVQMSRXRL2ICQDPLFJPJXYP/action/author_attestation","sign_citation":"https://pith.science/pith/DXJLVQMSRXRL2ICQDPLFJPJXYP/action/citation_signature","submit_replication":"https://pith.science/pith/DXJLVQMSRXRL2ICQDPLFJPJXYP/action/replication_record"}},"created_at":"2026-05-18T03:32:32.456169+00:00","updated_at":"2026-05-18T03:32:32.456169+00:00"}