{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:C2TFCLZRGTAZAGGR2PCFSKHJXL","short_pith_number":"pith:C2TFCLZR","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"},"canonical_sha256":"16a6512f3134c19018d1d3c45928e9baef94403c35f3d0d1dc7dda8171f57a13","source":{"kind":"arxiv","id":"1406.4718","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4718","created_at":"2026-05-18T02:40:01Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4718v2","created_at":"2026-05-18T02:40:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4718","created_at":"2026-05-18T02:40:01Z"},{"alias_kind":"pith_short_12","alias_value":"C2TFCLZRGTAZ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"C2TFCLZRGTAZAGGR","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"C2TFCLZR","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:C2TFCLZRGTAZAGGR2PCFSKHJXL","target":"record","payload":{"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"},"canonical_sha256":"16a6512f3134c19018d1d3c45928e9baef94403c35f3d0d1dc7dda8171f57a13","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"},"source_kind":"arxiv","source_id":"1406.4718","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:40:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c7vwLuRvoepJers9Oxyj+14yffsDTCqP3n8MHOeFQ95vWiUCkzQAS84S7EjmJdvU9YT68xszp9exsu+hMHdpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:51:12.314148Z"},"content_sha256":"270fe551abb3cb0a556032480cbdf59833ad9d45c910192773bb6cab9eb30f5d","schema_version":"1.0","event_id":"sha256:270fe551abb3cb0a556032480cbdf59833ad9d45c910192773bb6cab9eb30f5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:C2TFCLZRGTAZAGGR2PCFSKHJXL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:40:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yEXira1HfwnCIvEJiF9kz3vmmvn4t3RwuGxxvHRriewuvjVlTcM1LQZyyKQKFMhoQeNg3t+k/w1BA5ncWUpZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:51:12.314569Z"},"content_sha256":"870e41af73b62a08af983f0f890167020635d3eeccc8921c9e6c7564030abe5c","schema_version":"1.0","event_id":"sha256:870e41af73b62a08af983f0f890167020635d3eeccc8921c9e6c7564030abe5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C2TFCLZRGTAZAGGR2PCFSKHJXL/bundle.json","state_url":"https://pith.science/pith/C2TFCLZRGTAZAGGR2PCFSKHJXL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C2TFCLZRGTAZAGGR2PCFSKHJXL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T10:51:12Z","links":{"resolver":"https://pith.science/pith/C2TFCLZRGTAZAGGR2PCFSKHJXL","bundle":"https://pith.science/pith/C2TFCLZRGTAZAGGR2PCFSKHJXL/bundle.json","state":"https://pith.science/pith/C2TFCLZRGTAZAGGR2PCFSKHJXL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C2TFCLZRGTAZAGGR2PCFSKHJXL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:C2TFCLZRGTAZAGGR2PCFSKHJXL","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":"a153cdc85dbaabb81456156061abf40453413b72b13c4ff618cb2fc48a8c561d","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-18T14:08:39Z","title_canon_sha256":"c902b8decd5500774cc2d5fb79245efdd6c6bd0fca4810cf34a085bb877ad864"},"schema_version":"1.0","source":{"id":"1406.4718","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4718","created_at":"2026-05-18T02:40:01Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4718v2","created_at":"2026-05-18T02:40:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4718","created_at":"2026-05-18T02:40:01Z"},{"alias_kind":"pith_short_12","alias_value":"C2TFCLZRGTAZ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"C2TFCLZRGTAZAGGR","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"C2TFCLZR","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:870e41af73b62a08af983f0f890167020635d3eeccc8921c9e6c7564030abe5c","target":"graph","created_at":"2026-05-18T02:40:01Z","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":"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","authors_text":"Anuj Dawar, Jannis Bulian","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-18T14:08:39Z","title":"Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4718","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:270fe551abb3cb0a556032480cbdf59833ad9d45c910192773bb6cab9eb30f5d","target":"record","created_at":"2026-05-18T02:40:01Z","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":"a153cdc85dbaabb81456156061abf40453413b72b13c4ff618cb2fc48a8c561d","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-18T14:08:39Z","title_canon_sha256":"c902b8decd5500774cc2d5fb79245efdd6c6bd0fca4810cf34a085bb877ad864"},"schema_version":"1.0","source":{"id":"1406.4718","kind":"arxiv","version":2}},"canonical_sha256":"16a6512f3134c19018d1d3c45928e9baef94403c35f3d0d1dc7dda8171f57a13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16a6512f3134c19018d1d3c45928e9baef94403c35f3d0d1dc7dda8171f57a13","first_computed_at":"2026-05-18T02:40:01.746754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:01.746754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DW/uRkKTp5IE0D2sJae3hWKjgRagDMdm/LGA+7rI9+qTaDA2Yl+mEm8itPwnmodoM516TKPbfjNyTZqDwU15Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:01.747594Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.4718","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:270fe551abb3cb0a556032480cbdf59833ad9d45c910192773bb6cab9eb30f5d","sha256:870e41af73b62a08af983f0f890167020635d3eeccc8921c9e6c7564030abe5c"],"state_sha256":"8de14f62a0ee853da417d28d5e4eccb14f19967a7f02882a70b7fd5cfb299cbf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FcyJfqOv45KSu3XCZrFQik20rrjV4RbuLPKLghaZDcimL3/u2uUKuJ5Z3cuu6apGjq8j2EoyhUO8z6VL5TJ9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:51:12.316856Z","bundle_sha256":"ccfe991712d4cdb3aa70c54524f41ce4702e344e942e351836aa8375a0737630"}}