{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:XCQHBLZTC4SDWNT4RBEZY6GIYH","short_pith_number":"pith:XCQHBLZT","canonical_record":{"source":{"id":"2108.03713","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-08-08T19:12:04Z","cross_cats_sorted":[],"title_canon_sha256":"b3ce70617f8f81b15fd2bf6a5c2c712d09138410957e57dfa1652b25e566bd0f","abstract_canon_sha256":"28ffec0199a879e6ae509e061f3dc041afa7a0f13c150b3a6ebeb9181803bc65"},"schema_version":"1.0"},"canonical_sha256":"b8a070af3317243b367c88499c78c8c1d1a474e9fd7f315037c79bd9fba17280","source":{"kind":"arxiv","id":"2108.03713","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.03713","created_at":"2026-07-05T03:04:08Z"},{"alias_kind":"arxiv_version","alias_value":"2108.03713v1","created_at":"2026-07-05T03:04:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.03713","created_at":"2026-07-05T03:04:08Z"},{"alias_kind":"pith_short_12","alias_value":"XCQHBLZTC4SD","created_at":"2026-07-05T03:04:08Z"},{"alias_kind":"pith_short_16","alias_value":"XCQHBLZTC4SDWNT4","created_at":"2026-07-05T03:04:08Z"},{"alias_kind":"pith_short_8","alias_value":"XCQHBLZT","created_at":"2026-07-05T03:04:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:XCQHBLZTC4SDWNT4RBEZY6GIYH","target":"record","payload":{"canonical_record":{"source":{"id":"2108.03713","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-08-08T19:12:04Z","cross_cats_sorted":[],"title_canon_sha256":"b3ce70617f8f81b15fd2bf6a5c2c712d09138410957e57dfa1652b25e566bd0f","abstract_canon_sha256":"28ffec0199a879e6ae509e061f3dc041afa7a0f13c150b3a6ebeb9181803bc65"},"schema_version":"1.0"},"canonical_sha256":"b8a070af3317243b367c88499c78c8c1d1a474e9fd7f315037c79bd9fba17280","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:04:08.724446Z","signature_b64":"Eoc3dHjRVi6booaSMQTdhGTsC5oiYnbHa6Btamr5ELrmiUsjCSP+T3iFdzZ/RiHwqgFYdTfhUQ5oeTqMj0dUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8a070af3317243b367c88499c78c8c1d1a474e9fd7f315037c79bd9fba17280","last_reissued_at":"2026-07-05T03:04:08.724038Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:04:08.724038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2108.03713","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-05T03:04:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ab+/IyDgpPZDz0FOCC1x5JSWdONo89yo2rdQdJtIs2WdysOl2Rkz+N1XYQVBAqQLrRvAVLCq89XjaVQDBwkaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T13:49:19.748787Z"},"content_sha256":"9aa44bcf55cb83ef58d6cfcf9abf4464cbcaef3242aadc08efd7e7519cd3b995","schema_version":"1.0","event_id":"sha256:9aa44bcf55cb83ef58d6cfcf9abf4464cbcaef3242aadc08efd7e7519cd3b995"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:XCQHBLZTC4SDWNT4RBEZY6GIYH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Difficulty of Generalizing Reinforcement Learning Framework for Combinatorial Optimization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Kui Wu, Mostafa Pashazadeh","submitted_at":"2021-08-08T19:12:04Z","abstract_excerpt":"Combinatorial optimization problems (COPs) on the graph with real-life applications are canonical challenges in Computer Science. The difficulty of finding quality labels for problem instances holds back leveraging supervised learning across combinatorial problems. Reinforcement learning (RL) algorithms have recently been adopted to solve this challenge automatically. The underlying principle of this approach is to deploy a graph neural network (GNN) for encoding both the local information of the nodes and the graph-structured data in order to capture the current state of the environment. Then"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.03713","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/2108.03713/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-05T03:04:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BBFzvgztBimqwS1KZjvQISY5h2aqfihnU2SP1ELEGFnMGVRKsCVnFGj59JzQyWLZydcCJnAXpBO2dDyPhCyfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T13:49:19.749365Z"},"content_sha256":"2c16b2f0f92c27899766d23e16cf8de5dffcfcfb0cebbd7574299ec39f1a4d7f","schema_version":"1.0","event_id":"sha256:2c16b2f0f92c27899766d23e16cf8de5dffcfcfb0cebbd7574299ec39f1a4d7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCQHBLZTC4SDWNT4RBEZY6GIYH/bundle.json","state_url":"https://pith.science/pith/XCQHBLZTC4SDWNT4RBEZY6GIYH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCQHBLZTC4SDWNT4RBEZY6GIYH/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-04T13:49:19Z","links":{"resolver":"https://pith.science/pith/XCQHBLZTC4SDWNT4RBEZY6GIYH","bundle":"https://pith.science/pith/XCQHBLZTC4SDWNT4RBEZY6GIYH/bundle.json","state":"https://pith.science/pith/XCQHBLZTC4SDWNT4RBEZY6GIYH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCQHBLZTC4SDWNT4RBEZY6GIYH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:XCQHBLZTC4SDWNT4RBEZY6GIYH","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":"28ffec0199a879e6ae509e061f3dc041afa7a0f13c150b3a6ebeb9181803bc65","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-08-08T19:12:04Z","title_canon_sha256":"b3ce70617f8f81b15fd2bf6a5c2c712d09138410957e57dfa1652b25e566bd0f"},"schema_version":"1.0","source":{"id":"2108.03713","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.03713","created_at":"2026-07-05T03:04:08Z"},{"alias_kind":"arxiv_version","alias_value":"2108.03713v1","created_at":"2026-07-05T03:04:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.03713","created_at":"2026-07-05T03:04:08Z"},{"alias_kind":"pith_short_12","alias_value":"XCQHBLZTC4SD","created_at":"2026-07-05T03:04:08Z"},{"alias_kind":"pith_short_16","alias_value":"XCQHBLZTC4SDWNT4","created_at":"2026-07-05T03:04:08Z"},{"alias_kind":"pith_short_8","alias_value":"XCQHBLZT","created_at":"2026-07-05T03:04:08Z"}],"graph_snapshots":[{"event_id":"sha256:2c16b2f0f92c27899766d23e16cf8de5dffcfcfb0cebbd7574299ec39f1a4d7f","target":"graph","created_at":"2026-07-05T03:04:08Z","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/2108.03713/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Combinatorial optimization problems (COPs) on the graph with real-life applications are canonical challenges in Computer Science. The difficulty of finding quality labels for problem instances holds back leveraging supervised learning across combinatorial problems. Reinforcement learning (RL) algorithms have recently been adopted to solve this challenge automatically. The underlying principle of this approach is to deploy a graph neural network (GNN) for encoding both the local information of the nodes and the graph-structured data in order to capture the current state of the environment. Then","authors_text":"Kui Wu, Mostafa Pashazadeh","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-08-08T19:12:04Z","title":"On the Difficulty of Generalizing Reinforcement Learning Framework for Combinatorial Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.03713","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:9aa44bcf55cb83ef58d6cfcf9abf4464cbcaef3242aadc08efd7e7519cd3b995","target":"record","created_at":"2026-07-05T03:04:08Z","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":"28ffec0199a879e6ae509e061f3dc041afa7a0f13c150b3a6ebeb9181803bc65","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-08-08T19:12:04Z","title_canon_sha256":"b3ce70617f8f81b15fd2bf6a5c2c712d09138410957e57dfa1652b25e566bd0f"},"schema_version":"1.0","source":{"id":"2108.03713","kind":"arxiv","version":1}},"canonical_sha256":"b8a070af3317243b367c88499c78c8c1d1a474e9fd7f315037c79bd9fba17280","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8a070af3317243b367c88499c78c8c1d1a474e9fd7f315037c79bd9fba17280","first_computed_at":"2026-07-05T03:04:08.724038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:04:08.724038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Eoc3dHjRVi6booaSMQTdhGTsC5oiYnbHa6Btamr5ELrmiUsjCSP+T3iFdzZ/RiHwqgFYdTfhUQ5oeTqMj0dUCw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:04:08.724446Z","signed_message":"canonical_sha256_bytes"},"source_id":"2108.03713","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9aa44bcf55cb83ef58d6cfcf9abf4464cbcaef3242aadc08efd7e7519cd3b995","sha256:2c16b2f0f92c27899766d23e16cf8de5dffcfcfb0cebbd7574299ec39f1a4d7f"],"state_sha256":"cc01c9454475dc6e9a5d003abd19b114aaf61052eaf8ddec379989c7971c295e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1cRCIbXCs9kTneNU3F/OvsypUcIoSVz/mvGYW1g9z5vduRcT+H2SI/1ok1iUQHx7eHtkgCRCFslgkES+h03yCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T13:49:19.779489Z","bundle_sha256":"08c06d675b27e7f83dc956daa5c1a742b19fd0592d54cb2e1345d4c515aabeb7"}}