{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:L2JYMOLTQCED6YQYZJSASW6OXO","short_pith_number":"pith:L2JYMOLT","canonical_record":{"source":{"id":"2302.08224","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-16T11:13:36Z","cross_cats_sorted":[],"title_canon_sha256":"2c26c71d35d5edbc466135c88a1eba327db137911f5d54be40d9f47ad87964ac","abstract_canon_sha256":"1ce93cdfa2b972a147dbe6322f58dd5c27b2eaa96d8aa770352871df72fd8a24"},"schema_version":"1.0"},"canonical_sha256":"5e9386397380883f6218ca64095bcebbb215b320f569436a4d3e592017ecff0f","source":{"kind":"arxiv","id":"2302.08224","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.08224","created_at":"2026-07-05T07:19:18Z"},{"alias_kind":"arxiv_version","alias_value":"2302.08224v2","created_at":"2026-07-05T07:19:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.08224","created_at":"2026-07-05T07:19:18Z"},{"alias_kind":"pith_short_12","alias_value":"L2JYMOLTQCED","created_at":"2026-07-05T07:19:18Z"},{"alias_kind":"pith_short_16","alias_value":"L2JYMOLTQCED6YQY","created_at":"2026-07-05T07:19:18Z"},{"alias_kind":"pith_short_8","alias_value":"L2JYMOLT","created_at":"2026-07-05T07:19:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:L2JYMOLTQCED6YQYZJSASW6OXO","target":"record","payload":{"canonical_record":{"source":{"id":"2302.08224","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-16T11:13:36Z","cross_cats_sorted":[],"title_canon_sha256":"2c26c71d35d5edbc466135c88a1eba327db137911f5d54be40d9f47ad87964ac","abstract_canon_sha256":"1ce93cdfa2b972a147dbe6322f58dd5c27b2eaa96d8aa770352871df72fd8a24"},"schema_version":"1.0"},"canonical_sha256":"5e9386397380883f6218ca64095bcebbb215b320f569436a4d3e592017ecff0f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:19:18.540798Z","signature_b64":"1NccDbEE/TnUZk583FgeD6CE/fy5FDAdRTyEacaH01uz0IoQeO5gx8fMr5C5yIIQl9OOrV5tCGg75PHS31CoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e9386397380883f6218ca64095bcebbb215b320f569436a4d3e592017ecff0f","last_reissued_at":"2026-07-05T07:19:18.540245Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:19:18.540245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.08224","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-05T07:19:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yr4joWSWBqgBDMaQ7AxzesWtRqCQcbrnh8C78XmqzKsjz6q72xjMkSB4UNb+4wOLrIG3Kcp/neUVl93c0wBqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T13:17:24.995384Z"},"content_sha256":"fa6764a2dca911c143d39116814af57b7f90b43f5e70c80ee21958539b7cc0cf","schema_version":"1.0","event_id":"sha256:fa6764a2dca911c143d39116814af57b7f90b43f5e70c80ee21958539b7cc0cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:L2JYMOLTQCED6YQYZJSASW6OXO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Yiming Yang, Zhiqing Sun","submitted_at":"2023-02-16T11:13:36Z","abstract_excerpt":"Neural network-based Combinatorial Optimization (CO) methods have shown promising results in solving various NP-complete (NPC) problems without relying on hand-crafted domain knowledge. This paper broadens the current scope of neural solvers for NPC problems by introducing a new graph-based diffusion framework, namely DIFUSCO. Our framework casts NPC problems as discrete {0, 1}-vector optimization problems and leverages graph-based denoising diffusion models to generate high-quality solutions. We investigate two types of diffusion models with Gaussian and Bernoulli noise, respectively, and dev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.08224","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/2302.08224/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-05T07:19:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7gzvrxIrv89RvPn5+T/QPsHFzna+ULPHgx1dKcoseI97+ZJUo6YI7jJjn2D1J9GmEvHbtR3wId9gC6h6E7v8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T13:17:24.996368Z"},"content_sha256":"3bad959f834b9c8afba8f15034abae6477a8981fe210184ec6a8133b29c2e770","schema_version":"1.0","event_id":"sha256:3bad959f834b9c8afba8f15034abae6477a8981fe210184ec6a8133b29c2e770"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L2JYMOLTQCED6YQYZJSASW6OXO/bundle.json","state_url":"https://pith.science/pith/L2JYMOLTQCED6YQYZJSASW6OXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L2JYMOLTQCED6YQYZJSASW6OXO/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-10T13:17:24Z","links":{"resolver":"https://pith.science/pith/L2JYMOLTQCED6YQYZJSASW6OXO","bundle":"https://pith.science/pith/L2JYMOLTQCED6YQYZJSASW6OXO/bundle.json","state":"https://pith.science/pith/L2JYMOLTQCED6YQYZJSASW6OXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L2JYMOLTQCED6YQYZJSASW6OXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:L2JYMOLTQCED6YQYZJSASW6OXO","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":"1ce93cdfa2b972a147dbe6322f58dd5c27b2eaa96d8aa770352871df72fd8a24","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-16T11:13:36Z","title_canon_sha256":"2c26c71d35d5edbc466135c88a1eba327db137911f5d54be40d9f47ad87964ac"},"schema_version":"1.0","source":{"id":"2302.08224","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.08224","created_at":"2026-07-05T07:19:18Z"},{"alias_kind":"arxiv_version","alias_value":"2302.08224v2","created_at":"2026-07-05T07:19:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.08224","created_at":"2026-07-05T07:19:18Z"},{"alias_kind":"pith_short_12","alias_value":"L2JYMOLTQCED","created_at":"2026-07-05T07:19:18Z"},{"alias_kind":"pith_short_16","alias_value":"L2JYMOLTQCED6YQY","created_at":"2026-07-05T07:19:18Z"},{"alias_kind":"pith_short_8","alias_value":"L2JYMOLT","created_at":"2026-07-05T07:19:18Z"}],"graph_snapshots":[{"event_id":"sha256:3bad959f834b9c8afba8f15034abae6477a8981fe210184ec6a8133b29c2e770","target":"graph","created_at":"2026-07-05T07:19:18Z","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/2302.08224/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Neural network-based Combinatorial Optimization (CO) methods have shown promising results in solving various NP-complete (NPC) problems without relying on hand-crafted domain knowledge. This paper broadens the current scope of neural solvers for NPC problems by introducing a new graph-based diffusion framework, namely DIFUSCO. Our framework casts NPC problems as discrete {0, 1}-vector optimization problems and leverages graph-based denoising diffusion models to generate high-quality solutions. We investigate two types of diffusion models with Gaussian and Bernoulli noise, respectively, and dev","authors_text":"Yiming Yang, Zhiqing Sun","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-16T11:13:36Z","title":"DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.08224","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:fa6764a2dca911c143d39116814af57b7f90b43f5e70c80ee21958539b7cc0cf","target":"record","created_at":"2026-07-05T07:19:18Z","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":"1ce93cdfa2b972a147dbe6322f58dd5c27b2eaa96d8aa770352871df72fd8a24","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-16T11:13:36Z","title_canon_sha256":"2c26c71d35d5edbc466135c88a1eba327db137911f5d54be40d9f47ad87964ac"},"schema_version":"1.0","source":{"id":"2302.08224","kind":"arxiv","version":2}},"canonical_sha256":"5e9386397380883f6218ca64095bcebbb215b320f569436a4d3e592017ecff0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e9386397380883f6218ca64095bcebbb215b320f569436a4d3e592017ecff0f","first_computed_at":"2026-07-05T07:19:18.540245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:19:18.540245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1NccDbEE/TnUZk583FgeD6CE/fy5FDAdRTyEacaH01uz0IoQeO5gx8fMr5C5yIIQl9OOrV5tCGg75PHS31CoAg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:19:18.540798Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.08224","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa6764a2dca911c143d39116814af57b7f90b43f5e70c80ee21958539b7cc0cf","sha256:3bad959f834b9c8afba8f15034abae6477a8981fe210184ec6a8133b29c2e770"],"state_sha256":"b8576abccaa551c59ecc5743935fd1805810da7247c4e0098152e59585bc6825"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ufMKaP6KwyYV38Z7QV8J5d5S8klrWl0ibukm3cNNCqWVvlJJspe8tDHNAk9Y7P7Uw/tpCeMKRsGnfCZuEtykCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T13:17:25.001926Z","bundle_sha256":"01c1366a90b891256a68d02b7f5ca78476633ac9fc8113cc35d1c36b3132e9fc"}}