{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:5KX6STPY2K6BADCVOZHYQWJSRQ","short_pith_number":"pith:5KX6STPY","canonical_record":{"source":{"id":"1009.5019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-25T15:40:39Z","cross_cats_sorted":[],"title_canon_sha256":"6b6f1d31c26374cae939903d8b3055a550811684b08011025c606add513014cf","abstract_canon_sha256":"4093b5261cdd0cd01ea8bfcb032a57dc46b120ef2a8916c3ba8ad75ad6f25a67"},"schema_version":"1.0"},"canonical_sha256":"eaafe94df8d2bc100c55764f8859328c2be4784e02a6ecb98db59e9803f5094a","source":{"kind":"arxiv","id":"1009.5019","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5019","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5019v1","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5019","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"pith_short_12","alias_value":"5KX6STPY2K6B","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5KX6STPY2K6BADCV","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5KX6STPY","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:5KX6STPY2K6BADCVOZHYQWJSRQ","target":"record","payload":{"canonical_record":{"source":{"id":"1009.5019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-25T15:40:39Z","cross_cats_sorted":[],"title_canon_sha256":"6b6f1d31c26374cae939903d8b3055a550811684b08011025c606add513014cf","abstract_canon_sha256":"4093b5261cdd0cd01ea8bfcb032a57dc46b120ef2a8916c3ba8ad75ad6f25a67"},"schema_version":"1.0"},"canonical_sha256":"eaafe94df8d2bc100c55764f8859328c2be4784e02a6ecb98db59e9803f5094a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:19.377246Z","signature_b64":"jfGOHFIYWWn1U5faZaJ/hnRe/5lZEVQ/WfayfcUiB8w2oRw8sitW7Yrxtunhg7IIRPMM/rUqxfI/ApuO6WsaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eaafe94df8d2bc100c55764f8859328c2be4784e02a6ecb98db59e9803f5094a","last_reissued_at":"2026-05-18T04:40:19.376515Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:19.376515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.5019","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-18T04:40:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QSeuAc1Q/UVCf/w+vbyVhx+NpsH0npVR7qS13qkQKuWh4eE+7XxTpcOmLDy4aKn8rD1TmQGg7mv6ixser8CHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:25:46.607088Z"},"content_sha256":"731f7a21ede03475d0011c7d838a99f3c8762232a2896b68317ee590afb60fe6","schema_version":"1.0","event_id":"sha256:731f7a21ede03475d0011c7d838a99f3c8762232a2896b68317ee590afb60fe6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:5KX6STPY2K6BADCVOZHYQWJSRQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Counting Eulerian Tours in 4-Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Daniel Stefankovic, Qi Ge","submitted_at":"2010-09-25T15:40:39Z","abstract_excerpt":"We investigate the complexity of counting Eulerian tours ({\\sc #ET}) and its variations from two perspectives---the complexity of exact counting and the complexity w.r.t. approximation-preserving reductions (AP-reductions \\cite{MR2044886}). We prove that {\\sc #ET} is #P-complete even for planar 4-regular graphs.\n  A closely related problem is that of counting A-trails ({\\sc #A-trails}) in graphs with rotational embedding schemes (so called maps). Kotzig \\cite{MR0248043} showed that {\\sc #A-trails} can be computed in polynomial time for 4-regular plane graphs (embedding in the plane is equivale"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5019","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-18T04:40:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jLTvln/jW58AVbv1EnSvZx1mXFreNjBwZG7uokEs2vaLDVNlilQOuxFoVQ09YamXyMQIrfH6Q7XKw8DV3DJTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:25:46.607796Z"},"content_sha256":"a8740a595bf7402aa83e7d9ea5ebdcd8926358737d2027bdd67145f2d5c8e38c","schema_version":"1.0","event_id":"sha256:a8740a595bf7402aa83e7d9ea5ebdcd8926358737d2027bdd67145f2d5c8e38c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5KX6STPY2K6BADCVOZHYQWJSRQ/bundle.json","state_url":"https://pith.science/pith/5KX6STPY2K6BADCVOZHYQWJSRQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5KX6STPY2K6BADCVOZHYQWJSRQ/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-31T12:25:46Z","links":{"resolver":"https://pith.science/pith/5KX6STPY2K6BADCVOZHYQWJSRQ","bundle":"https://pith.science/pith/5KX6STPY2K6BADCVOZHYQWJSRQ/bundle.json","state":"https://pith.science/pith/5KX6STPY2K6BADCVOZHYQWJSRQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5KX6STPY2K6BADCVOZHYQWJSRQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:5KX6STPY2K6BADCVOZHYQWJSRQ","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":"4093b5261cdd0cd01ea8bfcb032a57dc46b120ef2a8916c3ba8ad75ad6f25a67","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-25T15:40:39Z","title_canon_sha256":"6b6f1d31c26374cae939903d8b3055a550811684b08011025c606add513014cf"},"schema_version":"1.0","source":{"id":"1009.5019","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5019","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5019v1","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5019","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"pith_short_12","alias_value":"5KX6STPY2K6B","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5KX6STPY2K6BADCV","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5KX6STPY","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:a8740a595bf7402aa83e7d9ea5ebdcd8926358737d2027bdd67145f2d5c8e38c","target":"graph","created_at":"2026-05-18T04:40:19Z","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 complexity of counting Eulerian tours ({\\sc #ET}) and its variations from two perspectives---the complexity of exact counting and the complexity w.r.t. approximation-preserving reductions (AP-reductions \\cite{MR2044886}). We prove that {\\sc #ET} is #P-complete even for planar 4-regular graphs.\n  A closely related problem is that of counting A-trails ({\\sc #A-trails}) in graphs with rotational embedding schemes (so called maps). Kotzig \\cite{MR0248043} showed that {\\sc #A-trails} can be computed in polynomial time for 4-regular plane graphs (embedding in the plane is equivale","authors_text":"Daniel Stefankovic, Qi Ge","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-25T15:40:39Z","title":"The Complexity of Counting Eulerian Tours in 4-Regular Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5019","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:731f7a21ede03475d0011c7d838a99f3c8762232a2896b68317ee590afb60fe6","target":"record","created_at":"2026-05-18T04:40:19Z","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":"4093b5261cdd0cd01ea8bfcb032a57dc46b120ef2a8916c3ba8ad75ad6f25a67","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-25T15:40:39Z","title_canon_sha256":"6b6f1d31c26374cae939903d8b3055a550811684b08011025c606add513014cf"},"schema_version":"1.0","source":{"id":"1009.5019","kind":"arxiv","version":1}},"canonical_sha256":"eaafe94df8d2bc100c55764f8859328c2be4784e02a6ecb98db59e9803f5094a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eaafe94df8d2bc100c55764f8859328c2be4784e02a6ecb98db59e9803f5094a","first_computed_at":"2026-05-18T04:40:19.376515Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:19.376515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jfGOHFIYWWn1U5faZaJ/hnRe/5lZEVQ/WfayfcUiB8w2oRw8sitW7Yrxtunhg7IIRPMM/rUqxfI/ApuO6WsaAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:19.377246Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.5019","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:731f7a21ede03475d0011c7d838a99f3c8762232a2896b68317ee590afb60fe6","sha256:a8740a595bf7402aa83e7d9ea5ebdcd8926358737d2027bdd67145f2d5c8e38c"],"state_sha256":"c8d68b258fdc75f2eb76107851419a11a6d6fecde01b508a4ee3d9690f6e998b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yKSTlfnlgY2FnKlrVvhFCmJM+wkugqLuu7DxMlOnGPBSMaMFMtFnqmeEdW+dvWk7GhYyjAbovQMiIKFh4UVkDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:25:46.611440Z","bundle_sha256":"a5051d1a953f31542c0accfa134065328f25469834193e70bd59e7e3bd31dbef"}}