{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:OWPAO7HRJHUWTNGAZPZAZE5QV2","short_pith_number":"pith:OWPAO7HR","canonical_record":{"source":{"id":"2412.14783","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-19T12:12:22Z","cross_cats_sorted":[],"title_canon_sha256":"408406d6d89bb82a3f1bcbe5cb9ee6f112fc84804fc7364b9643bc5c6520a8d6","abstract_canon_sha256":"681dc2732b58e06ccfda689a356d50f7721ba6aa9a8f64737be3fe1a5fb396e6"},"schema_version":"1.0"},"canonical_sha256":"759e077cf149e969b4c0cbf20c93b0aeba79ecc2937fbd8b00d4f79128710410","source":{"kind":"arxiv","id":"2412.14783","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.14783","created_at":"2026-07-05T09:51:52Z"},{"alias_kind":"arxiv_version","alias_value":"2412.14783v1","created_at":"2026-07-05T09:51:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.14783","created_at":"2026-07-05T09:51:52Z"},{"alias_kind":"pith_short_12","alias_value":"OWPAO7HRJHUW","created_at":"2026-07-05T09:51:52Z"},{"alias_kind":"pith_short_16","alias_value":"OWPAO7HRJHUWTNGA","created_at":"2026-07-05T09:51:52Z"},{"alias_kind":"pith_short_8","alias_value":"OWPAO7HR","created_at":"2026-07-05T09:51:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:OWPAO7HRJHUWTNGAZPZAZE5QV2","target":"record","payload":{"canonical_record":{"source":{"id":"2412.14783","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-19T12:12:22Z","cross_cats_sorted":[],"title_canon_sha256":"408406d6d89bb82a3f1bcbe5cb9ee6f112fc84804fc7364b9643bc5c6520a8d6","abstract_canon_sha256":"681dc2732b58e06ccfda689a356d50f7721ba6aa9a8f64737be3fe1a5fb396e6"},"schema_version":"1.0"},"canonical_sha256":"759e077cf149e969b4c0cbf20c93b0aeba79ecc2937fbd8b00d4f79128710410","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:51:52.764636Z","signature_b64":"J0SpSfovbTP5NkxNlMGfyq+vADD2mFZjFwSMGnSAAZmPqHdjTwH/wrQuG5ovf24ID5ytTUvlXoUlmShX8CI7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"759e077cf149e969b4c0cbf20c93b0aeba79ecc2937fbd8b00d4f79128710410","last_reissued_at":"2026-07-05T09:51:52.764129Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:51:52.764129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.14783","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-07-05T09:51:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"seAUEhLx0Ch9aaO0UHm0mTzSKEnZvhgrjOU9BG2WmdpCctEwdZTaqpdmdGgz8xrJjHBIb48EsWrrQtTZTg7XCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:53:58.702377Z"},"content_sha256":"8b9e90873f7ce282211a783fed477ff1c1b9b7defe2e53fe9b96ccf52c81acab","schema_version":"1.0","event_id":"sha256:8b9e90873f7ce282211a783fed477ff1c1b9b7defe2e53fe9b96ccf52c81acab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:OWPAO7HRJHUWTNGAZPZAZE5QV2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gaussian boson sampling for binary optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jean Cazalis, Karl Jansen, Stefan K\\\"uhn, Tirth Shah, Yahui Chai","submitted_at":"2024-12-19T12:12:22Z","abstract_excerpt":"Binary optimization is a fundamental area in computational science, with wide-ranging applications from logistics to cryptography, where the tasks are often formulated as Quadratic or Polynomial Unconstrained Binary Optimization problems (QUBO/PUBO). In this work, we propose to use a parametrized Gaussian Boson Sampler (GBS) with threshold detectors to address such problems. We map general PUBO instance onto a quantum Hamiltonian and optimize the Conditional Value-at-Risk of its energy with respect to the GBS ansatz. In particular, we observe that, when the algorithm reduces to standard Variat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.14783","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.14783/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:51:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BHBgxmlwyVhpnqu5Ct2mKkVIE0Kk2lUWQM2oM3bmOL/nGULj5S9g89BMXe2V12s+3i1KfO971J/UQLXnDDTxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:53:58.703350Z"},"content_sha256":"0e97fe7a29d0ec31dc6b2d6ef56565bcc517e0f2dd003ada36bf0fb2bd889a9a","schema_version":"1.0","event_id":"sha256:0e97fe7a29d0ec31dc6b2d6ef56565bcc517e0f2dd003ada36bf0fb2bd889a9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OWPAO7HRJHUWTNGAZPZAZE5QV2/bundle.json","state_url":"https://pith.science/pith/OWPAO7HRJHUWTNGAZPZAZE5QV2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OWPAO7HRJHUWTNGAZPZAZE5QV2/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-08-13T14:53:58Z","links":{"resolver":"https://pith.science/pith/OWPAO7HRJHUWTNGAZPZAZE5QV2","bundle":"https://pith.science/pith/OWPAO7HRJHUWTNGAZPZAZE5QV2/bundle.json","state":"https://pith.science/pith/OWPAO7HRJHUWTNGAZPZAZE5QV2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OWPAO7HRJHUWTNGAZPZAZE5QV2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:OWPAO7HRJHUWTNGAZPZAZE5QV2","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":"681dc2732b58e06ccfda689a356d50f7721ba6aa9a8f64737be3fe1a5fb396e6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-19T12:12:22Z","title_canon_sha256":"408406d6d89bb82a3f1bcbe5cb9ee6f112fc84804fc7364b9643bc5c6520a8d6"},"schema_version":"1.0","source":{"id":"2412.14783","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.14783","created_at":"2026-07-05T09:51:52Z"},{"alias_kind":"arxiv_version","alias_value":"2412.14783v1","created_at":"2026-07-05T09:51:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.14783","created_at":"2026-07-05T09:51:52Z"},{"alias_kind":"pith_short_12","alias_value":"OWPAO7HRJHUW","created_at":"2026-07-05T09:51:52Z"},{"alias_kind":"pith_short_16","alias_value":"OWPAO7HRJHUWTNGA","created_at":"2026-07-05T09:51:52Z"},{"alias_kind":"pith_short_8","alias_value":"OWPAO7HR","created_at":"2026-07-05T09:51:52Z"}],"graph_snapshots":[{"event_id":"sha256:0e97fe7a29d0ec31dc6b2d6ef56565bcc517e0f2dd003ada36bf0fb2bd889a9a","target":"graph","created_at":"2026-07-05T09:51:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.14783/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Binary optimization is a fundamental area in computational science, with wide-ranging applications from logistics to cryptography, where the tasks are often formulated as Quadratic or Polynomial Unconstrained Binary Optimization problems (QUBO/PUBO). In this work, we propose to use a parametrized Gaussian Boson Sampler (GBS) with threshold detectors to address such problems. We map general PUBO instance onto a quantum Hamiltonian and optimize the Conditional Value-at-Risk of its energy with respect to the GBS ansatz. In particular, we observe that, when the algorithm reduces to standard Variat","authors_text":"Jean Cazalis, Karl Jansen, Stefan K\\\"uhn, Tirth Shah, Yahui Chai","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-19T12:12:22Z","title":"Gaussian boson sampling for binary optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.14783","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:8b9e90873f7ce282211a783fed477ff1c1b9b7defe2e53fe9b96ccf52c81acab","target":"record","created_at":"2026-07-05T09:51:52Z","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":"681dc2732b58e06ccfda689a356d50f7721ba6aa9a8f64737be3fe1a5fb396e6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-19T12:12:22Z","title_canon_sha256":"408406d6d89bb82a3f1bcbe5cb9ee6f112fc84804fc7364b9643bc5c6520a8d6"},"schema_version":"1.0","source":{"id":"2412.14783","kind":"arxiv","version":1}},"canonical_sha256":"759e077cf149e969b4c0cbf20c93b0aeba79ecc2937fbd8b00d4f79128710410","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"759e077cf149e969b4c0cbf20c93b0aeba79ecc2937fbd8b00d4f79128710410","first_computed_at":"2026-07-05T09:51:52.764129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:51:52.764129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J0SpSfovbTP5NkxNlMGfyq+vADD2mFZjFwSMGnSAAZmPqHdjTwH/wrQuG5ovf24ID5ytTUvlXoUlmShX8CI7Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:51:52.764636Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.14783","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b9e90873f7ce282211a783fed477ff1c1b9b7defe2e53fe9b96ccf52c81acab","sha256:0e97fe7a29d0ec31dc6b2d6ef56565bcc517e0f2dd003ada36bf0fb2bd889a9a"],"state_sha256":"e24459b36eec79be9a91b2c6949e5892bdf0d49046dda7122c6ca87082543a7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"is06tGDzt3D/b/8VrfH4puh50Y5Z2keQvwB1DzgmFZNib1ZSsxc5r1LnjFch8dcBk1jfAesqoBM9akAXvwRIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T14:53:58.721705Z","bundle_sha256":"0cee00506925f05a176e7208a0e453f1a748758f09d1a24c93e7611db9b96273"}}