{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:IUSTETCHHAMPQ3MLX6FFSEEDRV","short_pith_number":"pith:IUSTETCH","schema_version":"1.0","canonical_sha256":"4525324c473818f86d8bbf8a5910838d677ae6553f8d0904d188603d34c135ce","source":{"kind":"arxiv","id":"2012.05022","version":1},"attestation_state":"computed","paper":{"title":"Ising formulations of routing optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Benedikt Sturm, Daniel Jaroszewski, Fabian Klos","submitted_at":"2020-12-09T13:00:18Z","abstract_excerpt":"We formulate binary optimization functions for single-vehicle routing, travelling salesperson and collision-free multi-vehicle routing with significant improvements in the number of variables over existing formulations. The provided functions are readily implemented on gate-based quantum computers using variational algorithms and on adiabatic quantum hardware."},"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":"2012.05022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-12-09T13:00:18Z","cross_cats_sorted":[],"title_canon_sha256":"af84270c8deab523a09eeb35272d115c4238d697a93fa821eb72e93665dd8ca9","abstract_canon_sha256":"ad81a7b91c469051031fd2743db60df33086d73157e0939636898295085e3f71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:58:17.946156Z","signature_b64":"audNmALW6E27MUS7A5jL51+fm4aodUS+rmFxrKVVCM/LAgz9Le1LDvMlf9HMFaxcHrpgYm4S0Y9sJKQI5WGeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4525324c473818f86d8bbf8a5910838d677ae6553f8d0904d188603d34c135ce","last_reissued_at":"2026-07-05T01:58:17.945563Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:58:17.945563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ising formulations of routing optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Benedikt Sturm, Daniel Jaroszewski, Fabian Klos","submitted_at":"2020-12-09T13:00:18Z","abstract_excerpt":"We formulate binary optimization functions for single-vehicle routing, travelling salesperson and collision-free multi-vehicle routing with significant improvements in the number of variables over existing formulations. The provided functions are readily implemented on gate-based quantum computers using variational algorithms and on adiabatic quantum hardware."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.05022","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/2012.05022/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":"2012.05022","created_at":"2026-07-05T01:58:17.945631+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.05022v1","created_at":"2026-07-05T01:58:17.945631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.05022","created_at":"2026-07-05T01:58:17.945631+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUSTETCHHAMP","created_at":"2026-07-05T01:58:17.945631+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUSTETCHHAMPQ3ML","created_at":"2026-07-05T01:58:17.945631+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUSTETCH","created_at":"2026-07-05T01:58:17.945631+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IUSTETCHHAMPQ3MLX6FFSEEDRV","json":"https://pith.science/pith/IUSTETCHHAMPQ3MLX6FFSEEDRV.json","graph_json":"https://pith.science/api/pith-number/IUSTETCHHAMPQ3MLX6FFSEEDRV/graph.json","events_json":"https://pith.science/api/pith-number/IUSTETCHHAMPQ3MLX6FFSEEDRV/events.json","paper":"https://pith.science/paper/IUSTETCH"},"agent_actions":{"view_html":"https://pith.science/pith/IUSTETCHHAMPQ3MLX6FFSEEDRV","download_json":"https://pith.science/pith/IUSTETCHHAMPQ3MLX6FFSEEDRV.json","view_paper":"https://pith.science/paper/IUSTETCH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.05022&json=true","fetch_graph":"https://pith.science/api/pith-number/IUSTETCHHAMPQ3MLX6FFSEEDRV/graph.json","fetch_events":"https://pith.science/api/pith-number/IUSTETCHHAMPQ3MLX6FFSEEDRV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUSTETCHHAMPQ3MLX6FFSEEDRV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUSTETCHHAMPQ3MLX6FFSEEDRV/action/storage_attestation","attest_author":"https://pith.science/pith/IUSTETCHHAMPQ3MLX6FFSEEDRV/action/author_attestation","sign_citation":"https://pith.science/pith/IUSTETCHHAMPQ3MLX6FFSEEDRV/action/citation_signature","submit_replication":"https://pith.science/pith/IUSTETCHHAMPQ3MLX6FFSEEDRV/action/replication_record"}},"created_at":"2026-07-05T01:58:17.945631+00:00","updated_at":"2026-07-05T01:58:17.945631+00:00"}