{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TNMXQLEVDGS76BSETJ5J3R6JDW","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":"25f1963f2dd7ed8b1115a4a772b71507662dd67d59b8a36f51bb78ef52b3ef69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-16T23:41:36Z","title_canon_sha256":"a17211465bb854b2b3340554047c758cd6209da02a4473a1db7163d141c807e3"},"schema_version":"1.0","source":{"id":"1507.04800","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04800","created_at":"2026-05-18T01:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04800v4","created_at":"2026-05-18T01:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04800","created_at":"2026-05-18T01:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"TNMXQLEVDGS7","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TNMXQLEVDGS76BSE","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TNMXQLEV","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:6f4f2d543de2ca05179eeb47a2c41711435284b232630e2d724380719756a661","target":"graph","created_at":"2026-05-18T01:27:00Z","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":"If $G$ is a graph 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)$ where $d$ is the distance function. 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 give a necessary and sufficient condition for the lexicographic product of two graphs to be a dp graph. A graph $G$ is $sequentially\\ distance\\ preserving\\ (sdp)$ if the vertex set of $G$ can be ordered so that, for all $i\\ge1$, deleting the first $i$ vertices in the sequence results in an isometric g","authors_text":"Bruce E. Sagan, Emad Zahedi, M. H. Khalifeh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-16T23:41:36Z","title":"Distance preserving graphs and graph products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04800","kind":"arxiv","version":4},"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:db1e0777e82786371beb3b434e98b059b4aa204e0f132aaaea00737ff9fbe84d","target":"record","created_at":"2026-05-18T01:27:00Z","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":"25f1963f2dd7ed8b1115a4a772b71507662dd67d59b8a36f51bb78ef52b3ef69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-16T23:41:36Z","title_canon_sha256":"a17211465bb854b2b3340554047c758cd6209da02a4473a1db7163d141c807e3"},"schema_version":"1.0","source":{"id":"1507.04800","kind":"arxiv","version":4}},"canonical_sha256":"9b59782c9519a5ff06449a7a9dc7c91db7386f91c4ba0797e87fefdd6f7e2668","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b59782c9519a5ff06449a7a9dc7c91db7386f91c4ba0797e87fefdd6f7e2668","first_computed_at":"2026-05-18T01:27:00.128086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:00.128086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lPH7NEkyTEEp+FLeDb6V3UmwohJ09kwBV8w2ox+HMCJPokchsk5iasvHTFix3tpxSOTz0TAgsUbPbqOyEvIXAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:00.128844Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04800","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db1e0777e82786371beb3b434e98b059b4aa204e0f132aaaea00737ff9fbe84d","sha256:6f4f2d543de2ca05179eeb47a2c41711435284b232630e2d724380719756a661"],"state_sha256":"0c9adbf860a069db1253ae1105baa39ec2d223f70591e18a00934eb94e516a75"}