{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:TKKRZHPRBLFZ2MGNXOKAIJL7NM","short_pith_number":"pith:TKKRZHPR","schema_version":"1.0","canonical_sha256":"9a951c9df10acb9d30cdbb9404257f6b32992b7cdef2615bf87ff814498eac2f","source":{"kind":"arxiv","id":"math/0606475","version":2},"attestation_state":"computed","paper":{"title":"On the editing distance of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'e K\\'ezdy, Maria Axenovich, Ryan R. Martin","submitted_at":"2006-06-19T21:27:51Z","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"},"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":"math/0606475","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2006-06-19T21:27:51Z","cross_cats_sorted":[],"title_canon_sha256":"1509be30ca62a935af224bc8072de3c0e01fc26c98daf2195642b462a2c0f7ef","abstract_canon_sha256":"9ebbbf51af62bb1361c7468cfbc8a258b3bf808cdffb80f822a577496fceda08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:10.405973Z","signature_b64":"C2z6+PFk1KSHdEEKKXtWhkr86Z1HYdfhHrxD/G7wV9accjRIxn+5tPRrUt9XHjRqFCcW6aW8aV99aZcSPerPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a951c9df10acb9d30cdbb9404257f6b32992b7cdef2615bf87ff814498eac2f","last_reissued_at":"2026-05-18T01:14:10.405265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:10.405265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the editing distance of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'e K\\'ezdy, Maria Axenovich, Ryan R. Martin","submitted_at":"2006-06-19T21:27:51Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0606475","kind":"arxiv","version":2},"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":"math/0606475","created_at":"2026-05-18T01:14:10.405378+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0606475v2","created_at":"2026-05-18T01:14:10.405378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0606475","created_at":"2026-05-18T01:14:10.405378+00:00"},{"alias_kind":"pith_short_12","alias_value":"TKKRZHPRBLFZ","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"TKKRZHPRBLFZ2MGN","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"TKKRZHPR","created_at":"2026-05-18T12:25:54.717736+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/TKKRZHPRBLFZ2MGNXOKAIJL7NM","json":"https://pith.science/pith/TKKRZHPRBLFZ2MGNXOKAIJL7NM.json","graph_json":"https://pith.science/api/pith-number/TKKRZHPRBLFZ2MGNXOKAIJL7NM/graph.json","events_json":"https://pith.science/api/pith-number/TKKRZHPRBLFZ2MGNXOKAIJL7NM/events.json","paper":"https://pith.science/paper/TKKRZHPR"},"agent_actions":{"view_html":"https://pith.science/pith/TKKRZHPRBLFZ2MGNXOKAIJL7NM","download_json":"https://pith.science/pith/TKKRZHPRBLFZ2MGNXOKAIJL7NM.json","view_paper":"https://pith.science/paper/TKKRZHPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0606475&json=true","fetch_graph":"https://pith.science/api/pith-number/TKKRZHPRBLFZ2MGNXOKAIJL7NM/graph.json","fetch_events":"https://pith.science/api/pith-number/TKKRZHPRBLFZ2MGNXOKAIJL7NM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TKKRZHPRBLFZ2MGNXOKAIJL7NM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TKKRZHPRBLFZ2MGNXOKAIJL7NM/action/storage_attestation","attest_author":"https://pith.science/pith/TKKRZHPRBLFZ2MGNXOKAIJL7NM/action/author_attestation","sign_citation":"https://pith.science/pith/TKKRZHPRBLFZ2MGNXOKAIJL7NM/action/citation_signature","submit_replication":"https://pith.science/pith/TKKRZHPRBLFZ2MGNXOKAIJL7NM/action/replication_record"}},"created_at":"2026-05-18T01:14:10.405378+00:00","updated_at":"2026-05-18T01:14:10.405378+00:00"}