{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:C2TFCLZRGTAZAGGR2PCFSKHJXL","short_pith_number":"pith:C2TFCLZR","schema_version":"1.0","canonical_sha256":"16a6512f3134c19018d1d3c45928e9baef94403c35f3d0d1dc7dda8171f57a13","source":{"kind":"arxiv","id":"1406.4718","version":2},"attestation_state":"computed","paper":{"title":"Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Anuj Dawar, Jannis Bulian","submitted_at":"2014-06-18T14:08:39Z","abstract_excerpt":"A commonly studied means of parameterizing graph problems is the deletion distance from triviality (Guo et al. 2004), which counts vertices that need to be deleted from a graph to place it in some class for which efficient algorithms are known. In the context of graph isomorphism, we define triviality to mean a graph with maximum degree bounded by a constant, as such graph classes admit polynomial-time isomorphism tests. We generalise deletion distance to a measure we call elimination distance to triviality, based on elimination trees or tree-depth decompositions. We establish that graph canon"},"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":"1406.4718","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-18T14:08:39Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"c902b8decd5500774cc2d5fb79245efdd6c6bd0fca4810cf34a085bb877ad864","abstract_canon_sha256":"a153cdc85dbaabb81456156061abf40453413b72b13c4ff618cb2fc48a8c561d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:01.747594Z","signature_b64":"DW/uRkKTp5IE0D2sJae3hWKjgRagDMdm/LGA+7rI9+qTaDA2Yl+mEm8itPwnmodoM516TKPbfjNyTZqDwU15Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16a6512f3134c19018d1d3c45928e9baef94403c35f3d0d1dc7dda8171f57a13","last_reissued_at":"2026-05-18T02:40:01.746754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:01.746754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Anuj Dawar, Jannis Bulian","submitted_at":"2014-06-18T14:08:39Z","abstract_excerpt":"A commonly studied means of parameterizing graph problems is the deletion distance from triviality (Guo et al. 2004), which counts vertices that need to be deleted from a graph to place it in some class for which efficient algorithms are known. In the context of graph isomorphism, we define triviality to mean a graph with maximum degree bounded by a constant, as such graph classes admit polynomial-time isomorphism tests. We generalise deletion distance to a measure we call elimination distance to triviality, based on elimination trees or tree-depth decompositions. We establish that graph canon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4718","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":"1406.4718","created_at":"2026-05-18T02:40:01.746899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.4718v2","created_at":"2026-05-18T02:40:01.746899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4718","created_at":"2026-05-18T02:40:01.746899+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2TFCLZRGTAZ","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2TFCLZRGTAZAGGR","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2TFCLZR","created_at":"2026-05-18T12:28:22.404517+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/C2TFCLZRGTAZAGGR2PCFSKHJXL","json":"https://pith.science/pith/C2TFCLZRGTAZAGGR2PCFSKHJXL.json","graph_json":"https://pith.science/api/pith-number/C2TFCLZRGTAZAGGR2PCFSKHJXL/graph.json","events_json":"https://pith.science/api/pith-number/C2TFCLZRGTAZAGGR2PCFSKHJXL/events.json","paper":"https://pith.science/paper/C2TFCLZR"},"agent_actions":{"view_html":"https://pith.science/pith/C2TFCLZRGTAZAGGR2PCFSKHJXL","download_json":"https://pith.science/pith/C2TFCLZRGTAZAGGR2PCFSKHJXL.json","view_paper":"https://pith.science/paper/C2TFCLZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.4718&json=true","fetch_graph":"https://pith.science/api/pith-number/C2TFCLZRGTAZAGGR2PCFSKHJXL/graph.json","fetch_events":"https://pith.science/api/pith-number/C2TFCLZRGTAZAGGR2PCFSKHJXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2TFCLZRGTAZAGGR2PCFSKHJXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2TFCLZRGTAZAGGR2PCFSKHJXL/action/storage_attestation","attest_author":"https://pith.science/pith/C2TFCLZRGTAZAGGR2PCFSKHJXL/action/author_attestation","sign_citation":"https://pith.science/pith/C2TFCLZRGTAZAGGR2PCFSKHJXL/action/citation_signature","submit_replication":"https://pith.science/pith/C2TFCLZRGTAZAGGR2PCFSKHJXL/action/replication_record"}},"created_at":"2026-05-18T02:40:01.746899+00:00","updated_at":"2026-05-18T02:40:01.746899+00:00"}