{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JVLD2RICKDIKQXOWYLGRW4ZII6","short_pith_number":"pith:JVLD2RIC","schema_version":"1.0","canonical_sha256":"4d563d450250d0a85dd6c2cd1b73284780dcd4183377b2104bc73887a29ae74f","source":{"kind":"arxiv","id":"1506.08479","version":2},"attestation_state":"computed","paper":{"title":"Quantum Annealing Implementation of Job-Shop Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Davide Venturelli, Dominic J.J. Marchand, Galo Rojo","submitted_at":"2015-06-29T00:27:32Z","abstract_excerpt":"A quantum annealing solver for the renowned job-shop scheduling problem (JSP) is presented in detail. After formulating the problem as a time-indexed quadratic unconstrained binary optimization problem, several pre-processing and graph embedding strategies are employed to compile optimally parametrized families of the JSP for scheduling instances of up to six jobs and six machines on the D-Wave Systems Vesuvius processor. Problem simplifications and partitioning algorithms, including variable pruning and running strategies that consider tailored binary searches, are discussed and the results f"},"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":"1506.08479","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-06-29T00:27:32Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"fa1306a1bb96630009e998ec16c922bf89dd33b972417e19d1bec5aa8c562b08","abstract_canon_sha256":"e692c962bca3568bb3e94ec3376b74a4f2112e1f675b22299edfcc6c11b2aecd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:13.900816Z","signature_b64":"iMGC4J9rWxJHlpckiUrTfrcnlaM8l7OxySlgboFoIWW84Zr9dOaeJG5JJicz19lnf4cHPxm7+VFpLQ0a4bMbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d563d450250d0a85dd6c2cd1b73284780dcd4183377b2104bc73887a29ae74f","last_reissued_at":"2026-05-18T01:02:13.900008Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:13.900008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Annealing Implementation of Job-Shop Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Davide Venturelli, Dominic J.J. Marchand, Galo Rojo","submitted_at":"2015-06-29T00:27:32Z","abstract_excerpt":"A quantum annealing solver for the renowned job-shop scheduling problem (JSP) is presented in detail. After formulating the problem as a time-indexed quadratic unconstrained binary optimization problem, several pre-processing and graph embedding strategies are employed to compile optimally parametrized families of the JSP for scheduling instances of up to six jobs and six machines on the D-Wave Systems Vesuvius processor. Problem simplifications and partitioning algorithms, including variable pruning and running strategies that consider tailored binary searches, are discussed and the results f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08479","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.08479","created_at":"2026-05-18T01:02:13.900143+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.08479v2","created_at":"2026-05-18T01:02:13.900143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08479","created_at":"2026-05-18T01:02:13.900143+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVLD2RICKDIK","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVLD2RICKDIKQXOW","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVLD2RIC","created_at":"2026-05-18T12:29:27.538025+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.15899","citing_title":"Solving Classical and Quantum Spin Glasses with Deep Boltzmann Quantum States","ref_index":121,"is_internal_anchor":true},{"citing_arxiv_id":"2510.02430","citing_title":"Mitigating the barren plateau problem in linear optics","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JVLD2RICKDIKQXOWYLGRW4ZII6","json":"https://pith.science/pith/JVLD2RICKDIKQXOWYLGRW4ZII6.json","graph_json":"https://pith.science/api/pith-number/JVLD2RICKDIKQXOWYLGRW4ZII6/graph.json","events_json":"https://pith.science/api/pith-number/JVLD2RICKDIKQXOWYLGRW4ZII6/events.json","paper":"https://pith.science/paper/JVLD2RIC"},"agent_actions":{"view_html":"https://pith.science/pith/JVLD2RICKDIKQXOWYLGRW4ZII6","download_json":"https://pith.science/pith/JVLD2RICKDIKQXOWYLGRW4ZII6.json","view_paper":"https://pith.science/paper/JVLD2RIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.08479&json=true","fetch_graph":"https://pith.science/api/pith-number/JVLD2RICKDIKQXOWYLGRW4ZII6/graph.json","fetch_events":"https://pith.science/api/pith-number/JVLD2RICKDIKQXOWYLGRW4ZII6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVLD2RICKDIKQXOWYLGRW4ZII6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVLD2RICKDIKQXOWYLGRW4ZII6/action/storage_attestation","attest_author":"https://pith.science/pith/JVLD2RICKDIKQXOWYLGRW4ZII6/action/author_attestation","sign_citation":"https://pith.science/pith/JVLD2RICKDIKQXOWYLGRW4ZII6/action/citation_signature","submit_replication":"https://pith.science/pith/JVLD2RICKDIKQXOWYLGRW4ZII6/action/replication_record"}},"created_at":"2026-05-18T01:02:13.900143+00:00","updated_at":"2026-05-18T01:02:13.900143+00:00"}