{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3GAHUVCLTNNBH7UFWBHVVVE5ZQ","short_pith_number":"pith:3GAHUVCL","canonical_record":{"source":{"id":"1911.04936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-12T15:39:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"be08fd6e2f82008a3c7dcf6d23b3a17b6e16e621ac5acf9caf523ac6ac8c9898","abstract_canon_sha256":"028335e9ea849f5c8e935e3901a54d7f056f4ea5764c9d81b2ce5e82f03d6bfd"},"schema_version":"1.0"},"canonical_sha256":"d9807a544b9b5a13fe85b04f5ad49dcc1f24e002ec04b6d58c8c75ff82d73cd7","source":{"kind":"arxiv","id":"1911.04936","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.04936","created_at":"2026-07-05T00:18:46Z"},{"alias_kind":"arxiv_version","alias_value":"1911.04936v1","created_at":"2026-07-05T00:18:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.04936","created_at":"2026-07-05T00:18:46Z"},{"alias_kind":"pith_short_12","alias_value":"3GAHUVCLTNNB","created_at":"2026-07-05T00:18:46Z"},{"alias_kind":"pith_short_16","alias_value":"3GAHUVCLTNNBH7UF","created_at":"2026-07-05T00:18:46Z"},{"alias_kind":"pith_short_8","alias_value":"3GAHUVCL","created_at":"2026-07-05T00:18:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3GAHUVCLTNNBH7UFWBHVVVE5ZQ","target":"record","payload":{"canonical_record":{"source":{"id":"1911.04936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-12T15:39:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"be08fd6e2f82008a3c7dcf6d23b3a17b6e16e621ac5acf9caf523ac6ac8c9898","abstract_canon_sha256":"028335e9ea849f5c8e935e3901a54d7f056f4ea5764c9d81b2ce5e82f03d6bfd"},"schema_version":"1.0"},"canonical_sha256":"d9807a544b9b5a13fe85b04f5ad49dcc1f24e002ec04b6d58c8c75ff82d73cd7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:18:46.334981Z","signature_b64":"4RL6C2wVECKYrQUAmx8kxAwcawkMR966fnibhAwzDbW7PMlFphiReYvMzQUL9VonAHblB7OE6M/uSXucngSiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9807a544b9b5a13fe85b04f5ad49dcc1f24e002ec04b6d58c8c75ff82d73cd7","last_reissued_at":"2026-07-05T00:18:46.334525Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:18:46.334525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.04936","source_version":1,"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-05T00:18:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gSormZeiUnhX5LtParq+gDDH/Wxh8G1CA+21TLFp4+4oicHI55DUhGdYp9/fuctlj2LCiWQ9p1SWQ+3u9vlYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:28:09.605613Z"},"content_sha256":"51522372c9622623c3ef76613fbee241995d43aa40282ad90ea3811aaff56f09","schema_version":"1.0","event_id":"sha256:51522372c9622623c3ef76613fbee241995d43aa40282ad90ea3811aaff56f09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3GAHUVCLTNNBH7UFWBHVVVE5ZQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Danyang He, Darshan Thaker, Iddo Drori, Qiang Ma, Suwen Ge","submitted_at":"2019-11-12T15:39:21Z","abstract_excerpt":"In this work, we introduce Graph Pointer Networks (GPNs) trained using reinforcement learning (RL) for tackling the traveling salesman problem (TSP). GPNs build upon Pointer Networks by introducing a graph embedding layer on the input, which captures relationships between nodes. Furthermore, to approximate solutions to constrained combinatorial optimization problems such as the TSP with time windows, we train hierarchical GPNs (HGPNs) using RL, which learns a hierarchical policy to find an optimal city permutation under constraints. Each layer of the hierarchy is designed with a separate rewar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.04936","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/1911.04936/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-05T00:18:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0DKaF9NSn5z97MskaQvo341bRcInuRMvnRiq4Q3rqzURoiTsXbaHGYEygMdkaVltIHoyX+1Qiq4/4TusYK3fAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:28:09.606118Z"},"content_sha256":"85bc91ae90e03591b63140216771aa08ae259781759e1a726ecdebcbdb8c2e2f","schema_version":"1.0","event_id":"sha256:85bc91ae90e03591b63140216771aa08ae259781759e1a726ecdebcbdb8c2e2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GAHUVCLTNNBH7UFWBHVVVE5ZQ/bundle.json","state_url":"https://pith.science/pith/3GAHUVCLTNNBH7UFWBHVVVE5ZQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GAHUVCLTNNBH7UFWBHVVVE5ZQ/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-04T19:28:09Z","links":{"resolver":"https://pith.science/pith/3GAHUVCLTNNBH7UFWBHVVVE5ZQ","bundle":"https://pith.science/pith/3GAHUVCLTNNBH7UFWBHVVVE5ZQ/bundle.json","state":"https://pith.science/pith/3GAHUVCLTNNBH7UFWBHVVVE5ZQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GAHUVCLTNNBH7UFWBHVVVE5ZQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3GAHUVCLTNNBH7UFWBHVVVE5ZQ","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":"028335e9ea849f5c8e935e3901a54d7f056f4ea5764c9d81b2ce5e82f03d6bfd","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-12T15:39:21Z","title_canon_sha256":"be08fd6e2f82008a3c7dcf6d23b3a17b6e16e621ac5acf9caf523ac6ac8c9898"},"schema_version":"1.0","source":{"id":"1911.04936","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.04936","created_at":"2026-07-05T00:18:46Z"},{"alias_kind":"arxiv_version","alias_value":"1911.04936v1","created_at":"2026-07-05T00:18:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.04936","created_at":"2026-07-05T00:18:46Z"},{"alias_kind":"pith_short_12","alias_value":"3GAHUVCLTNNB","created_at":"2026-07-05T00:18:46Z"},{"alias_kind":"pith_short_16","alias_value":"3GAHUVCLTNNBH7UF","created_at":"2026-07-05T00:18:46Z"},{"alias_kind":"pith_short_8","alias_value":"3GAHUVCL","created_at":"2026-07-05T00:18:46Z"}],"graph_snapshots":[{"event_id":"sha256:85bc91ae90e03591b63140216771aa08ae259781759e1a726ecdebcbdb8c2e2f","target":"graph","created_at":"2026-07-05T00:18:46Z","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/1911.04936/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we introduce Graph Pointer Networks (GPNs) trained using reinforcement learning (RL) for tackling the traveling salesman problem (TSP). GPNs build upon Pointer Networks by introducing a graph embedding layer on the input, which captures relationships between nodes. Furthermore, to approximate solutions to constrained combinatorial optimization problems such as the TSP with time windows, we train hierarchical GPNs (HGPNs) using RL, which learns a hierarchical policy to find an optimal city permutation under constraints. Each layer of the hierarchy is designed with a separate rewar","authors_text":"Danyang He, Darshan Thaker, Iddo Drori, Qiang Ma, Suwen Ge","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-12T15:39:21Z","title":"Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.04936","kind":"arxiv","version":1},"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:51522372c9622623c3ef76613fbee241995d43aa40282ad90ea3811aaff56f09","target":"record","created_at":"2026-07-05T00:18:46Z","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":"028335e9ea849f5c8e935e3901a54d7f056f4ea5764c9d81b2ce5e82f03d6bfd","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-12T15:39:21Z","title_canon_sha256":"be08fd6e2f82008a3c7dcf6d23b3a17b6e16e621ac5acf9caf523ac6ac8c9898"},"schema_version":"1.0","source":{"id":"1911.04936","kind":"arxiv","version":1}},"canonical_sha256":"d9807a544b9b5a13fe85b04f5ad49dcc1f24e002ec04b6d58c8c75ff82d73cd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9807a544b9b5a13fe85b04f5ad49dcc1f24e002ec04b6d58c8c75ff82d73cd7","first_computed_at":"2026-07-05T00:18:46.334525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:18:46.334525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4RL6C2wVECKYrQUAmx8kxAwcawkMR966fnibhAwzDbW7PMlFphiReYvMzQUL9VonAHblB7OE6M/uSXucngSiDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:18:46.334981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.04936","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51522372c9622623c3ef76613fbee241995d43aa40282ad90ea3811aaff56f09","sha256:85bc91ae90e03591b63140216771aa08ae259781759e1a726ecdebcbdb8c2e2f"],"state_sha256":"fef2d944d9cd39c2a40fe1e87af5214aeaa6c68e88c8df4fe91713e2e47b200c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7p195rxHps5iYm6gAiXLRXgzFlX1QJxw1mtwHQ/gUi1bMRv5UBZV40YZ5WEc4pXjzJq+E8pt+8EoDc3hSmHqAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T19:28:09.609706Z","bundle_sha256":"a7eaceddb3a3f1cbb241efab87fff327041600d43a689259558dd4e6d1a9fbb0"}}