{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CCPBIV35VRA5TLATWSOMXAUTLL","short_pith_number":"pith:CCPBIV35","schema_version":"1.0","canonical_sha256":"109e14577dac41d9ac13b49ccb82935af53ab9f3341d0d54306d53038103c6b0","source":{"kind":"arxiv","id":"2607.23467","version":1},"attestation_state":"computed","paper":{"title":"Learning to Optimize: Joint Routing and Flow Allocation on Sparse Non-Euclidean Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Congyuan Ji, Fang He, Haomiao Sun, Xindi Tang","submitted_at":"2026-07-26T05:30:27Z","abstract_excerpt":"We study an integrated pickup-and-delivery problem on sparse, non-Euclidean networks that jointly optimizes cyclic routing, cargo flow allocation, and cross-cycle service. The tight coupling of these operational constraints creates a complex discrete-continuous decision space with highly restricted feasible regions. To overcome these computational challenges, we propose Double-Channel Graph Attention (DCGA), an end-to-end reinforcement learning framework. DCGA isolates network reachability and demand-service logic into separate graph channels and constructs valid routes using a simulator-coupl"},"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":"2607.23467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-26T05:30:27Z","cross_cats_sorted":[],"title_canon_sha256":"321de8d6781b5292342245de378598b58b7daf6520c3ae1dd27ee5dc3f4e3f62","abstract_canon_sha256":"e07f95439b9815621feb818d9fad58a8088d81646cdac1b1a7f8868f45f45769"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T01:22:54.064451Z","signature_b64":"1bK4D0QC/w2YhArC3a2SI17zpdPVJT2Y+vC2qWvlaxvxMtHruqDAdl++p2mLbhKuMKDga5sZAQWi6H24VV0IAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"109e14577dac41d9ac13b49ccb82935af53ab9f3341d0d54306d53038103c6b0","last_reissued_at":"2026-07-28T01:22:54.063660Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T01:22:54.063660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Optimize: Joint Routing and Flow Allocation on Sparse Non-Euclidean Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Congyuan Ji, Fang He, Haomiao Sun, Xindi Tang","submitted_at":"2026-07-26T05:30:27Z","abstract_excerpt":"We study an integrated pickup-and-delivery problem on sparse, non-Euclidean networks that jointly optimizes cyclic routing, cargo flow allocation, and cross-cycle service. The tight coupling of these operational constraints creates a complex discrete-continuous decision space with highly restricted feasible regions. To overcome these computational challenges, we propose Double-Channel Graph Attention (DCGA), an end-to-end reinforcement learning framework. DCGA isolates network reachability and demand-service logic into separate graph channels and constructs valid routes using a simulator-coupl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.23467","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/2607.23467/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":"2607.23467","created_at":"2026-07-28T01:22:54.064066+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.23467v1","created_at":"2026-07-28T01:22:54.064066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.23467","created_at":"2026-07-28T01:22:54.064066+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCPBIV35VRA5","created_at":"2026-07-28T01:22:54.064066+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCPBIV35VRA5TLAT","created_at":"2026-07-28T01:22:54.064066+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCPBIV35","created_at":"2026-07-28T01:22:54.064066+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/CCPBIV35VRA5TLATWSOMXAUTLL","json":"https://pith.science/pith/CCPBIV35VRA5TLATWSOMXAUTLL.json","graph_json":"https://pith.science/api/pith-number/CCPBIV35VRA5TLATWSOMXAUTLL/graph.json","events_json":"https://pith.science/api/pith-number/CCPBIV35VRA5TLATWSOMXAUTLL/events.json","paper":"https://pith.science/paper/CCPBIV35"},"agent_actions":{"view_html":"https://pith.science/pith/CCPBIV35VRA5TLATWSOMXAUTLL","download_json":"https://pith.science/pith/CCPBIV35VRA5TLATWSOMXAUTLL.json","view_paper":"https://pith.science/paper/CCPBIV35","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.23467&json=true","fetch_graph":"https://pith.science/api/pith-number/CCPBIV35VRA5TLATWSOMXAUTLL/graph.json","fetch_events":"https://pith.science/api/pith-number/CCPBIV35VRA5TLATWSOMXAUTLL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCPBIV35VRA5TLATWSOMXAUTLL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCPBIV35VRA5TLATWSOMXAUTLL/action/storage_attestation","attest_author":"https://pith.science/pith/CCPBIV35VRA5TLATWSOMXAUTLL/action/author_attestation","sign_citation":"https://pith.science/pith/CCPBIV35VRA5TLATWSOMXAUTLL/action/citation_signature","submit_replication":"https://pith.science/pith/CCPBIV35VRA5TLATWSOMXAUTLL/action/replication_record"}},"created_at":"2026-07-28T01:22:54.064066+00:00","updated_at":"2026-07-28T01:22:54.064066+00:00"}