{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4N4XU2KHCZMG5XBITKY4KPTPKS","short_pith_number":"pith:4N4XU2KH","canonical_record":{"source":{"id":"1302.1932","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CT","submitted_at":"2013-02-08T02:57:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"cf61e29fdb63cf1b104074c80c0060eabbd4c50dd5be99dd6cb90efdf3ef562a","abstract_canon_sha256":"f985d50599a9a51f30d15e80bf78e8fb632ea001dee5031370a3620ffb0eb360"},"schema_version":"1.0"},"canonical_sha256":"e3797a694716586edc289ab1c53e6f5487477379e3764e5892d42e1dc305fa28","source":{"kind":"arxiv","id":"1302.1932","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1932","created_at":"2026-05-18T01:30:55Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1932v3","created_at":"2026-05-18T01:30:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1932","created_at":"2026-05-18T01:30:55Z"},{"alias_kind":"pith_short_12","alias_value":"4N4XU2KHCZMG","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4N4XU2KHCZMG5XBI","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4N4XU2KH","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4N4XU2KHCZMG5XBITKY4KPTPKS","target":"record","payload":{"canonical_record":{"source":{"id":"1302.1932","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CT","submitted_at":"2013-02-08T02:57:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"cf61e29fdb63cf1b104074c80c0060eabbd4c50dd5be99dd6cb90efdf3ef562a","abstract_canon_sha256":"f985d50599a9a51f30d15e80bf78e8fb632ea001dee5031370a3620ffb0eb360"},"schema_version":"1.0"},"canonical_sha256":"e3797a694716586edc289ab1c53e6f5487477379e3764e5892d42e1dc305fa28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:55.703751Z","signature_b64":"eVdKEVMElpSu13EnFqkkXmUO3yAriSr6g/CiPRLfwgrOSNZZ90uXd1Mz04ChQ+1z88J3uR06FJ1y1YnU9SlkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3797a694716586edc289ab1c53e6f5487477379e3764e5892d42e1dc305fa28","last_reissued_at":"2026-05-18T01:30:55.703198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:55.703198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.1932","source_version":3,"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:30:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"20jSU5UhGzGBWC/6IemP8JgudPuuQ3/l2lN9mGs4qw4PLkUdBLEtyv+Op2sA1QLwVUrzg4i6LLEVu7bZgOI7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:14:48.255527Z"},"content_sha256":"025b3e3cacb15765b18ffdc550cf28a2ab1c427fa41d71f36ea1fcf317de6c5d","schema_version":"1.0","event_id":"sha256:025b3e3cacb15765b18ffdc550cf28a2ab1c427fa41d71f36ea1fcf317de6c5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4N4XU2KHCZMG5XBITKY4KPTPKS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Counting Constraint Satisfaction Problems With Determinantal Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.CT","authors_text":"Jacob Turner, Jason Morton","submitted_at":"2013-02-08T02:57:46Z","abstract_excerpt":"Generalized counting constraint satisfaction problems include Holant problems with planarity restrictions; polynomial-time algorithms for such problems include matchgates and matchcircuits, which are based on Pfaffians. In particular, they use gates which are expressible in terms of a vector of sub-Pfaffians of a skew-symmetric matrix. We introduce a new type of circuit based instead on determinants, with seemingly different expressive power. In these determinantal circuits, a gate is represented by the vector of all minors of an arbitrary matrix. Determinantal circuits permit a different clas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1932","kind":"arxiv","version":3},"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:30:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kO0mb1pqkUf3hq/DWLpdDmC5IBmuEEgS7lMx57KSiUZ+6KGhrh2RKqjZt2OJCLRcht0fFtNQaRFOr3ijqM0vBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:14:48.255884Z"},"content_sha256":"eb4d5330406700e7226d6791283d523b928ea18d0e631485a207111dad19f1a8","schema_version":"1.0","event_id":"sha256:eb4d5330406700e7226d6791283d523b928ea18d0e631485a207111dad19f1a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4N4XU2KHCZMG5XBITKY4KPTPKS/bundle.json","state_url":"https://pith.science/pith/4N4XU2KHCZMG5XBITKY4KPTPKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4N4XU2KHCZMG5XBITKY4KPTPKS/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-06-04T01:14:48Z","links":{"resolver":"https://pith.science/pith/4N4XU2KHCZMG5XBITKY4KPTPKS","bundle":"https://pith.science/pith/4N4XU2KHCZMG5XBITKY4KPTPKS/bundle.json","state":"https://pith.science/pith/4N4XU2KHCZMG5XBITKY4KPTPKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4N4XU2KHCZMG5XBITKY4KPTPKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4N4XU2KHCZMG5XBITKY4KPTPKS","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":"f985d50599a9a51f30d15e80bf78e8fb632ea001dee5031370a3620ffb0eb360","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CT","submitted_at":"2013-02-08T02:57:46Z","title_canon_sha256":"cf61e29fdb63cf1b104074c80c0060eabbd4c50dd5be99dd6cb90efdf3ef562a"},"schema_version":"1.0","source":{"id":"1302.1932","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1932","created_at":"2026-05-18T01:30:55Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1932v3","created_at":"2026-05-18T01:30:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1932","created_at":"2026-05-18T01:30:55Z"},{"alias_kind":"pith_short_12","alias_value":"4N4XU2KHCZMG","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4N4XU2KHCZMG5XBI","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4N4XU2KH","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:eb4d5330406700e7226d6791283d523b928ea18d0e631485a207111dad19f1a8","target":"graph","created_at":"2026-05-18T01:30:55Z","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":"Generalized counting constraint satisfaction problems include Holant problems with planarity restrictions; polynomial-time algorithms for such problems include matchgates and matchcircuits, which are based on Pfaffians. In particular, they use gates which are expressible in terms of a vector of sub-Pfaffians of a skew-symmetric matrix. We introduce a new type of circuit based instead on determinants, with seemingly different expressive power. In these determinantal circuits, a gate is represented by the vector of all minors of an arbitrary matrix. Determinantal circuits permit a different clas","authors_text":"Jacob Turner, Jason Morton","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CT","submitted_at":"2013-02-08T02:57:46Z","title":"Generalized Counting Constraint Satisfaction Problems With Determinantal Circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1932","kind":"arxiv","version":3},"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:025b3e3cacb15765b18ffdc550cf28a2ab1c427fa41d71f36ea1fcf317de6c5d","target":"record","created_at":"2026-05-18T01:30:55Z","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":"f985d50599a9a51f30d15e80bf78e8fb632ea001dee5031370a3620ffb0eb360","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CT","submitted_at":"2013-02-08T02:57:46Z","title_canon_sha256":"cf61e29fdb63cf1b104074c80c0060eabbd4c50dd5be99dd6cb90efdf3ef562a"},"schema_version":"1.0","source":{"id":"1302.1932","kind":"arxiv","version":3}},"canonical_sha256":"e3797a694716586edc289ab1c53e6f5487477379e3764e5892d42e1dc305fa28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3797a694716586edc289ab1c53e6f5487477379e3764e5892d42e1dc305fa28","first_computed_at":"2026-05-18T01:30:55.703198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:55.703198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eVdKEVMElpSu13EnFqkkXmUO3yAriSr6g/CiPRLfwgrOSNZZ90uXd1Mz04ChQ+1z88J3uR06FJ1y1YnU9SlkCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:55.703751Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1932","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:025b3e3cacb15765b18ffdc550cf28a2ab1c427fa41d71f36ea1fcf317de6c5d","sha256:eb4d5330406700e7226d6791283d523b928ea18d0e631485a207111dad19f1a8"],"state_sha256":"5b0a4ec2c5cb8c493c8d659bcbc1dbd6c1704752b705159cc2a226713c382e4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v6aFUB+jGqEn+XMqfz5EtNUM5ND8NDDK9K1I1acvxnm+DTF9q1yGoL8z74A3A67Qb118FrrWYI0bXmzk3EmsBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:14:48.257801Z","bundle_sha256":"c82c4ffe70da56f8ff3b5c4f4d3726b1d9c8a2df6699d733309cef3ce0cf657f"}}