{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:WK3Q364JQWZS7LSOJHA5H3J5WD","short_pith_number":"pith:WK3Q364J","canonical_record":{"source":{"id":"quant-ph/0512064","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-12-08T14:04:44Z","cross_cats_sorted":[],"title_canon_sha256":"db4301a6724f774aca2296b4208fddd921142b44f00406bf6c6f01b6432fc58d","abstract_canon_sha256":"18c45e4563c10bdbe2ae3a2f3bdcf311e059f5d62aed0952b4dae3c04ca5f773"},"schema_version":"1.0"},"canonical_sha256":"b2b70dfb8985b32fae4e49c1d3ed3db0deb37cd629fe6b063241316e528f274c","source":{"kind":"arxiv","id":"quant-ph/0512064","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0512064","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0512064v1","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0512064","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"pith_short_12","alias_value":"WK3Q364JQWZS","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"WK3Q364JQWZS7LSO","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"WK3Q364J","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:WK3Q364JQWZS7LSOJHA5H3J5WD","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0512064","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-12-08T14:04:44Z","cross_cats_sorted":[],"title_canon_sha256":"db4301a6724f774aca2296b4208fddd921142b44f00406bf6c6f01b6432fc58d","abstract_canon_sha256":"18c45e4563c10bdbe2ae3a2f3bdcf311e059f5d62aed0952b4dae3c04ca5f773"},"schema_version":"1.0"},"canonical_sha256":"b2b70dfb8985b32fae4e49c1d3ed3db0deb37cd629fe6b063241316e528f274c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:57.293586Z","signature_b64":"1ynNC9ZFsRThtTgjS+IVf5OAqEMub+IDHct8KknkChb6UI+9kFTEjdVz/ocRwM8MmCfWh5LTIJ/AdDeP+sNBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2b70dfb8985b32fae4e49c1d3ed3db0deb37cd629fe6b063241316e528f274c","last_reissued_at":"2026-05-18T01:37:57.293070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:57.293070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0512064","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-18T01:37:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nmGFCg8u5lW01PLj3agwQQwGq5tZU5cHaDnEvMehOegnd6rfw09ceUOx3kRO+enVqVnF7A9y/m+pLT3U9F5NDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:55:27.455705Z"},"content_sha256":"644e275616a6056cb71751666a0e5af77ab67ad851baf3e565b2ea13bafc7e4d","schema_version":"1.0","event_id":"sha256:644e275616a6056cb71751666a0e5af77ab67ad851baf3e565b2ea13bafc7e4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:WK3Q364JQWZS7LSOJHA5H3J5WD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithm for Constructing Polynomial Systems Whose Solution Space Characterizes Quantum Circuits","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Vasily M. Severyanov, Vladimir P.Gerdt","submitted_at":"2005-12-08T14:04:44Z","abstract_excerpt":"An algorithm and its first implementation in C# are presented for assembling arbitrary quantum circuits on the base of Hadamard and Toffoli gates and for constructing multivariate polynomial systems over the finite field Z_2 arising when applying the Feynman's sum-over-paths approach to quantum circuits. The matrix elements determined by a circuit can be computed by counting the number of common roots in Z_2 for the polynomial system associated with the circuit. To determine the number of solutions in Z_2 for the output polynomial system, one can use the Groebner bases method and the relevant "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0512064","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-18T01:37:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmlRDKMjAM/cj6QCxVj0IuzKoBqdNb+73qY1sXAoWjV/Q6XGUmskIxoK8WYCXGx7vgApbgQ3PCQDxyukYzbbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:55:27.456176Z"},"content_sha256":"a3e3fd9bc11423abbc9172e47b8a1c5fa2445fe025cbf59bec3ef543bda41b5f","schema_version":"1.0","event_id":"sha256:a3e3fd9bc11423abbc9172e47b8a1c5fa2445fe025cbf59bec3ef543bda41b5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WK3Q364JQWZS7LSOJHA5H3J5WD/bundle.json","state_url":"https://pith.science/pith/WK3Q364JQWZS7LSOJHA5H3J5WD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WK3Q364JQWZS7LSOJHA5H3J5WD/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-09T13:55:27Z","links":{"resolver":"https://pith.science/pith/WK3Q364JQWZS7LSOJHA5H3J5WD","bundle":"https://pith.science/pith/WK3Q364JQWZS7LSOJHA5H3J5WD/bundle.json","state":"https://pith.science/pith/WK3Q364JQWZS7LSOJHA5H3J5WD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WK3Q364JQWZS7LSOJHA5H3J5WD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:WK3Q364JQWZS7LSOJHA5H3J5WD","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":"18c45e4563c10bdbe2ae3a2f3bdcf311e059f5d62aed0952b4dae3c04ca5f773","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-12-08T14:04:44Z","title_canon_sha256":"db4301a6724f774aca2296b4208fddd921142b44f00406bf6c6f01b6432fc58d"},"schema_version":"1.0","source":{"id":"quant-ph/0512064","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0512064","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0512064v1","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0512064","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"pith_short_12","alias_value":"WK3Q364JQWZS","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"WK3Q364JQWZS7LSO","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"WK3Q364J","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:a3e3fd9bc11423abbc9172e47b8a1c5fa2445fe025cbf59bec3ef543bda41b5f","target":"graph","created_at":"2026-05-18T01:37:57Z","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":"An algorithm and its first implementation in C# are presented for assembling arbitrary quantum circuits on the base of Hadamard and Toffoli gates and for constructing multivariate polynomial systems over the finite field Z_2 arising when applying the Feynman's sum-over-paths approach to quantum circuits. The matrix elements determined by a circuit can be computed by counting the number of common roots in Z_2 for the polynomial system associated with the circuit. To determine the number of solutions in Z_2 for the output polynomial system, one can use the Groebner bases method and the relevant ","authors_text":"Vasily M. Severyanov, Vladimir P.Gerdt","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2005-12-08T14:04:44Z","title":"An Algorithm for Constructing Polynomial Systems Whose Solution Space Characterizes Quantum Circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0512064","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:644e275616a6056cb71751666a0e5af77ab67ad851baf3e565b2ea13bafc7e4d","target":"record","created_at":"2026-05-18T01:37:57Z","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":"18c45e4563c10bdbe2ae3a2f3bdcf311e059f5d62aed0952b4dae3c04ca5f773","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-12-08T14:04:44Z","title_canon_sha256":"db4301a6724f774aca2296b4208fddd921142b44f00406bf6c6f01b6432fc58d"},"schema_version":"1.0","source":{"id":"quant-ph/0512064","kind":"arxiv","version":1}},"canonical_sha256":"b2b70dfb8985b32fae4e49c1d3ed3db0deb37cd629fe6b063241316e528f274c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2b70dfb8985b32fae4e49c1d3ed3db0deb37cd629fe6b063241316e528f274c","first_computed_at":"2026-05-18T01:37:57.293070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:57.293070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1ynNC9ZFsRThtTgjS+IVf5OAqEMub+IDHct8KknkChb6UI+9kFTEjdVz/ocRwM8MmCfWh5LTIJ/AdDeP+sNBBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:57.293586Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0512064","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:644e275616a6056cb71751666a0e5af77ab67ad851baf3e565b2ea13bafc7e4d","sha256:a3e3fd9bc11423abbc9172e47b8a1c5fa2445fe025cbf59bec3ef543bda41b5f"],"state_sha256":"e1f56ece1ceaf8b526ecd1b884dcc721a7d68c0f2129eb3467bf1611bb93b843"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kMz2DwsPjsMuYfa/SMkZ6sD/J6YyUP5aq02SWqhsjWViQRkJ4+C0BsoWDd5L/SgadSxTgiq0ID6cFWQGvvtmBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:55:27.459125Z","bundle_sha256":"290f76601bfd195c5ca0dd1298936bbacbba7ee006536351b4dd32930a47d577"}}