{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4TSCSUYKXLIHPKLLEPGPEZD6OT","short_pith_number":"pith:4TSCSUYK","canonical_record":{"source":{"id":"1710.08602","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-24T05:08:44Z","cross_cats_sorted":[],"title_canon_sha256":"e2009bc415910c85c8c914ee90ada7cd8c3287bda3ead00556a7537ebcb8b677","abstract_canon_sha256":"2fdcd9e011bae96dfa0a3a14c583658e35c28212315f4fff77d77b01231c28a4"},"schema_version":"1.0"},"canonical_sha256":"e4e429530abad077a96b23ccf2647e74fb019fde20452fa684d3c93f64c1933c","source":{"kind":"arxiv","id":"1710.08602","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08602","created_at":"2026-05-18T00:30:40Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08602v2","created_at":"2026-05-18T00:30:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08602","created_at":"2026-05-18T00:30:40Z"},{"alias_kind":"pith_short_12","alias_value":"4TSCSUYKXLIH","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4TSCSUYKXLIHPKLL","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4TSCSUYK","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4TSCSUYKXLIHPKLLEPGPEZD6OT","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08602","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-24T05:08:44Z","cross_cats_sorted":[],"title_canon_sha256":"e2009bc415910c85c8c914ee90ada7cd8c3287bda3ead00556a7537ebcb8b677","abstract_canon_sha256":"2fdcd9e011bae96dfa0a3a14c583658e35c28212315f4fff77d77b01231c28a4"},"schema_version":"1.0"},"canonical_sha256":"e4e429530abad077a96b23ccf2647e74fb019fde20452fa684d3c93f64c1933c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:40.466979Z","signature_b64":"aOodIZahJ6j8bOOMAKtaQHk9y2QVl/3eOxz8sJ2dV3SlNUAqFApKYhE2w9L+HebQ+vDZwRhXmbBXdYEk3WetAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4e429530abad077a96b23ccf2647e74fb019fde20452fa684d3c93f64c1933c","last_reissued_at":"2026-05-18T00:30:40.466484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:40.466484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08602","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-18T00:30:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gi2gblqDUM6QzztbADhhgrHquszXTGnFOUToE4CcR/z9qgREIAdminOnD0esyYte/lfIrDa7jP98YYJQVutrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:18:10.238548Z"},"content_sha256":"e7d72bcc5ceeb364076225c6b68134b08622e6974f7fce916a5150e108abb200","schema_version":"1.0","event_id":"sha256:e7d72bcc5ceeb364076225c6b68134b08622e6974f7fce916a5150e108abb200"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4TSCSUYKXLIHPKLLEPGPEZD6OT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Aleksandrs Belovs, G\\'abor Ivanyos, Miklos Santha, Siyi Yang, Youming Qiao","submitted_at":"2017-10-24T05:08:44Z","abstract_excerpt":"The complexity class PPA consists of NP-search problems which are reducible to the parity principle in undirected graphs. It contains a wide variety of interesting problems from graph theory, combinatorics, algebra and number theory, but only a few of these are known to be complete in the class. Before this work, the known complete problems were all discretizations or combinatorial analogues of topological fixed point theorems. Here we prove the PPA-completeness of two problems of radically different style. They are PPA-Circuit CNSS and PPA-Circuit Chevalley, related respectively to the Combin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08602","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-18T00:30:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wn8ya5TgvrkmwexY5qvpqgdWN3JQkfOl/jAkIfB7jTsCk7KU+fi6jgw20+szO4FhRkR3fP1qL3NQVJcN2+16Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:18:10.238899Z"},"content_sha256":"e381d9a0fd1c96064ad80e9a3c7a217445bb2cbfa6925f1e9cffe26b347d82cf","schema_version":"1.0","event_id":"sha256:e381d9a0fd1c96064ad80e9a3c7a217445bb2cbfa6925f1e9cffe26b347d82cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TSCSUYKXLIHPKLLEPGPEZD6OT/bundle.json","state_url":"https://pith.science/pith/4TSCSUYKXLIHPKLLEPGPEZD6OT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TSCSUYKXLIHPKLLEPGPEZD6OT/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-27T23:18:10Z","links":{"resolver":"https://pith.science/pith/4TSCSUYKXLIHPKLLEPGPEZD6OT","bundle":"https://pith.science/pith/4TSCSUYKXLIHPKLLEPGPEZD6OT/bundle.json","state":"https://pith.science/pith/4TSCSUYKXLIHPKLLEPGPEZD6OT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TSCSUYKXLIHPKLLEPGPEZD6OT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4TSCSUYKXLIHPKLLEPGPEZD6OT","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":"2fdcd9e011bae96dfa0a3a14c583658e35c28212315f4fff77d77b01231c28a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-24T05:08:44Z","title_canon_sha256":"e2009bc415910c85c8c914ee90ada7cd8c3287bda3ead00556a7537ebcb8b677"},"schema_version":"1.0","source":{"id":"1710.08602","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08602","created_at":"2026-05-18T00:30:40Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08602v2","created_at":"2026-05-18T00:30:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08602","created_at":"2026-05-18T00:30:40Z"},{"alias_kind":"pith_short_12","alias_value":"4TSCSUYKXLIH","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4TSCSUYKXLIHPKLL","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4TSCSUYK","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:e381d9a0fd1c96064ad80e9a3c7a217445bb2cbfa6925f1e9cffe26b347d82cf","target":"graph","created_at":"2026-05-18T00:30:40Z","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":"The complexity class PPA consists of NP-search problems which are reducible to the parity principle in undirected graphs. It contains a wide variety of interesting problems from graph theory, combinatorics, algebra and number theory, but only a few of these are known to be complete in the class. Before this work, the known complete problems were all discretizations or combinatorial analogues of topological fixed point theorems. Here we prove the PPA-completeness of two problems of radically different style. They are PPA-Circuit CNSS and PPA-Circuit Chevalley, related respectively to the Combin","authors_text":"Aleksandrs Belovs, G\\'abor Ivanyos, Miklos Santha, Siyi Yang, Youming Qiao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-24T05:08:44Z","title":"On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08602","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:e7d72bcc5ceeb364076225c6b68134b08622e6974f7fce916a5150e108abb200","target":"record","created_at":"2026-05-18T00:30:40Z","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":"2fdcd9e011bae96dfa0a3a14c583658e35c28212315f4fff77d77b01231c28a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-24T05:08:44Z","title_canon_sha256":"e2009bc415910c85c8c914ee90ada7cd8c3287bda3ead00556a7537ebcb8b677"},"schema_version":"1.0","source":{"id":"1710.08602","kind":"arxiv","version":2}},"canonical_sha256":"e4e429530abad077a96b23ccf2647e74fb019fde20452fa684d3c93f64c1933c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4e429530abad077a96b23ccf2647e74fb019fde20452fa684d3c93f64c1933c","first_computed_at":"2026-05-18T00:30:40.466484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:40.466484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aOodIZahJ6j8bOOMAKtaQHk9y2QVl/3eOxz8sJ2dV3SlNUAqFApKYhE2w9L+HebQ+vDZwRhXmbBXdYEk3WetAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:40.466979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08602","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7d72bcc5ceeb364076225c6b68134b08622e6974f7fce916a5150e108abb200","sha256:e381d9a0fd1c96064ad80e9a3c7a217445bb2cbfa6925f1e9cffe26b347d82cf"],"state_sha256":"a71b02671338777a0087ea4ec2931b9a30d895b03061d1da4a622932c46cb261"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AX2INITXJFsxXrXy5U3kmHhxDC57aKTQ2uUkzkFvCYZY5KlcCOKSlsYF0SIiaYSSCq99iJAgfCRr1G4IgeXXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:18:10.241347Z","bundle_sha256":"a2bf422e6c3cc3277bc5488a44ae6680b09c37caff16a04f2afaf8a456187d56"}}