{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:J4MGDPNPTE2CAR47M2URAK6DBS","short_pith_number":"pith:J4MGDPNP","schema_version":"1.0","canonical_sha256":"4f1861bdaf993420479f66a9102bc30cb131579623f5150af875674bdb9e8309","source":{"kind":"arxiv","id":"1405.7859","version":1},"attestation_state":"computed","paper":{"title":"Chordal Editing is Fixed-Parameter Tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Yixin Cao","submitted_at":"2014-05-30T13:32:18Z","abstract_excerpt":"Graph modification problems are typically asked as follows: is there a small set of operations that transforms a given graph to have a certain property. The most commonly considered operations include vertex deletion, edge deletion, and edge addition; for the same property, one can define significantly different versions by allowing different operations. We study a very general graph modification problem which allows all three types of operations: given a graph $G$ and integers $k_1$, $k_2$, and $k_3$, the \\textsc{chordal editing} problem asks whether $G$ can be transformed into a chordal grap"},"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":"1405.7859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-30T13:32:18Z","cross_cats_sorted":[],"title_canon_sha256":"34e2f09da21af4686e32524bafd7c5fdf7293b17fd48355ab7c4598bedeacf5a","abstract_canon_sha256":"2f63a71ee0bdbc4409d4da3fb27c2a499453dfe91e11ec1cbe51d84bbfa1fa03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:43.882328Z","signature_b64":"WIYMa1Q6M1jAVN3nD/T8kLSf1P/oJa8q3fVe62TI+1VvtQkkZ4cxs6okr55h9HhkHkYN7VNSSHim6iAvyo2eDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f1861bdaf993420479f66a9102bc30cb131579623f5150af875674bdb9e8309","last_reissued_at":"2026-05-18T02:50:43.881847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:43.881847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chordal Editing is Fixed-Parameter Tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Yixin Cao","submitted_at":"2014-05-30T13:32:18Z","abstract_excerpt":"Graph modification problems are typically asked as follows: is there a small set of operations that transforms a given graph to have a certain property. The most commonly considered operations include vertex deletion, edge deletion, and edge addition; for the same property, one can define significantly different versions by allowing different operations. We study a very general graph modification problem which allows all three types of operations: given a graph $G$ and integers $k_1$, $k_2$, and $k_3$, the \\textsc{chordal editing} problem asks whether $G$ can be transformed into a chordal grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7859","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":"1405.7859","created_at":"2026-05-18T02:50:43.881926+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.7859v1","created_at":"2026-05-18T02:50:43.881926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7859","created_at":"2026-05-18T02:50:43.881926+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4MGDPNPTE2C","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4MGDPNPTE2CAR47","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4MGDPNP","created_at":"2026-05-18T12:28:33.132498+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/J4MGDPNPTE2CAR47M2URAK6DBS","json":"https://pith.science/pith/J4MGDPNPTE2CAR47M2URAK6DBS.json","graph_json":"https://pith.science/api/pith-number/J4MGDPNPTE2CAR47M2URAK6DBS/graph.json","events_json":"https://pith.science/api/pith-number/J4MGDPNPTE2CAR47M2URAK6DBS/events.json","paper":"https://pith.science/paper/J4MGDPNP"},"agent_actions":{"view_html":"https://pith.science/pith/J4MGDPNPTE2CAR47M2URAK6DBS","download_json":"https://pith.science/pith/J4MGDPNPTE2CAR47M2URAK6DBS.json","view_paper":"https://pith.science/paper/J4MGDPNP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.7859&json=true","fetch_graph":"https://pith.science/api/pith-number/J4MGDPNPTE2CAR47M2URAK6DBS/graph.json","fetch_events":"https://pith.science/api/pith-number/J4MGDPNPTE2CAR47M2URAK6DBS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4MGDPNPTE2CAR47M2URAK6DBS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4MGDPNPTE2CAR47M2URAK6DBS/action/storage_attestation","attest_author":"https://pith.science/pith/J4MGDPNPTE2CAR47M2URAK6DBS/action/author_attestation","sign_citation":"https://pith.science/pith/J4MGDPNPTE2CAR47M2URAK6DBS/action/citation_signature","submit_replication":"https://pith.science/pith/J4MGDPNPTE2CAR47M2URAK6DBS/action/replication_record"}},"created_at":"2026-05-18T02:50:43.881926+00:00","updated_at":"2026-05-18T02:50:43.881926+00:00"}