{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ET6HUYRZTI6BT7IZMJNJ7ZMCKI","short_pith_number":"pith:ET6HUYRZ","schema_version":"1.0","canonical_sha256":"24fc7a62399a3c19fd19625a9fe582520c21f6ceadb93dba152a74e7a16216f9","source":{"kind":"arxiv","id":"1507.03615","version":1},"attestation_state":"computed","paper":{"title":"Distance Preserving Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emad Zahedi","submitted_at":"2015-07-13T20:50:38Z","abstract_excerpt":"Given a graph $G$ then a subgraph $H$ is $isometric$ if, for every pair of vertices $u,v$ of $H$, we have $d_H(u,v) = d_G(u,v)$. We say a graph $G$ is $distance\\ preserving\\ (dp)$ if it has an isometric subgraph of every possible order up to the order of $G$. We consider how to add a vertex to a dp graph so that the result is a dp graph. This condition implies that chordal graphs are dp. We also find a condition on the girth of $G$ which implies that it is not dp. In closing, we discuss other work and open problems concerning dp graphs."},"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":"1507.03615","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-13T20:50:38Z","cross_cats_sorted":[],"title_canon_sha256":"9f58e0ee84b01515759686f40783bc931ea908fcbfdd3c3aaf410fc45879ff2b","abstract_canon_sha256":"0f0dd913b8dae6c55937ed0ad14207b92a4f01608169ba12cd83b013b9c1bdfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:57.808453Z","signature_b64":"zof2on4PEe37fE7GuK1iBToKdVMy+E32gnlBRrHx8/+iyM6JVcWogmrg70oZ7FKSkT8VRFhhrPdt3SZQU5rVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24fc7a62399a3c19fd19625a9fe582520c21f6ceadb93dba152a74e7a16216f9","last_reissued_at":"2026-05-18T01:36:57.807798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:57.807798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance Preserving Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emad Zahedi","submitted_at":"2015-07-13T20:50:38Z","abstract_excerpt":"Given a graph $G$ then a subgraph $H$ is $isometric$ if, for every pair of vertices $u,v$ of $H$, we have $d_H(u,v) = d_G(u,v)$. We say a graph $G$ is $distance\\ preserving\\ (dp)$ if it has an isometric subgraph of every possible order up to the order of $G$. We consider how to add a vertex to a dp graph so that the result is a dp graph. This condition implies that chordal graphs are dp. We also find a condition on the girth of $G$ which implies that it is not dp. In closing, we discuss other work and open problems concerning dp graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03615","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":"1507.03615","created_at":"2026-05-18T01:36:57.807899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03615v1","created_at":"2026-05-18T01:36:57.807899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03615","created_at":"2026-05-18T01:36:57.807899+00:00"},{"alias_kind":"pith_short_12","alias_value":"ET6HUYRZTI6B","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"ET6HUYRZTI6BT7IZ","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"ET6HUYRZ","created_at":"2026-05-18T12:29:19.899920+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/ET6HUYRZTI6BT7IZMJNJ7ZMCKI","json":"https://pith.science/pith/ET6HUYRZTI6BT7IZMJNJ7ZMCKI.json","graph_json":"https://pith.science/api/pith-number/ET6HUYRZTI6BT7IZMJNJ7ZMCKI/graph.json","events_json":"https://pith.science/api/pith-number/ET6HUYRZTI6BT7IZMJNJ7ZMCKI/events.json","paper":"https://pith.science/paper/ET6HUYRZ"},"agent_actions":{"view_html":"https://pith.science/pith/ET6HUYRZTI6BT7IZMJNJ7ZMCKI","download_json":"https://pith.science/pith/ET6HUYRZTI6BT7IZMJNJ7ZMCKI.json","view_paper":"https://pith.science/paper/ET6HUYRZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03615&json=true","fetch_graph":"https://pith.science/api/pith-number/ET6HUYRZTI6BT7IZMJNJ7ZMCKI/graph.json","fetch_events":"https://pith.science/api/pith-number/ET6HUYRZTI6BT7IZMJNJ7ZMCKI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ET6HUYRZTI6BT7IZMJNJ7ZMCKI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ET6HUYRZTI6BT7IZMJNJ7ZMCKI/action/storage_attestation","attest_author":"https://pith.science/pith/ET6HUYRZTI6BT7IZMJNJ7ZMCKI/action/author_attestation","sign_citation":"https://pith.science/pith/ET6HUYRZTI6BT7IZMJNJ7ZMCKI/action/citation_signature","submit_replication":"https://pith.science/pith/ET6HUYRZTI6BT7IZMJNJ7ZMCKI/action/replication_record"}},"created_at":"2026-05-18T01:36:57.807899+00:00","updated_at":"2026-05-18T01:36:57.807899+00:00"}