{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AVUPOBVEDYPBBNS7RVF6MWUS6V","short_pith_number":"pith:AVUPOBVE","canonical_record":{"source":{"id":"1511.01230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-04T07:47:21Z","cross_cats_sorted":[],"title_canon_sha256":"26f4df4fd04df8d6bc524e665ac9f5a24776d034e02a0620f88a8c9dbb508967","abstract_canon_sha256":"4e73748a2a6bd071801c0ab36099cc6c3cfe0bb922e2dbb2a6cc901d31fd80f7"},"schema_version":"1.0"},"canonical_sha256":"0568f706a41e1e10b65f8d4be65a92f540d81a23a04aefb116a93e0a091b1d30","source":{"kind":"arxiv","id":"1511.01230","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01230","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01230v1","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01230","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"pith_short_12","alias_value":"AVUPOBVEDYPB","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AVUPOBVEDYPBBNS7","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AVUPOBVE","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AVUPOBVEDYPBBNS7RVF6MWUS6V","target":"record","payload":{"canonical_record":{"source":{"id":"1511.01230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-04T07:47:21Z","cross_cats_sorted":[],"title_canon_sha256":"26f4df4fd04df8d6bc524e665ac9f5a24776d034e02a0620f88a8c9dbb508967","abstract_canon_sha256":"4e73748a2a6bd071801c0ab36099cc6c3cfe0bb922e2dbb2a6cc901d31fd80f7"},"schema_version":"1.0"},"canonical_sha256":"0568f706a41e1e10b65f8d4be65a92f540d81a23a04aefb116a93e0a091b1d30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:47.766634Z","signature_b64":"b9vIamXOkoug/AugtYUzso+DAOiLFdgj6W3ibQSQok2hyjEe3sBrl5NvDOYic4yYexbqWe6Czf7gXTY0IayKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0568f706a41e1e10b65f8d4be65a92f540d81a23a04aefb116a93e0a091b1d30","last_reissued_at":"2026-05-18T01:27:47.765951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:47.765951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.01230","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:27:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P8WMFbly7UB5zabympJ48zBee9CLzmE0rnPphCftdN2BDZcSCpzDEEgLV6vcj98OTjWOgPlVCuNHdHy1FINZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:22:55.193585Z"},"content_sha256":"0d1bea060342e7dc301717982b5225700694d028f8c7fc5f57ca7d5e3452e284","schema_version":"1.0","event_id":"sha256:0d1bea060342e7dc301717982b5225700694d028f8c7fc5f57ca7d5e3452e284"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AVUPOBVEDYPBBNS7RVF6MWUS6V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Base collapse of holographic algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Mingji Xia","submitted_at":"2015-11-04T07:47:21Z","abstract_excerpt":"A holographic algorithm solves a problem in domain of size $n$, by reducing it to counting perfect matchings in planar graphs. It may simulate a $n$-value variable by a bunch of $t$ matchgate bits, which has $2^t$ values. The transformation in the simulation can be expressed as a $n \\times 2^t$ matrix $M$, called the base of the holographic algorithm. We wonder whether more matchgate bits bring us more powerful holographic algorithms. In another word, whether we can solve the same original problem, with a collapsed base of size $n \\times 2^{r}$, where $r<t$.\n  Base collapse was discovered for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01230","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:27:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2UyugaJzOyVXVTpKBeOT9eXoZkM4UZF3WXEUOMhpYdsoAQVZsjD8KdGhFo1ET/UpP1GmVCbEIpi9inqljEeMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:22:55.193935Z"},"content_sha256":"73f26a7a83f0314d1ed4b5eb79c1b4a41f13b644abacdf73fbd4d09777aca93c","schema_version":"1.0","event_id":"sha256:73f26a7a83f0314d1ed4b5eb79c1b4a41f13b644abacdf73fbd4d09777aca93c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AVUPOBVEDYPBBNS7RVF6MWUS6V/bundle.json","state_url":"https://pith.science/pith/AVUPOBVEDYPBBNS7RVF6MWUS6V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AVUPOBVEDYPBBNS7RVF6MWUS6V/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-04T14:22:55Z","links":{"resolver":"https://pith.science/pith/AVUPOBVEDYPBBNS7RVF6MWUS6V","bundle":"https://pith.science/pith/AVUPOBVEDYPBBNS7RVF6MWUS6V/bundle.json","state":"https://pith.science/pith/AVUPOBVEDYPBBNS7RVF6MWUS6V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AVUPOBVEDYPBBNS7RVF6MWUS6V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AVUPOBVEDYPBBNS7RVF6MWUS6V","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":"4e73748a2a6bd071801c0ab36099cc6c3cfe0bb922e2dbb2a6cc901d31fd80f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-04T07:47:21Z","title_canon_sha256":"26f4df4fd04df8d6bc524e665ac9f5a24776d034e02a0620f88a8c9dbb508967"},"schema_version":"1.0","source":{"id":"1511.01230","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01230","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01230v1","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01230","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"pith_short_12","alias_value":"AVUPOBVEDYPB","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AVUPOBVEDYPBBNS7","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AVUPOBVE","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:73f26a7a83f0314d1ed4b5eb79c1b4a41f13b644abacdf73fbd4d09777aca93c","target":"graph","created_at":"2026-05-18T01:27:47Z","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":"A holographic algorithm solves a problem in domain of size $n$, by reducing it to counting perfect matchings in planar graphs. It may simulate a $n$-value variable by a bunch of $t$ matchgate bits, which has $2^t$ values. The transformation in the simulation can be expressed as a $n \\times 2^t$ matrix $M$, called the base of the holographic algorithm. We wonder whether more matchgate bits bring us more powerful holographic algorithms. In another word, whether we can solve the same original problem, with a collapsed base of size $n \\times 2^{r}$, where $r<t$.\n  Base collapse was discovered for ","authors_text":"Mingji Xia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-04T07:47:21Z","title":"Base collapse of holographic algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01230","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:0d1bea060342e7dc301717982b5225700694d028f8c7fc5f57ca7d5e3452e284","target":"record","created_at":"2026-05-18T01:27:47Z","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":"4e73748a2a6bd071801c0ab36099cc6c3cfe0bb922e2dbb2a6cc901d31fd80f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-04T07:47:21Z","title_canon_sha256":"26f4df4fd04df8d6bc524e665ac9f5a24776d034e02a0620f88a8c9dbb508967"},"schema_version":"1.0","source":{"id":"1511.01230","kind":"arxiv","version":1}},"canonical_sha256":"0568f706a41e1e10b65f8d4be65a92f540d81a23a04aefb116a93e0a091b1d30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0568f706a41e1e10b65f8d4be65a92f540d81a23a04aefb116a93e0a091b1d30","first_computed_at":"2026-05-18T01:27:47.765951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:47.765951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b9vIamXOkoug/AugtYUzso+DAOiLFdgj6W3ibQSQok2hyjEe3sBrl5NvDOYic4yYexbqWe6Czf7gXTY0IayKDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:47.766634Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01230","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d1bea060342e7dc301717982b5225700694d028f8c7fc5f57ca7d5e3452e284","sha256:73f26a7a83f0314d1ed4b5eb79c1b4a41f13b644abacdf73fbd4d09777aca93c"],"state_sha256":"a20a0315ab18c2d14f4b0d917b72784cfeec1b3e5a403f41eb5d49cbfdfe719e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fq0qhpvl6+I1jPdcjJhgyNlX4URmEjdJ/ppqnvsAFDYE31Bci3grJmse7yzrvaMbqPL0jn6aZSWXnoNQLPofCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T14:22:55.195909Z","bundle_sha256":"d37bc1daffff98c6559aad606de84dea2520c9e907a607c65b228d7f27e4b42d"}}