{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:WXHBR7D2YYHFO7CG6D6BONTLBM","short_pith_number":"pith:WXHBR7D2","canonical_record":{"source":{"id":"2207.01411","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-04T13:46:59Z","cross_cats_sorted":[],"title_canon_sha256":"80f777d961a2fa2597d89e2a1fe36d43edb2e6ba80fd0d73bd038b528d2ae6d7","abstract_canon_sha256":"8b65979d51fa435d9edeec464ef76bf9f6c2d5c2f2e58a482a3256802c34b647"},"schema_version":"1.0"},"canonical_sha256":"b5ce18fc7ac60e577c46f0fc17366b0b37248e4e757bc8188a1fe0b4c08fdc20","source":{"kind":"arxiv","id":"2207.01411","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.01411","created_at":"2026-07-05T04:39:40Z"},{"alias_kind":"arxiv_version","alias_value":"2207.01411v2","created_at":"2026-07-05T04:39:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.01411","created_at":"2026-07-05T04:39:40Z"},{"alias_kind":"pith_short_12","alias_value":"WXHBR7D2YYHF","created_at":"2026-07-05T04:39:40Z"},{"alias_kind":"pith_short_16","alias_value":"WXHBR7D2YYHFO7CG","created_at":"2026-07-05T04:39:40Z"},{"alias_kind":"pith_short_8","alias_value":"WXHBR7D2","created_at":"2026-07-05T04:39:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:WXHBR7D2YYHFO7CG6D6BONTLBM","target":"record","payload":{"canonical_record":{"source":{"id":"2207.01411","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-04T13:46:59Z","cross_cats_sorted":[],"title_canon_sha256":"80f777d961a2fa2597d89e2a1fe36d43edb2e6ba80fd0d73bd038b528d2ae6d7","abstract_canon_sha256":"8b65979d51fa435d9edeec464ef76bf9f6c2d5c2f2e58a482a3256802c34b647"},"schema_version":"1.0"},"canonical_sha256":"b5ce18fc7ac60e577c46f0fc17366b0b37248e4e757bc8188a1fe0b4c08fdc20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:39:40.080600Z","signature_b64":"kRuKdbEeBWoatwtiZ3bPwaiC0mDjceRu3di4n8duCXzeMPHH1SfLdzp5cItFpJ3OxX+n/U8j5jXR1k0WH5LJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5ce18fc7ac60e577c46f0fc17366b0b37248e4e757bc8188a1fe0b4c08fdc20","last_reissued_at":"2026-07-05T04:39:40.080265Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:39:40.080265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.01411","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-05T04:39:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/JmQXTwPeXqmeKRwQVZu4FMOETwhxZPDsNtWmkgD2XKik25E2Exe5DXgju0dpBhD0EGz3YsJKmRCNsfT8fGYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:05:10.466790Z"},"content_sha256":"cf98ce42d06845d8b0f6f4664bab40a110185cfccf6b2fcfa4188176c44b1127","schema_version":"1.0","event_id":"sha256:cf98ce42d06845d8b0f6f4664bab40a110185cfccf6b2fcfa4188176c44b1127"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:WXHBR7D2YYHFO7CG6D6BONTLBM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Neural-Prediction based Acceleration Algorithm of Column Generation for Graph-Based Set Covering Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Haofeng Yuan, Peng Jiang, Shiji Song","submitted_at":"2022-07-04T13:46:59Z","abstract_excerpt":"Set covering problem is an important class of combinatorial optimization problems, which has been widely applied and studied in many fields. In this paper, we propose an improved column generation algorithm with neural prediction (CG-P) for solving graph-based set covering problems. We leverage a graph neural network based neural prediction model to predict the probability to be included in the final solution for each edge. Our CG-P algorithm constructs a reduced graph that only contains the edges with higher predicted probability, and this graph reduction process significantly speeds up the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.01411","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/2207.01411/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-05T04:39:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vyNsDAg+YUfPLpxBXQoXHe+iaLDweePTDyQAI86gMLgRvVoNMY0uKGBcVDnhQej+ViadArmFc/UtihgXnkIMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:05:10.467397Z"},"content_sha256":"c66510a907ee473d3fe37099b715c656bfc7f1963bb05393566fef550cd12b3f","schema_version":"1.0","event_id":"sha256:c66510a907ee473d3fe37099b715c656bfc7f1963bb05393566fef550cd12b3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WXHBR7D2YYHFO7CG6D6BONTLBM/bundle.json","state_url":"https://pith.science/pith/WXHBR7D2YYHFO7CG6D6BONTLBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WXHBR7D2YYHFO7CG6D6BONTLBM/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-07T01:05:10Z","links":{"resolver":"https://pith.science/pith/WXHBR7D2YYHFO7CG6D6BONTLBM","bundle":"https://pith.science/pith/WXHBR7D2YYHFO7CG6D6BONTLBM/bundle.json","state":"https://pith.science/pith/WXHBR7D2YYHFO7CG6D6BONTLBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WXHBR7D2YYHFO7CG6D6BONTLBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:WXHBR7D2YYHFO7CG6D6BONTLBM","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":"8b65979d51fa435d9edeec464ef76bf9f6c2d5c2f2e58a482a3256802c34b647","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-04T13:46:59Z","title_canon_sha256":"80f777d961a2fa2597d89e2a1fe36d43edb2e6ba80fd0d73bd038b528d2ae6d7"},"schema_version":"1.0","source":{"id":"2207.01411","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.01411","created_at":"2026-07-05T04:39:40Z"},{"alias_kind":"arxiv_version","alias_value":"2207.01411v2","created_at":"2026-07-05T04:39:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.01411","created_at":"2026-07-05T04:39:40Z"},{"alias_kind":"pith_short_12","alias_value":"WXHBR7D2YYHF","created_at":"2026-07-05T04:39:40Z"},{"alias_kind":"pith_short_16","alias_value":"WXHBR7D2YYHFO7CG","created_at":"2026-07-05T04:39:40Z"},{"alias_kind":"pith_short_8","alias_value":"WXHBR7D2","created_at":"2026-07-05T04:39:40Z"}],"graph_snapshots":[{"event_id":"sha256:c66510a907ee473d3fe37099b715c656bfc7f1963bb05393566fef550cd12b3f","target":"graph","created_at":"2026-07-05T04:39:40Z","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/2207.01411/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Set covering problem is an important class of combinatorial optimization problems, which has been widely applied and studied in many fields. In this paper, we propose an improved column generation algorithm with neural prediction (CG-P) for solving graph-based set covering problems. We leverage a graph neural network based neural prediction model to predict the probability to be included in the final solution for each edge. Our CG-P algorithm constructs a reduced graph that only contains the edges with higher predicted probability, and this graph reduction process significantly speeds up the s","authors_text":"Haofeng Yuan, Peng Jiang, Shiji Song","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-04T13:46:59Z","title":"The Neural-Prediction based Acceleration Algorithm of Column Generation for Graph-Based Set Covering Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.01411","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:cf98ce42d06845d8b0f6f4664bab40a110185cfccf6b2fcfa4188176c44b1127","target":"record","created_at":"2026-07-05T04:39:40Z","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":"8b65979d51fa435d9edeec464ef76bf9f6c2d5c2f2e58a482a3256802c34b647","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-04T13:46:59Z","title_canon_sha256":"80f777d961a2fa2597d89e2a1fe36d43edb2e6ba80fd0d73bd038b528d2ae6d7"},"schema_version":"1.0","source":{"id":"2207.01411","kind":"arxiv","version":2}},"canonical_sha256":"b5ce18fc7ac60e577c46f0fc17366b0b37248e4e757bc8188a1fe0b4c08fdc20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5ce18fc7ac60e577c46f0fc17366b0b37248e4e757bc8188a1fe0b4c08fdc20","first_computed_at":"2026-07-05T04:39:40.080265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:39:40.080265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kRuKdbEeBWoatwtiZ3bPwaiC0mDjceRu3di4n8duCXzeMPHH1SfLdzp5cItFpJ3OxX+n/U8j5jXR1k0WH5LJBw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:39:40.080600Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.01411","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf98ce42d06845d8b0f6f4664bab40a110185cfccf6b2fcfa4188176c44b1127","sha256:c66510a907ee473d3fe37099b715c656bfc7f1963bb05393566fef550cd12b3f"],"state_sha256":"9e6defc94e6863e2b52ca43dc677da659c6470a6dd86e8675f02419bbb73411d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lMAAB5hSyIdeOkRykIUADSadkXAKiGgp8m3jXBBrhZLFV0E2DjVFbeHZ8PBjP7mUBtWj7F8s/D+DRB6Cv5puBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T01:05:10.472584Z","bundle_sha256":"c2e3263fbac796cb8916ab816c2c0c52f3f5e4d6de9b075c4134675930ef8fb0"}}