{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:PN2VZZI47O52NBC44EGND7MXWB","short_pith_number":"pith:PN2VZZI4","schema_version":"1.0","canonical_sha256":"7b755ce51cfbbba6845ce10cd1fd97b04abc11e6f4e8b8178d97e33b7390870c","source":{"kind":"arxiv","id":"2207.07460","version":1},"attestation_state":"computed","paper":{"title":"Comparative Benchmark of a Quantum Algorithm for the Bin Packing Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eneko Osaba, Esther Villar-Rodriguez, Izaskun Oregi, Mikel Garcia-de-Andoin, Mikel Sanz","submitted_at":"2022-07-15T13:09:12Z","abstract_excerpt":"The Bin Packing Problem (BPP) stands out as a paradigmatic combinatorial optimization problem in logistics. Quantum and hybrid quantum-classical algorithms are expected to show an advantage over their classical counterparts in obtaining approximate solutions for optimization problems. We have recently proposed a hybrid approach to the one dimensional BPP in which a quantum annealing subroutine is employed to sample feasible solutions for single containers. From this reduced search space, a classical optimization subroutine can find the solution to the problem. With the aim of going a step furt"},"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":"2207.07460","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-07-15T13:09:12Z","cross_cats_sorted":[],"title_canon_sha256":"5f3a0da4a821647babee227b3a0dcc472cabfc80f0019ddc5b45a32185df2e8b","abstract_canon_sha256":"5e1be7f98b4b153709ccbee0b58be3e6da5715fa3d9ef063035707c758907f99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:12:22.521653Z","signature_b64":"DQBrJUG5kBz0e7Bvma1pU+Ic7LtZuS/HA8/ae8puEIqFJDlTvQBBG/JfcI3VQQSQkCE1KrfPiepugEE2DvjODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b755ce51cfbbba6845ce10cd1fd97b04abc11e6f4e8b8178d97e33b7390870c","last_reissued_at":"2026-07-05T06:12:22.521229Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:12:22.521229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparative Benchmark of a Quantum Algorithm for the Bin Packing Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eneko Osaba, Esther Villar-Rodriguez, Izaskun Oregi, Mikel Garcia-de-Andoin, Mikel Sanz","submitted_at":"2022-07-15T13:09:12Z","abstract_excerpt":"The Bin Packing Problem (BPP) stands out as a paradigmatic combinatorial optimization problem in logistics. Quantum and hybrid quantum-classical algorithms are expected to show an advantage over their classical counterparts in obtaining approximate solutions for optimization problems. We have recently proposed a hybrid approach to the one dimensional BPP in which a quantum annealing subroutine is employed to sample feasible solutions for single containers. From this reduced search space, a classical optimization subroutine can find the solution to the problem. With the aim of going a step furt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.07460","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/2207.07460/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":"2207.07460","created_at":"2026-07-05T06:12:22.521286+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.07460v1","created_at":"2026-07-05T06:12:22.521286+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.07460","created_at":"2026-07-05T06:12:22.521286+00:00"},{"alias_kind":"pith_short_12","alias_value":"PN2VZZI47O52","created_at":"2026-07-05T06:12:22.521286+00:00"},{"alias_kind":"pith_short_16","alias_value":"PN2VZZI47O52NBC4","created_at":"2026-07-05T06:12:22.521286+00:00"},{"alias_kind":"pith_short_8","alias_value":"PN2VZZI4","created_at":"2026-07-05T06:12:22.521286+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.17896","citing_title":"Steiner Traveling Salesman Problem with Time Windows and Pickup-Delivery: integrating classical and quantum optimization","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20321","citing_title":"Cutting-plane methodology via quantum optimization for solving the Traveling Salesman Problem","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PN2VZZI47O52NBC44EGND7MXWB","json":"https://pith.science/pith/PN2VZZI47O52NBC44EGND7MXWB.json","graph_json":"https://pith.science/api/pith-number/PN2VZZI47O52NBC44EGND7MXWB/graph.json","events_json":"https://pith.science/api/pith-number/PN2VZZI47O52NBC44EGND7MXWB/events.json","paper":"https://pith.science/paper/PN2VZZI4"},"agent_actions":{"view_html":"https://pith.science/pith/PN2VZZI47O52NBC44EGND7MXWB","download_json":"https://pith.science/pith/PN2VZZI47O52NBC44EGND7MXWB.json","view_paper":"https://pith.science/paper/PN2VZZI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.07460&json=true","fetch_graph":"https://pith.science/api/pith-number/PN2VZZI47O52NBC44EGND7MXWB/graph.json","fetch_events":"https://pith.science/api/pith-number/PN2VZZI47O52NBC44EGND7MXWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PN2VZZI47O52NBC44EGND7MXWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PN2VZZI47O52NBC44EGND7MXWB/action/storage_attestation","attest_author":"https://pith.science/pith/PN2VZZI47O52NBC44EGND7MXWB/action/author_attestation","sign_citation":"https://pith.science/pith/PN2VZZI47O52NBC44EGND7MXWB/action/citation_signature","submit_replication":"https://pith.science/pith/PN2VZZI47O52NBC44EGND7MXWB/action/replication_record"}},"created_at":"2026-07-05T06:12:22.521286+00:00","updated_at":"2026-07-05T06:12:22.521286+00:00"}