{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TNMXQLEVDGS76BSETJ5J3R6JDW","short_pith_number":"pith:TNMXQLEV","canonical_record":{"source":{"id":"1507.04800","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-16T23:41:36Z","cross_cats_sorted":[],"title_canon_sha256":"a17211465bb854b2b3340554047c758cd6209da02a4473a1db7163d141c807e3","abstract_canon_sha256":"25f1963f2dd7ed8b1115a4a772b71507662dd67d59b8a36f51bb78ef52b3ef69"},"schema_version":"1.0"},"canonical_sha256":"9b59782c9519a5ff06449a7a9dc7c91db7386f91c4ba0797e87fefdd6f7e2668","source":{"kind":"arxiv","id":"1507.04800","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TNMXQLEVDGS76BSETJ5J3R6JDW","target":"record","payload":{"canonical_record":{"source":{"id":"1507.04800","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-16T23:41:36Z","cross_cats_sorted":[],"title_canon_sha256":"a17211465bb854b2b3340554047c758cd6209da02a4473a1db7163d141c807e3","abstract_canon_sha256":"25f1963f2dd7ed8b1115a4a772b71507662dd67d59b8a36f51bb78ef52b3ef69"},"schema_version":"1.0"},"canonical_sha256":"9b59782c9519a5ff06449a7a9dc7c91db7386f91c4ba0797e87fefdd6f7e2668","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:00.128844Z","signature_b64":"lPH7NEkyTEEp+FLeDb6V3UmwohJ09kwBV8w2ox+HMCJPokchsk5iasvHTFix3tpxSOTz0TAgsUbPbqOyEvIXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b59782c9519a5ff06449a7a9dc7c91db7386f91c4ba0797e87fefdd6f7e2668","last_reissued_at":"2026-05-18T01:27:00.128086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:00.128086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.04800","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fsRTIfMlWfGa26A7l+aeHTfzQY57OULF0DXH1fc0F4ZVkSUX8hEifqqsJGmrexaXP+OwDJ8wpD3r8/VizA2XBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:38:48.319175Z"},"content_sha256":"db1e0777e82786371beb3b434e98b059b4aa204e0f132aaaea00737ff9fbe84d","schema_version":"1.0","event_id":"sha256:db1e0777e82786371beb3b434e98b059b4aa204e0f132aaaea00737ff9fbe84d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TNMXQLEVDGS76BSETJ5J3R6JDW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distance preserving graphs and graph products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bruce E. Sagan, Emad Zahedi, M. H. Khalifeh","submitted_at":"2015-07-16T23:41:36Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04800","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ca/n8FQl7+7+eHL03DIPckZb4w6rR2Gsf3S1HavmZtQ8cClo5uLS4TIMT7l5vOVdg8qFsFVolNtuNivkBlpVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:38:48.320013Z"},"content_sha256":"6f4f2d543de2ca05179eeb47a2c41711435284b232630e2d724380719756a661","schema_version":"1.0","event_id":"sha256:6f4f2d543de2ca05179eeb47a2c41711435284b232630e2d724380719756a661"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TNMXQLEVDGS76BSETJ5J3R6JDW/bundle.json","state_url":"https://pith.science/pith/TNMXQLEVDGS76BSETJ5J3R6JDW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TNMXQLEVDGS76BSETJ5J3R6JDW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T06:38:48Z","links":{"resolver":"https://pith.science/pith/TNMXQLEVDGS76BSETJ5J3R6JDW","bundle":"https://pith.science/pith/TNMXQLEVDGS76BSETJ5J3R6JDW/bundle.json","state":"https://pith.science/pith/TNMXQLEVDGS76BSETJ5J3R6JDW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TNMXQLEVDGS76BSETJ5J3R6JDW/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m95fyKTOxbHoDwwwUyHCFOPHXV2a6CsB0ZuuATj/kxy+D+zuxqC+jxVKP1hmkyNg/Kkl/pVPr/QqqtDMA/NbAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:38:48.324443Z","bundle_sha256":"90cab2dd84fbd5dc41608b11b050c76caa9c217a5ff99bf12c1640b75efd9022"}}