{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BNLF2RFTDX45WCHMV3Y7ALPPJ3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7a51d9fab3c7cf1cec1fa36d2e48b067ef01a49b7aa95bc25cbfd2dbc3d9ca76","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-25T13:19:13Z","title_canon_sha256":"a567e33563e9987ce2b92054c43607d59e2cfcb9bba41bb8a951fc11a1cfd262"},"schema_version":"1.0","source":{"id":"1806.09442","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09442","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09442v1","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09442","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"pith_short_12","alias_value":"BNLF2RFTDX45","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BNLF2RFTDX45WCHM","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BNLF2RFT","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:b413f5834e2177bfc41a2de305f40496103e848ca4a5363ea711d9251ab344a2","target":"graph","created_at":"2026-05-18T00:12:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexei Vernitski, Gokce Caylak Kayaturan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-25T13:19:13Z","title":"Encoding shortest paths in graphs assuming the code is queried using bit-wise comparison"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09442","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:43dea4f27fcf0565ee59caa7ee4f29f87b67ba35a93eea5a75c08193b27f01a9","target":"record","created_at":"2026-05-18T00:12:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7a51d9fab3c7cf1cec1fa36d2e48b067ef01a49b7aa95bc25cbfd2dbc3d9ca76","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-25T13:19:13Z","title_canon_sha256":"a567e33563e9987ce2b92054c43607d59e2cfcb9bba41bb8a951fc11a1cfd262"},"schema_version":"1.0","source":{"id":"1806.09442","kind":"arxiv","version":1}},"canonical_sha256":"0b565d44b31df9db08ecaef1f02def4ef86c2f47a77ed58e5878b306bc05a713","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b565d44b31df9db08ecaef1f02def4ef86c2f47a77ed58e5878b306bc05a713","first_computed_at":"2026-05-18T00:12:27.281950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:27.281950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D9DgZAtYQYHX7w7XtbT/7PbnwjbO9oIHulVHz1c1MtSGCewcSeFe48u8+aJNeyINIVoSqjPjK8SVX5ZAUo3vDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:27.282593Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09442","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43dea4f27fcf0565ee59caa7ee4f29f87b67ba35a93eea5a75c08193b27f01a9","sha256:b413f5834e2177bfc41a2de305f40496103e848ca4a5363ea711d9251ab344a2"],"state_sha256":"37af558875abe706d5526c0d15ac6dc49c57ac9427f81f72d7cdb74f3425db7f"}