{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZYMFNNXZTVTR5O63AQLAQ6JNCA","short_pith_number":"pith:ZYMFNNXZ","canonical_record":{"source":{"id":"2602.07913","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-02-08T11:18:45Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"e59284456e03d6bf4d222ee4e7b70c7e6c5974d6b2e33a1e3b314525a1f9d0fe","abstract_canon_sha256":"f315f733a6f7133bba123bcd9b7e731a525a1b38b9fd049d82367c9554b6f44c"},"schema_version":"1.0"},"canonical_sha256":"ce1856b6f99d671ebbdb041608792d101f6efc31ab595b9dcce55cf60ecaaf90","source":{"kind":"arxiv","id":"2602.07913","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.07913","created_at":"2026-06-30T02:18:06Z"},{"alias_kind":"arxiv_version","alias_value":"2602.07913v2","created_at":"2026-06-30T02:18:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.07913","created_at":"2026-06-30T02:18:06Z"},{"alias_kind":"pith_short_12","alias_value":"ZYMFNNXZTVTR","created_at":"2026-06-30T02:18:06Z"},{"alias_kind":"pith_short_16","alias_value":"ZYMFNNXZTVTR5O63","created_at":"2026-06-30T02:18:06Z"},{"alias_kind":"pith_short_8","alias_value":"ZYMFNNXZ","created_at":"2026-06-30T02:18:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZYMFNNXZTVTR5O63AQLAQ6JNCA","target":"record","payload":{"canonical_record":{"source":{"id":"2602.07913","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-02-08T11:18:45Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"e59284456e03d6bf4d222ee4e7b70c7e6c5974d6b2e33a1e3b314525a1f9d0fe","abstract_canon_sha256":"f315f733a6f7133bba123bcd9b7e731a525a1b38b9fd049d82367c9554b6f44c"},"schema_version":"1.0"},"canonical_sha256":"ce1856b6f99d671ebbdb041608792d101f6efc31ab595b9dcce55cf60ecaaf90","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:18:06.774424Z","signature_b64":"IEsJ5sFbhSdp3WV3PYHVjctsNNSWmxt+kAw4CebOkvzGe7mqAIe+GU0E6wXn+dk3SZ5jRJb+6VUDIkTjnONDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce1856b6f99d671ebbdb041608792d101f6efc31ab595b9dcce55cf60ecaaf90","last_reissued_at":"2026-06-30T02:18:06.773530Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:18:06.773530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.07913","source_version":2,"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-06-30T02:18:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"68yd0/rzyQoKv1Sh4OhEHjrdgRHXodD5HVNTNI7qB/Kgfhlq2sT3K0KJIZCCzK3pvlwfpA1opruSrwu2zisKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T12:42:18.765860Z"},"content_sha256":"d21fd81246b2c38f8ea01cf47beb3f3350169318e4b011e2a1c47bdf5dec469f","schema_version":"1.0","event_id":"sha256:d21fd81246b2c38f8ea01cf47beb3f3350169318e4b011e2a1c47bdf5dec469f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZYMFNNXZTVTR5O63AQLAQ6JNCA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Agent Route Planning as a QUBO Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.RO","authors_text":"Juraj Gazda, Martin Chovanec, Ren\\'ata Rusn\\'akov\\'a","submitted_at":"2026-02-08T11:18:45Z","abstract_excerpt":"Multi-Agent Route Planning considers selecting vehicles, each associated with a single predefined route, such that route-level coverage utility is maximized while redundant spatial overlaps are limited. This paper gives a formal problem definition, proves NP-hardness by reduction from the Weighted Set Packing problem, and derives a Quadratic Unconstrained Binary Optimization formulation whose coefficients directly encode route utility rewards and pairwise overlap penalties. A single penalty parameter $\\lambda$ controls the coverage--overlap trade-off. We distinguish between a soft regime, whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.07913","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.07913/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-06-30T02:18:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yeA75GDR7wT7l7ZRkxuTs9Bh4dHzvGMpgL9ifPMhmpd9nFa35p7aFaT5Mh/+f5McupXbVF3XUm5xRM6G0yLDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T12:42:18.766376Z"},"content_sha256":"a60614554413f82d62bb00658e7c47cded6b346568c170ed7a93e1269b7da982","schema_version":"1.0","event_id":"sha256:a60614554413f82d62bb00658e7c47cded6b346568c170ed7a93e1269b7da982"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZYMFNNXZTVTR5O63AQLAQ6JNCA/bundle.json","state_url":"https://pith.science/pith/ZYMFNNXZTVTR5O63AQLAQ6JNCA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZYMFNNXZTVTR5O63AQLAQ6JNCA/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-20T12:42:18Z","links":{"resolver":"https://pith.science/pith/ZYMFNNXZTVTR5O63AQLAQ6JNCA","bundle":"https://pith.science/pith/ZYMFNNXZTVTR5O63AQLAQ6JNCA/bundle.json","state":"https://pith.science/pith/ZYMFNNXZTVTR5O63AQLAQ6JNCA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZYMFNNXZTVTR5O63AQLAQ6JNCA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZYMFNNXZTVTR5O63AQLAQ6JNCA","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":"f315f733a6f7133bba123bcd9b7e731a525a1b38b9fd049d82367c9554b6f44c","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-02-08T11:18:45Z","title_canon_sha256":"e59284456e03d6bf4d222ee4e7b70c7e6c5974d6b2e33a1e3b314525a1f9d0fe"},"schema_version":"1.0","source":{"id":"2602.07913","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.07913","created_at":"2026-06-30T02:18:06Z"},{"alias_kind":"arxiv_version","alias_value":"2602.07913v2","created_at":"2026-06-30T02:18:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.07913","created_at":"2026-06-30T02:18:06Z"},{"alias_kind":"pith_short_12","alias_value":"ZYMFNNXZTVTR","created_at":"2026-06-30T02:18:06Z"},{"alias_kind":"pith_short_16","alias_value":"ZYMFNNXZTVTR5O63","created_at":"2026-06-30T02:18:06Z"},{"alias_kind":"pith_short_8","alias_value":"ZYMFNNXZ","created_at":"2026-06-30T02:18:06Z"}],"graph_snapshots":[{"event_id":"sha256:a60614554413f82d62bb00658e7c47cded6b346568c170ed7a93e1269b7da982","target":"graph","created_at":"2026-06-30T02:18:06Z","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/2602.07913/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-Agent Route Planning considers selecting vehicles, each associated with a single predefined route, such that route-level coverage utility is maximized while redundant spatial overlaps are limited. This paper gives a formal problem definition, proves NP-hardness by reduction from the Weighted Set Packing problem, and derives a Quadratic Unconstrained Binary Optimization formulation whose coefficients directly encode route utility rewards and pairwise overlap penalties. A single penalty parameter $\\lambda$ controls the coverage--overlap trade-off. We distinguish between a soft regime, whic","authors_text":"Juraj Gazda, Martin Chovanec, Ren\\'ata Rusn\\'akov\\'a","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.07913","kind":"arxiv","version":2},"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:d21fd81246b2c38f8ea01cf47beb3f3350169318e4b011e2a1c47bdf5dec469f","target":"record","created_at":"2026-06-30T02:18:06Z","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":"f315f733a6f7133bba123bcd9b7e731a525a1b38b9fd049d82367c9554b6f44c","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-02-08T11:18:45Z","title_canon_sha256":"e59284456e03d6bf4d222ee4e7b70c7e6c5974d6b2e33a1e3b314525a1f9d0fe"},"schema_version":"1.0","source":{"id":"2602.07913","kind":"arxiv","version":2}},"canonical_sha256":"ce1856b6f99d671ebbdb041608792d101f6efc31ab595b9dcce55cf60ecaaf90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce1856b6f99d671ebbdb041608792d101f6efc31ab595b9dcce55cf60ecaaf90","first_computed_at":"2026-06-30T02:18:06.773530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T02:18:06.773530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IEsJ5sFbhSdp3WV3PYHVjctsNNSWmxt+kAw4CebOkvzGe7mqAIe+GU0E6wXn+dk3SZ5jRJb+6VUDIkTjnONDDQ==","signature_status":"signed_v1","signed_at":"2026-06-30T02:18:06.774424Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.07913","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d21fd81246b2c38f8ea01cf47beb3f3350169318e4b011e2a1c47bdf5dec469f","sha256:a60614554413f82d62bb00658e7c47cded6b346568c170ed7a93e1269b7da982"],"state_sha256":"fe4ca37b16e0476410c7f9cc9e90af1dfd2e24ddc9d32c13e9f3136e5133bf0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qOl1465/r+nGKKS/MALBp71hpI8UiJk8+i8ihpwNADQlFmZxkEiWwHyDpyiS1kJELZhmxCfkhzP3XJaI/v0JBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T12:42:18.771548Z","bundle_sha256":"39f1999e1f1a893fa44293fef7c508f6ad997082199f394dc8f0df89353c2973"}}