{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UVPRBLWGJJXRTS2ZPBASJXFLFE","short_pith_number":"pith:UVPRBLWG","canonical_record":{"source":{"id":"1501.06323","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-26T10:49:26Z","cross_cats_sorted":[],"title_canon_sha256":"4aa0f20b04d94a41784aa244e3a180367ed37b0808a4d100d49e7dc733cfde4c","abstract_canon_sha256":"e2bd446a7fe5318e42e2f5c5b8f61d4f291fed6fed7ce39c8bd506731623814c"},"schema_version":"1.0"},"canonical_sha256":"a55f10aec64a6f19cb59784124dcab292d96cf1a20b36b6c92be0bd0ceee68cb","source":{"kind":"arxiv","id":"1501.06323","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06323","created_at":"2026-05-18T01:11:21Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06323v2","created_at":"2026-05-18T01:11:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06323","created_at":"2026-05-18T01:11:21Z"},{"alias_kind":"pith_short_12","alias_value":"UVPRBLWGJJXR","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UVPRBLWGJJXRTS2Z","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UVPRBLWG","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UVPRBLWGJJXRTS2ZPBASJXFLFE","target":"record","payload":{"canonical_record":{"source":{"id":"1501.06323","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-26T10:49:26Z","cross_cats_sorted":[],"title_canon_sha256":"4aa0f20b04d94a41784aa244e3a180367ed37b0808a4d100d49e7dc733cfde4c","abstract_canon_sha256":"e2bd446a7fe5318e42e2f5c5b8f61d4f291fed6fed7ce39c8bd506731623814c"},"schema_version":"1.0"},"canonical_sha256":"a55f10aec64a6f19cb59784124dcab292d96cf1a20b36b6c92be0bd0ceee68cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:21.848041Z","signature_b64":"PaxIY76US7Lzqmf0BiAUAXZP/h/lqIafSWGURiMYVj2pIPJtD9OeNrRG7DsBIT7ZSVAEvpCtjCOGVIZZ45DpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a55f10aec64a6f19cb59784124dcab292d96cf1a20b36b6c92be0bd0ceee68cb","last_reissued_at":"2026-05-18T01:11:21.847469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:21.847469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.06323","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-18T01:11:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vUUcyHB8PfAjohm0Pg73aDGGFeMJo9aB95QW9vSxnjqPHBE5S99WYr9BbZiV66VQeIuAqjDZ17Sx2fHyWezqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:10:41.901221Z"},"content_sha256":"f032482abac7528b6118d8b83d313edcd2327c3f19f09e93cc9091dbfb654050","schema_version":"1.0","event_id":"sha256:f032482abac7528b6118d8b83d313edcd2327c3f19f09e93cc9091dbfb654050"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UVPRBLWGJJXRTS2ZPBASJXFLFE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Parity Hamiltonian Cycle Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hiroshi Nishiyama, Masafumi Yamashita, Shuji Kijima, Yukiko Yamauchi, Yusuke Kobayashi","submitted_at":"2015-01-26T10:49:26Z","abstract_excerpt":"Motivated by a relaxed notion of the celebrated Hamiltonian cycle, this paper investigates its variant, parity Hamiltonian cycle (PHC): A PHC of a graph is a closed walk which visits every vertex an odd number of times, where we remark that the walk may use an edge more than once. First, we give a complete characterization of the graphs which have PHCs, and give a linear time algorithm to find a PHC, in which every edge appears at most four times, in fact. In contrast, we show that finding a PHC is NP-hard if a closed walk is allowed to use each edge at most z times for each z=1,2,3 (PHCz for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06323","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-18T01:11:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x0N9yiJT4hS7ba91MZYaah4CqGZpnVXvIYi4cl6mUB9wQmisTpnC5pYmUxNvxuzGw7srQV1SX4svHT4Yf6mOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:10:41.901874Z"},"content_sha256":"f4a50d9a55eaa501c736a303e93bd04e0b347e97ab4c952a16bc241aedc3a57a","schema_version":"1.0","event_id":"sha256:f4a50d9a55eaa501c736a303e93bd04e0b347e97ab4c952a16bc241aedc3a57a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVPRBLWGJJXRTS2ZPBASJXFLFE/bundle.json","state_url":"https://pith.science/pith/UVPRBLWGJJXRTS2ZPBASJXFLFE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVPRBLWGJJXRTS2ZPBASJXFLFE/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-26T14:10:41Z","links":{"resolver":"https://pith.science/pith/UVPRBLWGJJXRTS2ZPBASJXFLFE","bundle":"https://pith.science/pith/UVPRBLWGJJXRTS2ZPBASJXFLFE/bundle.json","state":"https://pith.science/pith/UVPRBLWGJJXRTS2ZPBASJXFLFE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVPRBLWGJJXRTS2ZPBASJXFLFE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UVPRBLWGJJXRTS2ZPBASJXFLFE","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":"e2bd446a7fe5318e42e2f5c5b8f61d4f291fed6fed7ce39c8bd506731623814c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-26T10:49:26Z","title_canon_sha256":"4aa0f20b04d94a41784aa244e3a180367ed37b0808a4d100d49e7dc733cfde4c"},"schema_version":"1.0","source":{"id":"1501.06323","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06323","created_at":"2026-05-18T01:11:21Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06323v2","created_at":"2026-05-18T01:11:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06323","created_at":"2026-05-18T01:11:21Z"},{"alias_kind":"pith_short_12","alias_value":"UVPRBLWGJJXR","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UVPRBLWGJJXRTS2Z","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UVPRBLWG","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:f4a50d9a55eaa501c736a303e93bd04e0b347e97ab4c952a16bc241aedc3a57a","target":"graph","created_at":"2026-05-18T01:11:21Z","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":"Motivated by a relaxed notion of the celebrated Hamiltonian cycle, this paper investigates its variant, parity Hamiltonian cycle (PHC): A PHC of a graph is a closed walk which visits every vertex an odd number of times, where we remark that the walk may use an edge more than once. First, we give a complete characterization of the graphs which have PHCs, and give a linear time algorithm to find a PHC, in which every edge appears at most four times, in fact. In contrast, we show that finding a PHC is NP-hard if a closed walk is allowed to use each edge at most z times for each z=1,2,3 (PHCz for ","authors_text":"Hiroshi Nishiyama, Masafumi Yamashita, Shuji Kijima, Yukiko Yamauchi, Yusuke Kobayashi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-26T10:49:26Z","title":"The Parity Hamiltonian Cycle Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06323","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:f032482abac7528b6118d8b83d313edcd2327c3f19f09e93cc9091dbfb654050","target":"record","created_at":"2026-05-18T01:11:21Z","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":"e2bd446a7fe5318e42e2f5c5b8f61d4f291fed6fed7ce39c8bd506731623814c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-26T10:49:26Z","title_canon_sha256":"4aa0f20b04d94a41784aa244e3a180367ed37b0808a4d100d49e7dc733cfde4c"},"schema_version":"1.0","source":{"id":"1501.06323","kind":"arxiv","version":2}},"canonical_sha256":"a55f10aec64a6f19cb59784124dcab292d96cf1a20b36b6c92be0bd0ceee68cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a55f10aec64a6f19cb59784124dcab292d96cf1a20b36b6c92be0bd0ceee68cb","first_computed_at":"2026-05-18T01:11:21.847469Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:21.847469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PaxIY76US7Lzqmf0BiAUAXZP/h/lqIafSWGURiMYVj2pIPJtD9OeNrRG7DsBIT7ZSVAEvpCtjCOGVIZZ45DpAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:21.848041Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.06323","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f032482abac7528b6118d8b83d313edcd2327c3f19f09e93cc9091dbfb654050","sha256:f4a50d9a55eaa501c736a303e93bd04e0b347e97ab4c952a16bc241aedc3a57a"],"state_sha256":"68300af35fdec03bcfb81e600ed80bee2903230b44f7ffa0c91db1aed3e86d3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iYidUcORX8WtGP/PU0zwaTMic1z6F5cUS8O5+jROgZmSDeJjlGXZ76mSU4eEjJqIh8377GJU+cjoBpoLT9tODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:10:41.904845Z","bundle_sha256":"530eb43ae602e35b5e289810beedf7f35beefd3708d9aed72e233ed280b40aab"}}