{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VJLUCJJ75LV4P36PNDPBU67WHA","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":"e10e3037dac24d878d467c08b158524d679ea8ebe5c7b7ca29d0a79caa90ac27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-07T19:32:05Z","title_canon_sha256":"d525e0f84c5d0c3a5a4302300d5cb7dd7e4b02ce3114d310521e9979ecc68cf9"},"schema_version":"1.0","source":{"id":"1405.1713","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1713","created_at":"2026-05-18T02:52:24Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1713v1","created_at":"2026-05-18T02:52:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1713","created_at":"2026-05-18T02:52:24Z"},{"alias_kind":"pith_short_12","alias_value":"VJLUCJJ75LV4","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VJLUCJJ75LV4P36P","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VJLUCJJ7","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:c50334acbce5122ed8fec279c28d7d6fd9158d9d5e3771aeb2b67e2ff4739ad8","target":"graph","created_at":"2026-05-18T02:52:24Z","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":"Let G be a simple, connected graph on n vertices. Let d_G(u,v) denote the distance between vertices u and v in G. A subgraph H of G is isometric if d_H(u,v)=d_G(u,v) for every u,v in V(H). We say that G is a distance-preserving graph if G contains at least one isometric subgraph of order k for every k, 1\\le k\\le n. In this paper we construct regular distance-preserving graphs of all possible orders and degrees of regularity. By modifying the Havel-Hakimi algorithm, we are able to construct distance preserving graphs for certain other degree sequences as well. We include a discussion of some re","authors_text":"Abdol-Hossein Esfahanian, Bruce E. Sagan, Dennis Ross, Ronald Nussbaum","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-07T19:32:05Z","title":"On Constructing Regular Distance-Preserving Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1713","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:50156ea02a02c5c67050f63de8759ab3acceebe9476b5043cbc6d1487e20ab7d","target":"record","created_at":"2026-05-18T02:52:24Z","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":"e10e3037dac24d878d467c08b158524d679ea8ebe5c7b7ca29d0a79caa90ac27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-07T19:32:05Z","title_canon_sha256":"d525e0f84c5d0c3a5a4302300d5cb7dd7e4b02ce3114d310521e9979ecc68cf9"},"schema_version":"1.0","source":{"id":"1405.1713","kind":"arxiv","version":1}},"canonical_sha256":"aa5741253feaebc7efcf68de1a7bf6383eb65c70c7572e6bc002d8ee771832aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa5741253feaebc7efcf68de1a7bf6383eb65c70c7572e6bc002d8ee771832aa","first_computed_at":"2026-05-18T02:52:24.043449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:24.043449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MKy2Fp0g/L6pUCt/5c4SSm6tf3RMScGkNRGnKocJm1h+/t9if4Oaml6m3oY3Z/L92txn292y0y4H84+FZy78CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:24.044150Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1713","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50156ea02a02c5c67050f63de8759ab3acceebe9476b5043cbc6d1487e20ab7d","sha256:c50334acbce5122ed8fec279c28d7d6fd9158d9d5e3771aeb2b67e2ff4739ad8"],"state_sha256":"8b26401d6ae3d445f4ea3339216faf211272864a05ac4f1fc17a814deb4ac0ac"}