{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XFLD4P7VSIFIXHGOTYTXPS2JJI","short_pith_number":"pith:XFLD4P7V","schema_version":"1.0","canonical_sha256":"b9563e3ff5920a8b9cce9e2777cb494a3e6bfd35a73359545ffb07ff175166ce","source":{"kind":"arxiv","id":"1805.09853","version":1},"attestation_state":"computed","paper":{"title":"Modular Decomposition of Graphs and the Distance Preserving Property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Emad Zahedi, Jason P. Smith","submitted_at":"2018-05-24T19:02:01Z","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"},"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":"1805.09853","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-24T19:02:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7624a6125b45d044b2120b4015403e8cd1600cd43fa507c5bb7b228a5e3d8b65","abstract_canon_sha256":"032f7ce9daf42de3d38ef2689ef565737a43a68f40524ee449444d1918f6523e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:58.926218Z","signature_b64":"RJeW/LMbH8HlUsz0xhAWwK0F8ESsAJQDexxkyMFM/0pVf4dtRcQyRVJ7A5rouJlwwhObZgovjzDlARfAe836Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9563e3ff5920a8b9cce9e2777cb494a3e6bfd35a73359545ffb07ff175166ce","last_reissued_at":"2026-05-18T00:14:58.925726Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:58.925726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modular Decomposition of Graphs and the Distance Preserving Property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Emad Zahedi, Jason P. Smith","submitted_at":"2018-05-24T19:02:01Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09853","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":"1805.09853","created_at":"2026-05-18T00:14:58.925788+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.09853v1","created_at":"2026-05-18T00:14:58.925788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09853","created_at":"2026-05-18T00:14:58.925788+00:00"},{"alias_kind":"pith_short_12","alias_value":"XFLD4P7VSIFI","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XFLD4P7VSIFIXHGO","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XFLD4P7V","created_at":"2026-05-18T12:33:01.666342+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/XFLD4P7VSIFIXHGOTYTXPS2JJI","json":"https://pith.science/pith/XFLD4P7VSIFIXHGOTYTXPS2JJI.json","graph_json":"https://pith.science/api/pith-number/XFLD4P7VSIFIXHGOTYTXPS2JJI/graph.json","events_json":"https://pith.science/api/pith-number/XFLD4P7VSIFIXHGOTYTXPS2JJI/events.json","paper":"https://pith.science/paper/XFLD4P7V"},"agent_actions":{"view_html":"https://pith.science/pith/XFLD4P7VSIFIXHGOTYTXPS2JJI","download_json":"https://pith.science/pith/XFLD4P7VSIFIXHGOTYTXPS2JJI.json","view_paper":"https://pith.science/paper/XFLD4P7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.09853&json=true","fetch_graph":"https://pith.science/api/pith-number/XFLD4P7VSIFIXHGOTYTXPS2JJI/graph.json","fetch_events":"https://pith.science/api/pith-number/XFLD4P7VSIFIXHGOTYTXPS2JJI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XFLD4P7VSIFIXHGOTYTXPS2JJI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XFLD4P7VSIFIXHGOTYTXPS2JJI/action/storage_attestation","attest_author":"https://pith.science/pith/XFLD4P7VSIFIXHGOTYTXPS2JJI/action/author_attestation","sign_citation":"https://pith.science/pith/XFLD4P7VSIFIXHGOTYTXPS2JJI/action/citation_signature","submit_replication":"https://pith.science/pith/XFLD4P7VSIFIXHGOTYTXPS2JJI/action/replication_record"}},"created_at":"2026-05-18T00:14:58.925788+00:00","updated_at":"2026-05-18T00:14:58.925788+00:00"}