{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BO2AAYEEWQ3EHZSIONGZWDMQUZ","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":"8d8c15051dafffe2b17af7b81f7ee72f7c723361e10fd01ebe271111f9d754ca","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-17T10:12:48Z","title_canon_sha256":"0efd2115c981be01196071d03bf4ed06200bb1aa990f9cf3a3bced14e2d94f84"},"schema_version":"1.0","source":{"id":"1409.4935","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4935","created_at":"2026-05-18T02:42:38Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4935v1","created_at":"2026-05-18T02:42:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4935","created_at":"2026-05-18T02:42:38Z"},{"alias_kind":"pith_short_12","alias_value":"BO2AAYEEWQ3E","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BO2AAYEEWQ3EHZSI","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BO2AAYEE","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:70d20cf0ea3969fcf864af4fa332592e5232f86107a5cedd6e26eec28a5f577a","target":"graph","created_at":"2026-05-18T02:42:38Z","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":"Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on $n$ vertices and a positive integer parameter $k$, find if there exist $k$ edges (arcs) whose deletion results in a graph that satisfies some specified parity constraints. In particular, when the objective is to obtain a connected graph in which all the vertices have even degrees---where the resulting graph is \\emph{Eulerian}---the problem is called Undirected Eulerian Edge Deletion. The corresponding problem in digraphs where the resulting grap","authors_text":"Fahad Panolan, Geevarghese Philip, Prachi Goyal, Pranabendu Misra, Saket Saurabh","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-17T10:12:48Z","title":"Finding Even Subgraphs Even Faster"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4935","kind":"arxiv","version":1},"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:2ee59cca0f174fde273375dc245128fc21e1297ad0f054a338d7d9cd7d625b93","target":"record","created_at":"2026-05-18T02:42:38Z","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":"8d8c15051dafffe2b17af7b81f7ee72f7c723361e10fd01ebe271111f9d754ca","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-17T10:12:48Z","title_canon_sha256":"0efd2115c981be01196071d03bf4ed06200bb1aa990f9cf3a3bced14e2d94f84"},"schema_version":"1.0","source":{"id":"1409.4935","kind":"arxiv","version":1}},"canonical_sha256":"0bb4006084b43643e648734d9b0d90a649cb34f6aa9e3ccfa480a42501924aff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0bb4006084b43643e648734d9b0d90a649cb34f6aa9e3ccfa480a42501924aff","first_computed_at":"2026-05-18T02:42:38.320886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:38.320886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lh7X9Hy7fTy4/zUnqgcNhqpV8ufIuB/IDZq0gJ0Neflw+pQwM2m7UuCxwHOG2BJG3l0bpezq9FSjP42pEtljCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:38.321554Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.4935","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ee59cca0f174fde273375dc245128fc21e1297ad0f054a338d7d9cd7d625b93","sha256:70d20cf0ea3969fcf864af4fa332592e5232f86107a5cedd6e26eec28a5f577a"],"state_sha256":"64e231a63379024dd96c4cbf23059a44dd6436346a167869d20e3fb9782e897c"}