{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2HBYP2TVLILGFJIK4Y5QFBATFF","short_pith_number":"pith:2HBYP2TV","canonical_record":{"source":{"id":"1703.04878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-03-15T01:48:37Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"81b188892b381753221923c1cf60d3b4646bfcb6ed2e641283edd20f58d086a6","abstract_canon_sha256":"dfe173a54739598e918c04eb2a044f04f7d96cd15c0ed090651791f753bc7bec"},"schema_version":"1.0"},"canonical_sha256":"d1c387ea755a1662a50ae63b0284132969c982b30541506fb541edcca21efa96","source":{"kind":"arxiv","id":"1703.04878","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04878","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04878v1","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04878","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"pith_short_12","alias_value":"2HBYP2TVLILG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2HBYP2TVLILGFJIK","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2HBYP2TV","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2HBYP2TVLILGFJIK4Y5QFBATFF","target":"record","payload":{"canonical_record":{"source":{"id":"1703.04878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-03-15T01:48:37Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"81b188892b381753221923c1cf60d3b4646bfcb6ed2e641283edd20f58d086a6","abstract_canon_sha256":"dfe173a54739598e918c04eb2a044f04f7d96cd15c0ed090651791f753bc7bec"},"schema_version":"1.0"},"canonical_sha256":"d1c387ea755a1662a50ae63b0284132969c982b30541506fb541edcca21efa96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:39.001386Z","signature_b64":"lErV/iB02DQM+etZZ9dhU0V8fsit6Lz6xqrMNUSZuoZHa8vQ+jPmNn0YrGLZZ+VuiTf5+fQlfZ5/SF9/1txXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1c387ea755a1662a50ae63b0284132969c982b30541506fb541edcca21efa96","last_reissued_at":"2026-05-18T00:48:39.000893Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:39.000893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.04878","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-18T00:48:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HptFDxd/cn51U6FvCl7+/mvwFQ1xC2TxWLcviAhmdLoo6xwIGFOA3Ddec1dmD6afUGq/9UmvOTHg6u0ms2CiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:47:58.705574Z"},"content_sha256":"ec3cc93258e4a54ebff5151d3e0fcbb3119fed6752e18a85593cb55144458e42","schema_version":"1.0","event_id":"sha256:ec3cc93258e4a54ebff5151d3e0fcbb3119fed6752e18a85593cb55144458e42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2HBYP2TVLILGFJIK4Y5QFBATFF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Superposition as memory: unlocking quantum automatic complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.CR","authors_text":"Bj{\\o}rn Kjos-Hanssen","submitted_at":"2017-03-15T01:48:37Z","abstract_excerpt":"Imagine a lock with two states, \"locked\" and \"unlocked\", which may be manipulated using two operations, called 0 and 1. Moreover, the only way to (with certainty) unlock using four operations is to do them in the sequence 0011, i.e., $0^n1^n$ where $n=2$. In this scenario one might think that the lock needs to be in certain further states after each operation, so that there is some memory of what has been done so far. Here we show that this memory can be entirely encoded in superpositions of the two basic states \"locked\" and \"unlocked\", where, as dictated by quantum mechanics, the operations a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04878","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-18T00:48:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EEGsqV63eejavKMj8zFje0U7AYqahz49+9lz2+AiyGehrk9doHypMN8HT5a0kYRwqiiIEYeq4SaRkFGqaeVLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:47:58.706354Z"},"content_sha256":"d6cbe749b74d43680c7103e6930b76e950a9913a4f09046ef4c217a04d565c87","schema_version":"1.0","event_id":"sha256:d6cbe749b74d43680c7103e6930b76e950a9913a4f09046ef4c217a04d565c87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2HBYP2TVLILGFJIK4Y5QFBATFF/bundle.json","state_url":"https://pith.science/pith/2HBYP2TVLILGFJIK4Y5QFBATFF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2HBYP2TVLILGFJIK4Y5QFBATFF/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-31T20:47:58Z","links":{"resolver":"https://pith.science/pith/2HBYP2TVLILGFJIK4Y5QFBATFF","bundle":"https://pith.science/pith/2HBYP2TVLILGFJIK4Y5QFBATFF/bundle.json","state":"https://pith.science/pith/2HBYP2TVLILGFJIK4Y5QFBATFF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2HBYP2TVLILGFJIK4Y5QFBATFF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2HBYP2TVLILGFJIK4Y5QFBATFF","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":"dfe173a54739598e918c04eb2a044f04f7d96cd15c0ed090651791f753bc7bec","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-03-15T01:48:37Z","title_canon_sha256":"81b188892b381753221923c1cf60d3b4646bfcb6ed2e641283edd20f58d086a6"},"schema_version":"1.0","source":{"id":"1703.04878","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04878","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04878v1","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04878","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"pith_short_12","alias_value":"2HBYP2TVLILG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2HBYP2TVLILGFJIK","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2HBYP2TV","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:d6cbe749b74d43680c7103e6930b76e950a9913a4f09046ef4c217a04d565c87","target":"graph","created_at":"2026-05-18T00:48:39Z","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":"Imagine a lock with two states, \"locked\" and \"unlocked\", which may be manipulated using two operations, called 0 and 1. Moreover, the only way to (with certainty) unlock using four operations is to do them in the sequence 0011, i.e., $0^n1^n$ where $n=2$. In this scenario one might think that the lock needs to be in certain further states after each operation, so that there is some memory of what has been done so far. Here we show that this memory can be entirely encoded in superpositions of the two basic states \"locked\" and \"unlocked\", where, as dictated by quantum mechanics, the operations a","authors_text":"Bj{\\o}rn Kjos-Hanssen","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-03-15T01:48:37Z","title":"Superposition as memory: unlocking quantum automatic complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04878","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:ec3cc93258e4a54ebff5151d3e0fcbb3119fed6752e18a85593cb55144458e42","target":"record","created_at":"2026-05-18T00:48:39Z","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":"dfe173a54739598e918c04eb2a044f04f7d96cd15c0ed090651791f753bc7bec","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-03-15T01:48:37Z","title_canon_sha256":"81b188892b381753221923c1cf60d3b4646bfcb6ed2e641283edd20f58d086a6"},"schema_version":"1.0","source":{"id":"1703.04878","kind":"arxiv","version":1}},"canonical_sha256":"d1c387ea755a1662a50ae63b0284132969c982b30541506fb541edcca21efa96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1c387ea755a1662a50ae63b0284132969c982b30541506fb541edcca21efa96","first_computed_at":"2026-05-18T00:48:39.000893Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:39.000893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lErV/iB02DQM+etZZ9dhU0V8fsit6Lz6xqrMNUSZuoZHa8vQ+jPmNn0YrGLZZ+VuiTf5+fQlfZ5/SF9/1txXCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:39.001386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.04878","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec3cc93258e4a54ebff5151d3e0fcbb3119fed6752e18a85593cb55144458e42","sha256:d6cbe749b74d43680c7103e6930b76e950a9913a4f09046ef4c217a04d565c87"],"state_sha256":"e1fb67813cbbd9aacaad849aabfd5fc8183e4c2a20a6bc1bdff6f55a00685c72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eb5KLYIVQj7sxdxe3y3cLRt1UhCNK8MWFFxAxsa16ULRR6zOHUZNouLkij7yPp5c2qloDGDq5XLNuVt+4kzWAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:47:58.711183Z","bundle_sha256":"a91b011d2ffdcc8683a527688732e2f7af9ee7e5b444d1d362ecafad3ad57091"}}