{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:C6USWKVEZZNRR6JRWD3GKWXOYR","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":"c4d8cd524efac4cb72f9b8839b946b763fe753df2b4419d93b9d1a52b397255d","cross_cats_sorted":["cs.DM","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-16T06:43:46Z","title_canon_sha256":"ae4576de04057efa86760f1285a41e1125b29a47ad388f4bbc59d273de0afc7d"},"schema_version":"1.0","source":{"id":"1909.07018","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.07018","created_at":"2026-07-05T00:04:52Z"},{"alias_kind":"arxiv_version","alias_value":"1909.07018v1","created_at":"2026-07-05T00:04:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.07018","created_at":"2026-07-05T00:04:52Z"},{"alias_kind":"pith_short_12","alias_value":"C6USWKVEZZNR","created_at":"2026-07-05T00:04:52Z"},{"alias_kind":"pith_short_16","alias_value":"C6USWKVEZZNRR6JR","created_at":"2026-07-05T00:04:52Z"},{"alias_kind":"pith_short_8","alias_value":"C6USWKVE","created_at":"2026-07-05T00:04:52Z"}],"graph_snapshots":[{"event_id":"sha256:631b2d98e4fb1b1ba9cd69a109445336d81feb8b0ec7bfe8548b6ab20f74d06b","target":"graph","created_at":"2026-07-05T00:04:52Z","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/1909.07018/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many problems in real life can be converted to combinatorial optimization problems (COPs) on graphs, that is to find a best node state configuration or a network structure such that the designed objective function is optimized under some constraints. However, these problems are notorious for their hardness to solve because most of them are NP-hard or NP-complete. Although traditional general methods such as simulated annealing (SA), genetic algorithms (GA) and so forth have been devised to these hard problems, their accuracy and time consumption are not satisfying in practice. In this work, we","authors_text":"Fei Gao, Jiang Zhang, Jing Liu","cross_cats":["cs.DM","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-16T06:43:46Z","title":"Gumbel-softmax Optimization: A Simple General Framework for Combinatorial Optimization Problems on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.07018","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:7b20fb898c5e6e581452c567330c3fd038c466a17ecddad099f4ecbffca42999","target":"record","created_at":"2026-07-05T00:04:52Z","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":"c4d8cd524efac4cb72f9b8839b946b763fe753df2b4419d93b9d1a52b397255d","cross_cats_sorted":["cs.DM","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-16T06:43:46Z","title_canon_sha256":"ae4576de04057efa86760f1285a41e1125b29a47ad388f4bbc59d273de0afc7d"},"schema_version":"1.0","source":{"id":"1909.07018","kind":"arxiv","version":1}},"canonical_sha256":"17a92b2aa4ce5b18f931b0f6655aeec46629edaa8abec02bf8d8901e9c768022","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17a92b2aa4ce5b18f931b0f6655aeec46629edaa8abec02bf8d8901e9c768022","first_computed_at":"2026-07-05T00:04:52.436433Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:04:52.436433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GjqP0vbjDciDJgDdyE91uGswXwyrWqXQKjkbPTIf+b2Mf937uyh6ZJtlKLyU9LCJ1XBxO95m4LJ2oGDQQZYFBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:04:52.436768Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.07018","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b20fb898c5e6e581452c567330c3fd038c466a17ecddad099f4ecbffca42999","sha256:631b2d98e4fb1b1ba9cd69a109445336d81feb8b0ec7bfe8548b6ab20f74d06b"],"state_sha256":"6e14c0f11eb39fbb0198d1d61a9c7555a365e213196f7e71d8e555fd46828975"}