{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:D6H3Q22KS3JJUL22DZWOUHV77V","short_pith_number":"pith:D6H3Q22K","canonical_record":{"source":{"id":"2506.06121","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-06-06T14:31:57Z","cross_cats_sorted":[],"title_canon_sha256":"dc68671eaa68339c9f2391ac505f1626a276c3381a8037726209aaadec99cec4","abstract_canon_sha256":"982ff069d707e38f8ec1f67285415755dbbe3c460db57717f6efe2023cd1d5b4"},"schema_version":"1.0"},"canonical_sha256":"1f8fb86b4a96d29a2f5a1e6cea1ebffd7f00efe9098a2faa786f816e028262fb","source":{"kind":"arxiv","id":"2506.06121","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.06121","created_at":"2026-07-05T11:20:55Z"},{"alias_kind":"arxiv_version","alias_value":"2506.06121v2","created_at":"2026-07-05T11:20:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.06121","created_at":"2026-07-05T11:20:55Z"},{"alias_kind":"pith_short_12","alias_value":"D6H3Q22KS3JJ","created_at":"2026-07-05T11:20:55Z"},{"alias_kind":"pith_short_16","alias_value":"D6H3Q22KS3JJUL22","created_at":"2026-07-05T11:20:55Z"},{"alias_kind":"pith_short_8","alias_value":"D6H3Q22K","created_at":"2026-07-05T11:20:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:D6H3Q22KS3JJUL22DZWOUHV77V","target":"record","payload":{"canonical_record":{"source":{"id":"2506.06121","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-06-06T14:31:57Z","cross_cats_sorted":[],"title_canon_sha256":"dc68671eaa68339c9f2391ac505f1626a276c3381a8037726209aaadec99cec4","abstract_canon_sha256":"982ff069d707e38f8ec1f67285415755dbbe3c460db57717f6efe2023cd1d5b4"},"schema_version":"1.0"},"canonical_sha256":"1f8fb86b4a96d29a2f5a1e6cea1ebffd7f00efe9098a2faa786f816e028262fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:55.296188Z","signature_b64":"OOOvsEKkPCC+e6BiKSO0RuB7/GyXSNFoUpac++sG98eZLl69A1moDv7xs4OOQbW1i5d9CD4wbCbgVIOlISDPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f8fb86b4a96d29a2f5a1e6cea1ebffd7f00efe9098a2faa786f816e028262fb","last_reissued_at":"2026-07-05T11:20:55.295707Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:55.295707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.06121","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-07-05T11:20:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dHf7v2lGYQS3RPXFRY6UsPgEKFDWTX2AN3vXxgoG2EJTlcB0Gctm4qu8RqGgPQR1buVHAdIiOr8O7YYjphbVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T13:06:19.644953Z"},"content_sha256":"f45bdfa5fa7f8d5b4e7fc8b80c6b74385016792fff47f47c7bfe24f5761cbc34","schema_version":"1.0","event_id":"sha256:f45bdfa5fa7f8d5b4e7fc8b80c6b74385016792fff47f47c7bfe24f5761cbc34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:D6H3Q22KS3JJUL22DZWOUHV77V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposability-Guaranteed Cooperative Coevolution for Large-Scale Itinerary Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Peilan Xu, Wenjian Luo, Yuetong Sun, Yuhui Shi, Ziyu Zhang","submitted_at":"2025-06-06T14:31:57Z","abstract_excerpt":"Large-scale itinerary planning is a variant of the traveling salesman problem, aiming to determine an optimal path that maximizes the collected points of interest (POIs) scores while minimizing travel time and cost, subject to travel duration constraints. This paper analyzes the decomposability of large-scale itinerary planning, proving that strict decomposability is difficult to satisfy, and introduces a weak decomposability definition based on a necessary condition, deriving the corresponding graph structures that fulfill this property. With decomposability guaranteed, we propose a novel mul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.06121","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/2506.06121/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-07-05T11:20:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wl1wEul0N+93T2IfRapvM60sU5AAjZ9K6EKpCfEeK0YVf/BQroGcTtqz/1veXHt/3UvkGRidzwyzX9y+0Me5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T13:06:19.645569Z"},"content_sha256":"9d1742d3a5cd1a0d7b8d6b6302f186b9a09462816dd29ddfe0b021f3c6628808","schema_version":"1.0","event_id":"sha256:9d1742d3a5cd1a0d7b8d6b6302f186b9a09462816dd29ddfe0b021f3c6628808"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D6H3Q22KS3JJUL22DZWOUHV77V/bundle.json","state_url":"https://pith.science/pith/D6H3Q22KS3JJUL22DZWOUHV77V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D6H3Q22KS3JJUL22DZWOUHV77V/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-09T13:06:19Z","links":{"resolver":"https://pith.science/pith/D6H3Q22KS3JJUL22DZWOUHV77V","bundle":"https://pith.science/pith/D6H3Q22KS3JJUL22DZWOUHV77V/bundle.json","state":"https://pith.science/pith/D6H3Q22KS3JJUL22DZWOUHV77V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D6H3Q22KS3JJUL22DZWOUHV77V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:D6H3Q22KS3JJUL22DZWOUHV77V","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":"982ff069d707e38f8ec1f67285415755dbbe3c460db57717f6efe2023cd1d5b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-06-06T14:31:57Z","title_canon_sha256":"dc68671eaa68339c9f2391ac505f1626a276c3381a8037726209aaadec99cec4"},"schema_version":"1.0","source":{"id":"2506.06121","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.06121","created_at":"2026-07-05T11:20:55Z"},{"alias_kind":"arxiv_version","alias_value":"2506.06121v2","created_at":"2026-07-05T11:20:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.06121","created_at":"2026-07-05T11:20:55Z"},{"alias_kind":"pith_short_12","alias_value":"D6H3Q22KS3JJ","created_at":"2026-07-05T11:20:55Z"},{"alias_kind":"pith_short_16","alias_value":"D6H3Q22KS3JJUL22","created_at":"2026-07-05T11:20:55Z"},{"alias_kind":"pith_short_8","alias_value":"D6H3Q22K","created_at":"2026-07-05T11:20:55Z"}],"graph_snapshots":[{"event_id":"sha256:9d1742d3a5cd1a0d7b8d6b6302f186b9a09462816dd29ddfe0b021f3c6628808","target":"graph","created_at":"2026-07-05T11:20:55Z","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/2506.06121/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large-scale itinerary planning is a variant of the traveling salesman problem, aiming to determine an optimal path that maximizes the collected points of interest (POIs) scores while minimizing travel time and cost, subject to travel duration constraints. This paper analyzes the decomposability of large-scale itinerary planning, proving that strict decomposability is difficult to satisfy, and introduces a weak decomposability definition based on a necessary condition, deriving the corresponding graph structures that fulfill this property. With decomposability guaranteed, we propose a novel mul","authors_text":"Peilan Xu, Wenjian Luo, Yuetong Sun, Yuhui Shi, Ziyu Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-06-06T14:31:57Z","title":"Decomposability-Guaranteed Cooperative Coevolution for Large-Scale Itinerary Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.06121","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:f45bdfa5fa7f8d5b4e7fc8b80c6b74385016792fff47f47c7bfe24f5761cbc34","target":"record","created_at":"2026-07-05T11:20:55Z","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":"982ff069d707e38f8ec1f67285415755dbbe3c460db57717f6efe2023cd1d5b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-06-06T14:31:57Z","title_canon_sha256":"dc68671eaa68339c9f2391ac505f1626a276c3381a8037726209aaadec99cec4"},"schema_version":"1.0","source":{"id":"2506.06121","kind":"arxiv","version":2}},"canonical_sha256":"1f8fb86b4a96d29a2f5a1e6cea1ebffd7f00efe9098a2faa786f816e028262fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f8fb86b4a96d29a2f5a1e6cea1ebffd7f00efe9098a2faa786f816e028262fb","first_computed_at":"2026-07-05T11:20:55.295707Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:20:55.295707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OOOvsEKkPCC+e6BiKSO0RuB7/GyXSNFoUpac++sG98eZLl69A1moDv7xs4OOQbW1i5d9CD4wbCbgVIOlISDPAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:20:55.296188Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.06121","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f45bdfa5fa7f8d5b4e7fc8b80c6b74385016792fff47f47c7bfe24f5761cbc34","sha256:9d1742d3a5cd1a0d7b8d6b6302f186b9a09462816dd29ddfe0b021f3c6628808"],"state_sha256":"9bb31759895505ef3ce5e129d5f27454b4af1058d7adaea62554971fb25c07f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AlfBxNy3CuZGyJB7PU1cMXsTf/tpTzecwIhqIgvSDSwf9nqzOois4X9BozgMdLMNrkB7hkSs9qw31AFm7L2KBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T13:06:19.649551Z","bundle_sha256":"18c2b6f2b095c2518c87c72598fca895371f755918d494be9d67306f12bb31e8"}}