{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UROD2CYQ6LMPFVRJM6QHETUMKR","short_pith_number":"pith:UROD2CYQ","canonical_record":{"source":{"id":"1410.6863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-25T01:07:18Z","cross_cats_sorted":[],"title_canon_sha256":"a009cb64998d7f1a63968e60398d57814ece08c867cd9b9407225e3fbb3e0934","abstract_canon_sha256":"ec8c6cd681dc33c9157d2c5b7344258d6a477caf3449ddbbedeb6e53e3baa0b7"},"schema_version":"1.0"},"canonical_sha256":"a45c3d0b10f2d8f2d62967a0724e8c545fa0066f6d631ab28f4cc6b2d53f347a","source":{"kind":"arxiv","id":"1410.6863","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6863","created_at":"2026-05-18T02:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6863v1","created_at":"2026-05-18T02:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6863","created_at":"2026-05-18T02:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"UROD2CYQ6LMP","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UROD2CYQ6LMPFVRJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UROD2CYQ","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UROD2CYQ6LMPFVRJM6QHETUMKR","target":"record","payload":{"canonical_record":{"source":{"id":"1410.6863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-25T01:07:18Z","cross_cats_sorted":[],"title_canon_sha256":"a009cb64998d7f1a63968e60398d57814ece08c867cd9b9407225e3fbb3e0934","abstract_canon_sha256":"ec8c6cd681dc33c9157d2c5b7344258d6a477caf3449ddbbedeb6e53e3baa0b7"},"schema_version":"1.0"},"canonical_sha256":"a45c3d0b10f2d8f2d62967a0724e8c545fa0066f6d631ab28f4cc6b2d53f347a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:18.457026Z","signature_b64":"1QkUzg7CH+FiNsqAuEPlLOxozghSouSWVpHfhu84othzuQM8PrFAyHNWrnREBfC8jasPt4tF9QzGhVk6NpCkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a45c3d0b10f2d8f2d62967a0724e8c545fa0066f6d631ab28f4cc6b2d53f347a","last_reissued_at":"2026-05-18T02:39:18.456564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:18.456564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.6863","source_version":1,"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:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xYrDQc8I8qepqKA7dDJj1DTv9wR33SaNRDkGs1tLabjq+PWW1hlZKfltSwUax50AoI+wWq1sw6rz+sPHhuQ5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:39:38.340543Z"},"content_sha256":"f9fa5a6b77ffb680ae18dd72b8b8bf6e3f778982cf8ef38babb244f607c2e2ef","schema_version":"1.0","event_id":"sha256:f9fa5a6b77ffb680ae18dd72b8b8bf6e3f778982cf8ef38babb244f607c2e2ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UROD2CYQ6LMPFVRJM6QHETUMKR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Editing to Eulerian Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Dani\\\"el Paulusma, Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof","submitted_at":"2014-10-25T01:07:18Z","abstract_excerpt":"We investigate the problem of modifying a graph into a connected graph in which the degree of each vertex satisfies a prescribed parity constraint. Let $ea$, $ed$ and $vd$ denote the operations edge addition, edge deletion and vertex deletion respectively. For any $S\\subseteq \\{ea,ed,vd\\}$, we define Connected Degree Parity Editing$(S)$ (CDPE($S$)) to be the problem that takes as input a graph $G$, an integer $k$ and a function $\\delta\\colon V(G)\\rightarrow\\{0,1\\}$, and asks whether $G$ can be modified into a connected graph $H$ with $d_{H}(v)\\equiv\\delta(v)~(\\bmod~2)$ for each $v\\in V(H)$, us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6863","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"},"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:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BQ3C+WRbEyncA+K/kVKYx5VsDk1qoFhPZL8cfkQbN9YDkFBTkGgxLAGkUC58bFIi8C6K6kqZuDICKf+MTJq9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:39:38.341001Z"},"content_sha256":"fd3b24b1861d48606305b8cc2d37686377afa591b77db6a022dcc37b87e38a80","schema_version":"1.0","event_id":"sha256:fd3b24b1861d48606305b8cc2d37686377afa591b77db6a022dcc37b87e38a80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UROD2CYQ6LMPFVRJM6QHETUMKR/bundle.json","state_url":"https://pith.science/pith/UROD2CYQ6LMPFVRJM6QHETUMKR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UROD2CYQ6LMPFVRJM6QHETUMKR/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-05-26T11:39:38Z","links":{"resolver":"https://pith.science/pith/UROD2CYQ6LMPFVRJM6QHETUMKR","bundle":"https://pith.science/pith/UROD2CYQ6LMPFVRJM6QHETUMKR/bundle.json","state":"https://pith.science/pith/UROD2CYQ6LMPFVRJM6QHETUMKR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UROD2CYQ6LMPFVRJM6QHETUMKR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UROD2CYQ6LMPFVRJM6QHETUMKR","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":"ec8c6cd681dc33c9157d2c5b7344258d6a477caf3449ddbbedeb6e53e3baa0b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-25T01:07:18Z","title_canon_sha256":"a009cb64998d7f1a63968e60398d57814ece08c867cd9b9407225e3fbb3e0934"},"schema_version":"1.0","source":{"id":"1410.6863","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6863","created_at":"2026-05-18T02:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6863v1","created_at":"2026-05-18T02:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6863","created_at":"2026-05-18T02:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"UROD2CYQ6LMP","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UROD2CYQ6LMPFVRJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UROD2CYQ","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:fd3b24b1861d48606305b8cc2d37686377afa591b77db6a022dcc37b87e38a80","target":"graph","created_at":"2026-05-18T02:39:18Z","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":"We investigate the problem of modifying a graph into a connected graph in which the degree of each vertex satisfies a prescribed parity constraint. Let $ea$, $ed$ and $vd$ denote the operations edge addition, edge deletion and vertex deletion respectively. For any $S\\subseteq \\{ea,ed,vd\\}$, we define Connected Degree Parity Editing$(S)$ (CDPE($S$)) to be the problem that takes as input a graph $G$, an integer $k$ and a function $\\delta\\colon V(G)\\rightarrow\\{0,1\\}$, and asks whether $G$ can be modified into a connected graph $H$ with $d_{H}(v)\\equiv\\delta(v)~(\\bmod~2)$ for each $v\\in V(H)$, us","authors_text":"Dani\\\"el Paulusma, Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-25T01:07:18Z","title":"Editing to Eulerian Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6863","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:f9fa5a6b77ffb680ae18dd72b8b8bf6e3f778982cf8ef38babb244f607c2e2ef","target":"record","created_at":"2026-05-18T02:39:18Z","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":"ec8c6cd681dc33c9157d2c5b7344258d6a477caf3449ddbbedeb6e53e3baa0b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-25T01:07:18Z","title_canon_sha256":"a009cb64998d7f1a63968e60398d57814ece08c867cd9b9407225e3fbb3e0934"},"schema_version":"1.0","source":{"id":"1410.6863","kind":"arxiv","version":1}},"canonical_sha256":"a45c3d0b10f2d8f2d62967a0724e8c545fa0066f6d631ab28f4cc6b2d53f347a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a45c3d0b10f2d8f2d62967a0724e8c545fa0066f6d631ab28f4cc6b2d53f347a","first_computed_at":"2026-05-18T02:39:18.456564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:18.456564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1QkUzg7CH+FiNsqAuEPlLOxozghSouSWVpHfhu84othzuQM8PrFAyHNWrnREBfC8jasPt4tF9QzGhVk6NpCkAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:18.457026Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.6863","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9fa5a6b77ffb680ae18dd72b8b8bf6e3f778982cf8ef38babb244f607c2e2ef","sha256:fd3b24b1861d48606305b8cc2d37686377afa591b77db6a022dcc37b87e38a80"],"state_sha256":"232ae68e35b8c03e4c05fe4b797c1f23ee23e35cbc8bd12b3bcc04761327e895"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MKzKg0BgjHDpNs+KqdFBrx0eDibNJaZO2aDKMyYoe/zJavRxfAXwfa6vF7EAggmfViG/wJjPXFm4IxCglPniBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:39:38.343802Z","bundle_sha256":"52970131cd5f42d6c4b0e2bf1f2e8224215a4e8a8eb48444f3f0a84015651200"}}