{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:TKKRZHPRBLFZ2MGNXOKAIJL7NM","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":"9ebbbf51af62bb1361c7468cfbc8a258b3bf808cdffb80f822a577496fceda08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2006-06-19T21:27:51Z","title_canon_sha256":"1509be30ca62a935af224bc8072de3c0e01fc26c98daf2195642b462a2c0f7ef"},"schema_version":"1.0","source":{"id":"math/0606475","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0606475","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"arxiv_version","alias_value":"math/0606475v2","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0606475","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"pith_short_12","alias_value":"TKKRZHPRBLFZ","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"TKKRZHPRBLFZ2MGN","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"TKKRZHPR","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:bcce54b4eab3734be682e58d430e9f31abdd3d5485d4108947c35f08e74a4ff3","target":"graph","created_at":"2026-05-18T01:14:10Z","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":"An edge-operation on a graph $G$ is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs $\\mathcal{G}$, the editing distance from $G$ to $\\mathcal{G}$ is the smallest number of edge-operations needed to modify $G$ into a graph from $\\mathcal{G}$. In this paper, we fix a graph $H$ and consider ${\\rm Forb}(n,H)$, the set of all graphs on $n$ vertices that have no induced copy of $H$. We provide bounds for the maximum over all $n$-vertex graphs $G$ of the editing distance from $G$ to ${\\rm Forb}(n,H)$, using an invariant we call the","authors_text":"Andr\\'e K\\'ezdy, Maria Axenovich, Ryan R. Martin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2006-06-19T21:27:51Z","title":"On the editing distance of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0606475","kind":"arxiv","version":2},"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:96cb1a330309d0e5535c2731790090c3dfe0a3d8bed3991fa53ed2989413116e","target":"record","created_at":"2026-05-18T01:14:10Z","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":"9ebbbf51af62bb1361c7468cfbc8a258b3bf808cdffb80f822a577496fceda08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2006-06-19T21:27:51Z","title_canon_sha256":"1509be30ca62a935af224bc8072de3c0e01fc26c98daf2195642b462a2c0f7ef"},"schema_version":"1.0","source":{"id":"math/0606475","kind":"arxiv","version":2}},"canonical_sha256":"9a951c9df10acb9d30cdbb9404257f6b32992b7cdef2615bf87ff814498eac2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a951c9df10acb9d30cdbb9404257f6b32992b7cdef2615bf87ff814498eac2f","first_computed_at":"2026-05-18T01:14:10.405265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:10.405265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C2z6+PFk1KSHdEEKKXtWhkr86Z1HYdfhHrxD/G7wV9accjRIxn+5tPRrUt9XHjRqFCcW6aW8aV99aZcSPerPDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:10.405973Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0606475","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96cb1a330309d0e5535c2731790090c3dfe0a3d8bed3991fa53ed2989413116e","sha256:bcce54b4eab3734be682e58d430e9f31abdd3d5485d4108947c35f08e74a4ff3"],"state_sha256":"a2fc7210245e545e27ff2c2d2d9483ee0987bee39689013dd0a453c2f16e1bf8"}