{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NY2FTARPCSDREVEUHXKGKG53EZ","short_pith_number":"pith:NY2FTARP","schema_version":"1.0","canonical_sha256":"6e3459822f14871254943dd4651bbb26465ff64a2658b51199d4b2dadaeeabff","source":{"kind":"arxiv","id":"1305.1295","version":1},"attestation_state":"computed","paper":{"title":"Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.NI","cs.SI"],"primary_cat":"cs.DS","authors_text":"Martin Dietzfelbinger, Philipp Woelfel","submitted_at":"2013-05-06T18:19:17Z","abstract_excerpt":"We consider Kleinberg's celebrated small world graph model (Kleinberg, 2000), in which a D-dimensional grid {0,...,n-1}^D is augmented with a constant number of additional unidirectional edges leaving each node. These long range edges are determined at random according to a probability distribution (the augmenting distribution), which is the same for each node. Kleinberg suggested using the inverse D-th power distribution, in which node v is the long range contact of node u with a probability proportional to ||u-v||^(-D). He showed that such an augmenting distribution allows to route a message"},"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":"1305.1295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-06T18:19:17Z","cross_cats_sorted":["cs.CC","cs.NI","cs.SI"],"title_canon_sha256":"c1d6e9c4b9d2db00eb77ba7e4bc184ef253dc088a7602609e7e2696d9b0a622f","abstract_canon_sha256":"0421edcc73bfe34133cf1e4c98bb36edc0383ee2993e4340704f4ac988db4e69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:22.079065Z","signature_b64":"VB7SZl8Ck4f2ynMZdV2P2xhLNTk4yG/u+0QlEx6CGH56rK/FCDy+16RSOol51qkAWMSKKkA+l4zVdBdEga/1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e3459822f14871254943dd4651bbb26465ff64a2658b51199d4b2dadaeeabff","last_reissued_at":"2026-05-18T03:26:22.078328Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:22.078328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.NI","cs.SI"],"primary_cat":"cs.DS","authors_text":"Martin Dietzfelbinger, Philipp Woelfel","submitted_at":"2013-05-06T18:19:17Z","abstract_excerpt":"We consider Kleinberg's celebrated small world graph model (Kleinberg, 2000), in which a D-dimensional grid {0,...,n-1}^D is augmented with a constant number of additional unidirectional edges leaving each node. These long range edges are determined at random according to a probability distribution (the augmenting distribution), which is the same for each node. Kleinberg suggested using the inverse D-th power distribution, in which node v is the long range contact of node u with a probability proportional to ||u-v||^(-D). He showed that such an augmenting distribution allows to route a message"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1295","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":"1305.1295","created_at":"2026-05-18T03:26:22.078461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.1295v1","created_at":"2026-05-18T03:26:22.078461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1295","created_at":"2026-05-18T03:26:22.078461+00:00"},{"alias_kind":"pith_short_12","alias_value":"NY2FTARPCSDR","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NY2FTARPCSDREVEU","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NY2FTARP","created_at":"2026-05-18T12:27:52.871228+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/NY2FTARPCSDREVEUHXKGKG53EZ","json":"https://pith.science/pith/NY2FTARPCSDREVEUHXKGKG53EZ.json","graph_json":"https://pith.science/api/pith-number/NY2FTARPCSDREVEUHXKGKG53EZ/graph.json","events_json":"https://pith.science/api/pith-number/NY2FTARPCSDREVEUHXKGKG53EZ/events.json","paper":"https://pith.science/paper/NY2FTARP"},"agent_actions":{"view_html":"https://pith.science/pith/NY2FTARPCSDREVEUHXKGKG53EZ","download_json":"https://pith.science/pith/NY2FTARPCSDREVEUHXKGKG53EZ.json","view_paper":"https://pith.science/paper/NY2FTARP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.1295&json=true","fetch_graph":"https://pith.science/api/pith-number/NY2FTARPCSDREVEUHXKGKG53EZ/graph.json","fetch_events":"https://pith.science/api/pith-number/NY2FTARPCSDREVEUHXKGKG53EZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NY2FTARPCSDREVEUHXKGKG53EZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NY2FTARPCSDREVEUHXKGKG53EZ/action/storage_attestation","attest_author":"https://pith.science/pith/NY2FTARPCSDREVEUHXKGKG53EZ/action/author_attestation","sign_citation":"https://pith.science/pith/NY2FTARPCSDREVEUHXKGKG53EZ/action/citation_signature","submit_replication":"https://pith.science/pith/NY2FTARPCSDREVEUHXKGKG53EZ/action/replication_record"}},"created_at":"2026-05-18T03:26:22.078461+00:00","updated_at":"2026-05-18T03:26:22.078461+00:00"}