{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6GVSXTDRH4CCATUEFRFPEC67QO","short_pith_number":"pith:6GVSXTDR","canonical_record":{"source":{"id":"1810.10659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-25T00:12:44Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"962dbf150c78a9ea2c3736e490078abaaba600f0a88b16a6de66c85bef5e0ca0","abstract_canon_sha256":"1c68ba2395801cbbac4473dcafe357f141a15254ef14c35270f071920f1d5537"},"schema_version":"1.0"},"canonical_sha256":"f1ab2bcc713f04204e842c4af20bdf83a3dc996b05f6891adae0e871009bb518","source":{"kind":"arxiv","id":"1810.10659","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10659","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10659v1","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10659","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"6GVSXTDRH4CC","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6GVSXTDRH4CCATUE","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6GVSXTDR","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6GVSXTDRH4CCATUEFRFPEC67QO","target":"record","payload":{"canonical_record":{"source":{"id":"1810.10659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-25T00:12:44Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"962dbf150c78a9ea2c3736e490078abaaba600f0a88b16a6de66c85bef5e0ca0","abstract_canon_sha256":"1c68ba2395801cbbac4473dcafe357f141a15254ef14c35270f071920f1d5537"},"schema_version":"1.0"},"canonical_sha256":"f1ab2bcc713f04204e842c4af20bdf83a3dc996b05f6891adae0e871009bb518","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:19.972803Z","signature_b64":"9JKWBPq/GJBPcr7gJk1HTfsC7fka+60sGrD2rTFh0027wwxcMekc1igYBV2iSADCq2VxwBB4r56jgPH6myqFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1ab2bcc713f04204e842c4af20bdf83a3dc996b05f6891adae0e871009bb518","last_reissued_at":"2026-05-18T00:02:19.972332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:19.972332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.10659","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-05-18T00:02:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AqUxOWf7Bhg8REhsauqdYhOwbkXqPJxxLbSQLDXw/r6FTC6m8h5vs5X2teb0WHFfGsAKaeBwpf2MTpNCkzkCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T01:03:06.848368Z"},"content_sha256":"97fcb8bd42415ee35cc1fcbab4e993c3da1be58b29ea19c96740a53be45defbc","schema_version":"1.0","event_id":"sha256:97fcb8bd42415ee35cc1fcbab4e993c3da1be58b29ea19c96740a53be45defbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6GVSXTDRH4CCATUEFRFPEC67QO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Qifeng Chen, Vladlen Koltun, Zhuwen Li","submitted_at":"2018-10-25T00:12:44Z","abstract_excerpt":"We present a learning-based approach to computing solutions for certain NP-hard problems. Our approach combines deep learning techniques with useful algorithmic elements from classic heuristics. The central component is a graph convolutional network that is trained to estimate the likelihood, for each vertex in a graph, of whether this vertex is part of the optimal solution. The network is designed and trained to synthesize a diverse set of solutions, which enables rapid exploration of the solution space via tree search. The presented approach is evaluated on four canonical NP-hard problems an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10659","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":""},"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-05-18T00:02:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2uYUcg5zLrYuzgxVB9nEcqYvBhKZ7zrBYhCTPw4a8u8UIHxhI66NJDHUYlJ1cbqA0ABSiTJmRe4Qxj8u/PrjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T01:03:06.848844Z"},"content_sha256":"f7b9ec3bc0bfca45ec7083bd4ec8cde8e9289531d285fe1bb7c7f170c89ed765","schema_version":"1.0","event_id":"sha256:f7b9ec3bc0bfca45ec7083bd4ec8cde8e9289531d285fe1bb7c7f170c89ed765"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6GVSXTDRH4CCATUEFRFPEC67QO/bundle.json","state_url":"https://pith.science/pith/6GVSXTDRH4CCATUEFRFPEC67QO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6GVSXTDRH4CCATUEFRFPEC67QO/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-09T01:03:06Z","links":{"resolver":"https://pith.science/pith/6GVSXTDRH4CCATUEFRFPEC67QO","bundle":"https://pith.science/pith/6GVSXTDRH4CCATUEFRFPEC67QO/bundle.json","state":"https://pith.science/pith/6GVSXTDRH4CCATUEFRFPEC67QO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6GVSXTDRH4CCATUEFRFPEC67QO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6GVSXTDRH4CCATUEFRFPEC67QO","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":"1c68ba2395801cbbac4473dcafe357f141a15254ef14c35270f071920f1d5537","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-25T00:12:44Z","title_canon_sha256":"962dbf150c78a9ea2c3736e490078abaaba600f0a88b16a6de66c85bef5e0ca0"},"schema_version":"1.0","source":{"id":"1810.10659","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10659","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10659v1","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10659","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"6GVSXTDRH4CC","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6GVSXTDRH4CCATUE","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6GVSXTDR","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:f7b9ec3bc0bfca45ec7083bd4ec8cde8e9289531d285fe1bb7c7f170c89ed765","target":"graph","created_at":"2026-05-18T00:02:19Z","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"},"paper":{"abstract_excerpt":"We present a learning-based approach to computing solutions for certain NP-hard problems. Our approach combines deep learning techniques with useful algorithmic elements from classic heuristics. The central component is a graph convolutional network that is trained to estimate the likelihood, for each vertex in a graph, of whether this vertex is part of the optimal solution. The network is designed and trained to synthesize a diverse set of solutions, which enables rapid exploration of the solution space via tree search. The presented approach is evaluated on four canonical NP-hard problems an","authors_text":"Qifeng Chen, Vladlen Koltun, Zhuwen Li","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-25T00:12:44Z","title":"Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10659","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:97fcb8bd42415ee35cc1fcbab4e993c3da1be58b29ea19c96740a53be45defbc","target":"record","created_at":"2026-05-18T00:02:19Z","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":"1c68ba2395801cbbac4473dcafe357f141a15254ef14c35270f071920f1d5537","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-25T00:12:44Z","title_canon_sha256":"962dbf150c78a9ea2c3736e490078abaaba600f0a88b16a6de66c85bef5e0ca0"},"schema_version":"1.0","source":{"id":"1810.10659","kind":"arxiv","version":1}},"canonical_sha256":"f1ab2bcc713f04204e842c4af20bdf83a3dc996b05f6891adae0e871009bb518","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1ab2bcc713f04204e842c4af20bdf83a3dc996b05f6891adae0e871009bb518","first_computed_at":"2026-05-18T00:02:19.972332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:19.972332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9JKWBPq/GJBPcr7gJk1HTfsC7fka+60sGrD2rTFh0027wwxcMekc1igYBV2iSADCq2VxwBB4r56jgPH6myqFCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:19.972803Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10659","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97fcb8bd42415ee35cc1fcbab4e993c3da1be58b29ea19c96740a53be45defbc","sha256:f7b9ec3bc0bfca45ec7083bd4ec8cde8e9289531d285fe1bb7c7f170c89ed765"],"state_sha256":"8d0c961953564c9d631d3291fcdf6d27a4699eb77b0344929ffd2da1a5406e17"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C0S4zCCpS4uJ8XoabDLU6hbmhfDg7wisbR04h0V5GXn4NncGuPifQlvu/4zP8FpinmH0JKbYrufrjwDvA2RHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T01:03:06.853759Z","bundle_sha256":"4d15e1dfb564ca8f56bc2359c858edaf64f2c050e715b160cbabe5b4d92c8ea9"}}