{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BNLF2RFTDX45WCHMV3Y7ALPPJ3","short_pith_number":"pith:BNLF2RFT","schema_version":"1.0","canonical_sha256":"0b565d44b31df9db08ecaef1f02def4ef86c2f47a77ed58e5878b306bc05a713","source":{"kind":"arxiv","id":"1806.09442","version":1},"attestation_state":"computed","paper":{"title":"Encoding shortest paths in graphs assuming the code is queried using bit-wise comparison","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexei Vernitski, Gokce Caylak Kayaturan","submitted_at":"2018-06-25T13:19:13Z","abstract_excerpt":"One model of message delivery in a computer network is based on labelling each edge by a subset of a (reasonably small) universal set, and then encoding a path as the union of the labels of its edges. Earlier work suggested using random edge labels, and that approach has a disadvantage of producing errors (false positives). We demonstrate that if we make an assumption about the shape of the network (in this paper we consider networks with a dense core and a tree-like periphery) and assume that messages are delivered along shortest paths, we can label edges in a way which prevents any false pos"},"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":"1806.09442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-25T13:19:13Z","cross_cats_sorted":[],"title_canon_sha256":"a567e33563e9987ce2b92054c43607d59e2cfcb9bba41bb8a951fc11a1cfd262","abstract_canon_sha256":"7a51d9fab3c7cf1cec1fa36d2e48b067ef01a49b7aa95bc25cbfd2dbc3d9ca76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:27.282593Z","signature_b64":"D9DgZAtYQYHX7w7XtbT/7PbnwjbO9oIHulVHz1c1MtSGCewcSeFe48u8+aJNeyINIVoSqjPjK8SVX5ZAUo3vDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b565d44b31df9db08ecaef1f02def4ef86c2f47a77ed58e5878b306bc05a713","last_reissued_at":"2026-05-18T00:12:27.281950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:27.281950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Encoding shortest paths in graphs assuming the code is queried using bit-wise comparison","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexei Vernitski, Gokce Caylak Kayaturan","submitted_at":"2018-06-25T13:19:13Z","abstract_excerpt":"One model of message delivery in a computer network is based on labelling each edge by a subset of a (reasonably small) universal set, and then encoding a path as the union of the labels of its edges. Earlier work suggested using random edge labels, and that approach has a disadvantage of producing errors (false positives). We demonstrate that if we make an assumption about the shape of the network (in this paper we consider networks with a dense core and a tree-like periphery) and assume that messages are delivered along shortest paths, we can label edges in a way which prevents any false pos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09442","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":"1806.09442","created_at":"2026-05-18T00:12:27.282046+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.09442v1","created_at":"2026-05-18T00:12:27.282046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09442","created_at":"2026-05-18T00:12:27.282046+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNLF2RFTDX45","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNLF2RFTDX45WCHM","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNLF2RFT","created_at":"2026-05-18T12:32:16.446611+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/BNLF2RFTDX45WCHMV3Y7ALPPJ3","json":"https://pith.science/pith/BNLF2RFTDX45WCHMV3Y7ALPPJ3.json","graph_json":"https://pith.science/api/pith-number/BNLF2RFTDX45WCHMV3Y7ALPPJ3/graph.json","events_json":"https://pith.science/api/pith-number/BNLF2RFTDX45WCHMV3Y7ALPPJ3/events.json","paper":"https://pith.science/paper/BNLF2RFT"},"agent_actions":{"view_html":"https://pith.science/pith/BNLF2RFTDX45WCHMV3Y7ALPPJ3","download_json":"https://pith.science/pith/BNLF2RFTDX45WCHMV3Y7ALPPJ3.json","view_paper":"https://pith.science/paper/BNLF2RFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.09442&json=true","fetch_graph":"https://pith.science/api/pith-number/BNLF2RFTDX45WCHMV3Y7ALPPJ3/graph.json","fetch_events":"https://pith.science/api/pith-number/BNLF2RFTDX45WCHMV3Y7ALPPJ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNLF2RFTDX45WCHMV3Y7ALPPJ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNLF2RFTDX45WCHMV3Y7ALPPJ3/action/storage_attestation","attest_author":"https://pith.science/pith/BNLF2RFTDX45WCHMV3Y7ALPPJ3/action/author_attestation","sign_citation":"https://pith.science/pith/BNLF2RFTDX45WCHMV3Y7ALPPJ3/action/citation_signature","submit_replication":"https://pith.science/pith/BNLF2RFTDX45WCHMV3Y7ALPPJ3/action/replication_record"}},"created_at":"2026-05-18T00:12:27.282046+00:00","updated_at":"2026-05-18T00:12:27.282046+00:00"}