{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OWPAO7HRJHUWTNGAZPZAZE5QV2","short_pith_number":"pith:OWPAO7HR","schema_version":"1.0","canonical_sha256":"759e077cf149e969b4c0cbf20c93b0aeba79ecc2937fbd8b00d4f79128710410","source":{"kind":"arxiv","id":"2412.14783","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.14783","created_at":"2026-07-05T09:51:52.764189+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.14783v1","created_at":"2026-07-05T09:51:52.764189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.14783","created_at":"2026-07-05T09:51:52.764189+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWPAO7HRJHUW","created_at":"2026-07-05T09:51:52.764189+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWPAO7HRJHUWTNGA","created_at":"2026-07-05T09:51:52.764189+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWPAO7HR","created_at":"2026-07-05T09:51:52.764189+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30415","citing_title":"Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OWPAO7HRJHUWTNGAZPZAZE5QV2","json":"https://pith.science/pith/OWPAO7HRJHUWTNGAZPZAZE5QV2.json","graph_json":"https://pith.science/api/pith-number/OWPAO7HRJHUWTNGAZPZAZE5QV2/graph.json","events_json":"https://pith.science/api/pith-number/OWPAO7HRJHUWTNGAZPZAZE5QV2/events.json","paper":"https://pith.science/paper/OWPAO7HR"},"agent_actions":{"view_html":"https://pith.science/pith/OWPAO7HRJHUWTNGAZPZAZE5QV2","download_json":"https://pith.science/pith/OWPAO7HRJHUWTNGAZPZAZE5QV2.json","view_paper":"https://pith.science/paper/OWPAO7HR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.14783&json=true","fetch_graph":"https://pith.science/api/pith-number/OWPAO7HRJHUWTNGAZPZAZE5QV2/graph.json","fetch_events":"https://pith.science/api/pith-number/OWPAO7HRJHUWTNGAZPZAZE5QV2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWPAO7HRJHUWTNGAZPZAZE5QV2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWPAO7HRJHUWTNGAZPZAZE5QV2/action/storage_attestation","attest_author":"https://pith.science/pith/OWPAO7HRJHUWTNGAZPZAZE5QV2/action/author_attestation","sign_citation":"https://pith.science/pith/OWPAO7HRJHUWTNGAZPZAZE5QV2/action/citation_signature","submit_replication":"https://pith.science/pith/OWPAO7HRJHUWTNGAZPZAZE5QV2/action/replication_record"}},"created_at":"2026-07-05T09:51:52.764189+00:00","updated_at":"2026-07-05T09:51:52.764189+00:00"}