{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DBTGBBIE7NPQVLNIFRFA7M45HK","short_pith_number":"pith:DBTGBBIE","canonical_record":{"source":{"id":"1703.05332","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-03-15T18:00:05Z","cross_cats_sorted":["cond-mat.quant-gas","cs.CC"],"title_canon_sha256":"704514e302ce8e4a005435c489c4f7335a1bd88f599a08700374b1f85caaff73","abstract_canon_sha256":"4a084d198ec4db5ed6889fd729501e5abb44e29f25bd666493a6f27b14a72b8f"},"schema_version":"1.0"},"canonical_sha256":"1866608504fb5f0aada82c4a0fb39d3ab0d8afccd663c1e6debd7e688b802a6d","source":{"kind":"arxiv","id":"1703.05332","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05332","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05332v3","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05332","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"pith_short_12","alias_value":"DBTGBBIE7NPQ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DBTGBBIE7NPQVLNI","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DBTGBBIE","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DBTGBBIE7NPQVLNIFRFA7M45HK","target":"record","payload":{"canonical_record":{"source":{"id":"1703.05332","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-03-15T18:00:05Z","cross_cats_sorted":["cond-mat.quant-gas","cs.CC"],"title_canon_sha256":"704514e302ce8e4a005435c489c4f7335a1bd88f599a08700374b1f85caaff73","abstract_canon_sha256":"4a084d198ec4db5ed6889fd729501e5abb44e29f25bd666493a6f27b14a72b8f"},"schema_version":"1.0"},"canonical_sha256":"1866608504fb5f0aada82c4a0fb39d3ab0d8afccd663c1e6debd7e688b802a6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:55.456714Z","signature_b64":"wVIIAbDmJBS2p61E52dVxtTsxOpd+7oYtu82/bfM6LDD/+tlXbhpLodNNCzBsfT31oMxbRqOjarxInnwDGQrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1866608504fb5f0aada82c4a0fb39d3ab0d8afccd663c1e6debd7e688b802a6d","last_reissued_at":"2026-05-18T00:08:55.456058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:55.456058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.05332","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-18T00:08:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sS33Cwyu/rZKnoydUHL0rQuSaXlyLLdtcp/tr/yIWXqfmTNbj4BX6T5xDeG65WraR0cRGf2FApxvTYAatVxOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:21:59.834759Z"},"content_sha256":"fcdccf557e295a7c49610049ee38c95b137d94660c7a9f8fc392610c143e6b71","schema_version":"1.0","event_id":"sha256:fcdccf557e295a7c49610049ee38c95b137d94660c7a9f8fc392610c143e6b71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DBTGBBIE7NPQVLNIFRFA7M45HK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamical phase transitions in sampling complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.quant-gas","cs.CC"],"primary_cat":"quant-ph","authors_text":"Abhinav Deshpande, Alexey V. Gorshkov, Bill Fefferman, Michael Foss-Feig, Minh C. Tran","submitted_at":"2017-03-15T18:00:05Z","abstract_excerpt":"We make the case for studying the complexity of approximately simulating (sampling) quantum systems for reasons beyond that of quantum computational supremacy, such as diagnosing phase transitions. We consider the sampling complexity as a function of time $t$ due to evolution generated by spatially local quadratic bosonic Hamiltonians. We obtain an upper bound on the scaling of $t$ with the number of bosons $n$ for which approximate sampling is classically efficient. We also obtain a lower bound on the scaling of $t$ with $n$ for which any instance of the boson sampling problem reduces to this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05332","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-18T00:08:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mWeS9oI5dEXhnJvjUsQTd/fh3fI4yZhVuuRQmOqaiVvzTGCuciiXvEdAG53dK6byPzUP65nPZd0I/CNc9iB8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:21:59.835526Z"},"content_sha256":"ddacc1d9ea25056324ddb24ea868746ec0274d5b15c5ab22369f3a3cf3c2ee6f","schema_version":"1.0","event_id":"sha256:ddacc1d9ea25056324ddb24ea868746ec0274d5b15c5ab22369f3a3cf3c2ee6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DBTGBBIE7NPQVLNIFRFA7M45HK/bundle.json","state_url":"https://pith.science/pith/DBTGBBIE7NPQVLNIFRFA7M45HK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DBTGBBIE7NPQVLNIFRFA7M45HK/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-11T07:21:59Z","links":{"resolver":"https://pith.science/pith/DBTGBBIE7NPQVLNIFRFA7M45HK","bundle":"https://pith.science/pith/DBTGBBIE7NPQVLNIFRFA7M45HK/bundle.json","state":"https://pith.science/pith/DBTGBBIE7NPQVLNIFRFA7M45HK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DBTGBBIE7NPQVLNIFRFA7M45HK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DBTGBBIE7NPQVLNIFRFA7M45HK","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":"4a084d198ec4db5ed6889fd729501e5abb44e29f25bd666493a6f27b14a72b8f","cross_cats_sorted":["cond-mat.quant-gas","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-03-15T18:00:05Z","title_canon_sha256":"704514e302ce8e4a005435c489c4f7335a1bd88f599a08700374b1f85caaff73"},"schema_version":"1.0","source":{"id":"1703.05332","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05332","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05332v3","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05332","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"pith_short_12","alias_value":"DBTGBBIE7NPQ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DBTGBBIE7NPQVLNI","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DBTGBBIE","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:ddacc1d9ea25056324ddb24ea868746ec0274d5b15c5ab22369f3a3cf3c2ee6f","target":"graph","created_at":"2026-05-18T00:08: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":"We make the case for studying the complexity of approximately simulating (sampling) quantum systems for reasons beyond that of quantum computational supremacy, such as diagnosing phase transitions. We consider the sampling complexity as a function of time $t$ due to evolution generated by spatially local quadratic bosonic Hamiltonians. We obtain an upper bound on the scaling of $t$ with the number of bosons $n$ for which approximate sampling is classically efficient. We also obtain a lower bound on the scaling of $t$ with $n$ for which any instance of the boson sampling problem reduces to this","authors_text":"Abhinav Deshpande, Alexey V. Gorshkov, Bill Fefferman, Michael Foss-Feig, Minh C. Tran","cross_cats":["cond-mat.quant-gas","cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-03-15T18:00:05Z","title":"Dynamical phase transitions in sampling complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05332","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:fcdccf557e295a7c49610049ee38c95b137d94660c7a9f8fc392610c143e6b71","target":"record","created_at":"2026-05-18T00:08: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":"4a084d198ec4db5ed6889fd729501e5abb44e29f25bd666493a6f27b14a72b8f","cross_cats_sorted":["cond-mat.quant-gas","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-03-15T18:00:05Z","title_canon_sha256":"704514e302ce8e4a005435c489c4f7335a1bd88f599a08700374b1f85caaff73"},"schema_version":"1.0","source":{"id":"1703.05332","kind":"arxiv","version":3}},"canonical_sha256":"1866608504fb5f0aada82c4a0fb39d3ab0d8afccd663c1e6debd7e688b802a6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1866608504fb5f0aada82c4a0fb39d3ab0d8afccd663c1e6debd7e688b802a6d","first_computed_at":"2026-05-18T00:08:55.456058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:55.456058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wVIIAbDmJBS2p61E52dVxtTsxOpd+7oYtu82/bfM6LDD/+tlXbhpLodNNCzBsfT31oMxbRqOjarxInnwDGQrDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:55.456714Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05332","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcdccf557e295a7c49610049ee38c95b137d94660c7a9f8fc392610c143e6b71","sha256:ddacc1d9ea25056324ddb24ea868746ec0274d5b15c5ab22369f3a3cf3c2ee6f"],"state_sha256":"7188c49cf8932b18de36bd56d579c393afbf47c5a81b5a510c76037723b5cb85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U0+saYfJ5Q6vHh00O1qXSneX5zy+2IzjpS+YfEzQ8LMSEE1K5JhteaQf2CzARTybsfqmrdFjEHhiS3XcykFQCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T07:21:59.840624Z","bundle_sha256":"523a1ba9ca99cb34f929b6ef90276e6cf6985210d99212769c520d3ee354a236"}}