{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XFLD4P7VSIFIXHGOTYTXPS2JJI","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":"032f7ce9daf42de3d38ef2689ef565737a43a68f40524ee449444d1918f6523e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-24T19:02:01Z","title_canon_sha256":"7624a6125b45d044b2120b4015403e8cd1600cd43fa507c5bb7b228a5e3d8b65"},"schema_version":"1.0","source":{"id":"1805.09853","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09853","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09853v1","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09853","created_at":"2026-05-18T00:14:58Z"},{"alias_kind":"pith_short_12","alias_value":"XFLD4P7VSIFI","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XFLD4P7VSIFIXHGO","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XFLD4P7V","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:abda5e4bbcdcba500cf0155ee3e7cb8dd6e5db2028f4143a63e6e0ea08f4309b","target":"graph","created_at":"2026-05-18T00:14:58Z","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":"Given a graph $G$, a subgraph $H$ is isometric if $d_H(u,v) = d_G(u,v)$ for every pair $u,v\\in V(H)$, where $d$ is the distance function. A graph $G$ is distance preserving (dp) if it has an isometric subgraph of every possible order. A graph is sequentially distance preserving (sdp) if its vertices can be ordered such that deleting the first $i$ vertices results in an isometric subgraph, for all $i\\ge1$. We introduce a generalisation of the lexicographic product of graphs, which can be used to non-trivially describe graphs. This generalisation is the inverse of the modular decomposition of gr","authors_text":"Emad Zahedi, Jason P. Smith","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-24T19:02:01Z","title":"Modular Decomposition of Graphs and the Distance Preserving Property"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09853","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:77cb34a53f4456fb67d989d58e2c29b0a419eaade83408be75e726f6cd483cfb","target":"record","created_at":"2026-05-18T00:14:58Z","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":"032f7ce9daf42de3d38ef2689ef565737a43a68f40524ee449444d1918f6523e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-24T19:02:01Z","title_canon_sha256":"7624a6125b45d044b2120b4015403e8cd1600cd43fa507c5bb7b228a5e3d8b65"},"schema_version":"1.0","source":{"id":"1805.09853","kind":"arxiv","version":1}},"canonical_sha256":"b9563e3ff5920a8b9cce9e2777cb494a3e6bfd35a73359545ffb07ff175166ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9563e3ff5920a8b9cce9e2777cb494a3e6bfd35a73359545ffb07ff175166ce","first_computed_at":"2026-05-18T00:14:58.925726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:58.925726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RJeW/LMbH8HlUsz0xhAWwK0F8ESsAJQDexxkyMFM/0pVf4dtRcQyRVJ7A5rouJlwwhObZgovjzDlARfAe836Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:58.926218Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09853","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77cb34a53f4456fb67d989d58e2c29b0a419eaade83408be75e726f6cd483cfb","sha256:abda5e4bbcdcba500cf0155ee3e7cb8dd6e5db2028f4143a63e6e0ea08f4309b"],"state_sha256":"8e55201e905164ad94608989974044a2b80920f2f099153d1617dc779e44a69d"}