{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:OBV4I2BKZRUBBFHM5DPWTAU6NV","short_pith_number":"pith:OBV4I2BK","canonical_record":{"source":{"id":"2204.11575","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-04-25T11:45:31Z","cross_cats_sorted":[],"title_canon_sha256":"637411ab0adb238d837977dde66e30a1cb456adad83e603a1654d71880ba8aaf","abstract_canon_sha256":"a56216515620078f0390a35ed81159932d07d835adcffa853e468617718358c9"},"schema_version":"1.0"},"canonical_sha256":"706bc4682acc681094ece8df69829e6d7fffea8b4f3de5bf5977771293e871c8","source":{"kind":"arxiv","id":"2204.11575","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.11575","created_at":"2026-07-05T05:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"2204.11575v2","created_at":"2026-07-05T05:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.11575","created_at":"2026-07-05T05:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"OBV4I2BKZRUB","created_at":"2026-07-05T05:44:37Z"},{"alias_kind":"pith_short_16","alias_value":"OBV4I2BKZRUBBFHM","created_at":"2026-07-05T05:44:37Z"},{"alias_kind":"pith_short_8","alias_value":"OBV4I2BK","created_at":"2026-07-05T05:44:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:OBV4I2BKZRUBBFHM5DPWTAU6NV","target":"record","payload":{"canonical_record":{"source":{"id":"2204.11575","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-04-25T11:45:31Z","cross_cats_sorted":[],"title_canon_sha256":"637411ab0adb238d837977dde66e30a1cb456adad83e603a1654d71880ba8aaf","abstract_canon_sha256":"a56216515620078f0390a35ed81159932d07d835adcffa853e468617718358c9"},"schema_version":"1.0"},"canonical_sha256":"706bc4682acc681094ece8df69829e6d7fffea8b4f3de5bf5977771293e871c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:44:37.752086Z","signature_b64":"Ri8IbUz4zGoCNcVbDpNPPvNpcSTLn9j9jndJ3XC/gPkPI+/9bit4fHTMmJyMKMOHfGFYaNmyI1Z4fnUmJLl8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"706bc4682acc681094ece8df69829e6d7fffea8b4f3de5bf5977771293e871c8","last_reissued_at":"2026-07-05T05:44:37.751650Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:44:37.751650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2204.11575","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-05T05:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mGS1p12b/JKbUq+/1CHvyOkrNA9S7liKCxsm6X1yOWo3VDOkjNSxBmCJz0gKvWp81o9kHj6ZMXiAQjbc+b5qDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:16:03.710865Z"},"content_sha256":"c464b5b4239ae953e588abf5b37e18e81be1765c6e0d352b3b5f77c2cf3edd08","schema_version":"1.0","event_id":"sha256:c464b5b4239ae953e588abf5b37e18e81be1765c6e0d352b3b5f77c2cf3edd08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:OBV4I2BKZRUBBFHM5DPWTAU6NV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Reinforcement Learning for Orienteering Problems Based on Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Kaiwen Li, Kang Yang, Rui Wang, Tao Zhang, Wei Liu, Wenhua Li","submitted_at":"2022-04-25T11:45:31Z","abstract_excerpt":"This paper presents a new method for solving an orienteering problem (OP) by breaking it down into two parts: a knapsack problem (KP) and a traveling salesman problem (TSP). A KP solver is responsible for picking nodes, while a TSP solver is responsible for designing the proper path and assisting the KP solver in judging constraint violations. To address constraints, we propose a dual-population coevolutionary algorithm (DPCA) as the KP solver, which simultaneously maintains both feasible and infeasible populations. A dynamic pointer network (DYPN) is introduced as the TSP solver, which takes "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.11575","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/2204.11575/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-05T05:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9BzdTeRGMjHIUNL5+zMthySjMuLH7BcXpEI0uYWm/4NmelAN0lPub6i+QOtNf77BRAOVyut84MnT50pK5vMwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:16:03.711252Z"},"content_sha256":"79481794f702a084a6aa5df79b1d52ed46016d85be97c7adba26c98b899133ac","schema_version":"1.0","event_id":"sha256:79481794f702a084a6aa5df79b1d52ed46016d85be97c7adba26c98b899133ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OBV4I2BKZRUBBFHM5DPWTAU6NV/bundle.json","state_url":"https://pith.science/pith/OBV4I2BKZRUBBFHM5DPWTAU6NV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OBV4I2BKZRUBBFHM5DPWTAU6NV/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-07-07T06:16:03Z","links":{"resolver":"https://pith.science/pith/OBV4I2BKZRUBBFHM5DPWTAU6NV","bundle":"https://pith.science/pith/OBV4I2BKZRUBBFHM5DPWTAU6NV/bundle.json","state":"https://pith.science/pith/OBV4I2BKZRUBBFHM5DPWTAU6NV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OBV4I2BKZRUBBFHM5DPWTAU6NV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:OBV4I2BKZRUBBFHM5DPWTAU6NV","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":"a56216515620078f0390a35ed81159932d07d835adcffa853e468617718358c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-04-25T11:45:31Z","title_canon_sha256":"637411ab0adb238d837977dde66e30a1cb456adad83e603a1654d71880ba8aaf"},"schema_version":"1.0","source":{"id":"2204.11575","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.11575","created_at":"2026-07-05T05:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"2204.11575v2","created_at":"2026-07-05T05:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.11575","created_at":"2026-07-05T05:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"OBV4I2BKZRUB","created_at":"2026-07-05T05:44:37Z"},{"alias_kind":"pith_short_16","alias_value":"OBV4I2BKZRUBBFHM","created_at":"2026-07-05T05:44:37Z"},{"alias_kind":"pith_short_8","alias_value":"OBV4I2BK","created_at":"2026-07-05T05:44:37Z"}],"graph_snapshots":[{"event_id":"sha256:79481794f702a084a6aa5df79b1d52ed46016d85be97c7adba26c98b899133ac","target":"graph","created_at":"2026-07-05T05:44:37Z","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/2204.11575/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a new method for solving an orienteering problem (OP) by breaking it down into two parts: a knapsack problem (KP) and a traveling salesman problem (TSP). A KP solver is responsible for picking nodes, while a TSP solver is responsible for designing the proper path and assisting the KP solver in judging constraint violations. To address constraints, we propose a dual-population coevolutionary algorithm (DPCA) as the KP solver, which simultaneously maintains both feasible and infeasible populations. A dynamic pointer network (DYPN) is introduced as the TSP solver, which takes ","authors_text":"Kaiwen Li, Kang Yang, Rui Wang, Tao Zhang, Wei Liu, Wenhua Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-04-25T11:45:31Z","title":"Deep Reinforcement Learning for Orienteering Problems Based on Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.11575","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:c464b5b4239ae953e588abf5b37e18e81be1765c6e0d352b3b5f77c2cf3edd08","target":"record","created_at":"2026-07-05T05:44:37Z","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":"a56216515620078f0390a35ed81159932d07d835adcffa853e468617718358c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-04-25T11:45:31Z","title_canon_sha256":"637411ab0adb238d837977dde66e30a1cb456adad83e603a1654d71880ba8aaf"},"schema_version":"1.0","source":{"id":"2204.11575","kind":"arxiv","version":2}},"canonical_sha256":"706bc4682acc681094ece8df69829e6d7fffea8b4f3de5bf5977771293e871c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"706bc4682acc681094ece8df69829e6d7fffea8b4f3de5bf5977771293e871c8","first_computed_at":"2026-07-05T05:44:37.751650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:44:37.751650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ri8IbUz4zGoCNcVbDpNPPvNpcSTLn9j9jndJ3XC/gPkPI+/9bit4fHTMmJyMKMOHfGFYaNmyI1Z4fnUmJLl8Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:44:37.752086Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.11575","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c464b5b4239ae953e588abf5b37e18e81be1765c6e0d352b3b5f77c2cf3edd08","sha256:79481794f702a084a6aa5df79b1d52ed46016d85be97c7adba26c98b899133ac"],"state_sha256":"1c8b091753d42b230ce9d3360da49a89bdbe084cea6eb640dc970a3162d9be8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LmlIW6xhcJKl2k5dyzTTzW1qkTNG0o+rQdi+C/5yqyZCCwQEN4RhzRpGmUNxcm8OxzksHNMGekntUpX9ITq7Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:16:03.713860Z","bundle_sha256":"e567e40184b3ebc23823a93d023a0b02332ea151afca906e8eb922c380bee0fa"}}