{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:LQ5VNW4IP7354BSDRA4TC66ZSO","short_pith_number":"pith:LQ5VNW4I","canonical_record":{"source":{"id":"2405.20543","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-31T00:02:07Z","cross_cats_sorted":["cs.AI","cs.DM"],"title_canon_sha256":"aeb760c8881c4e52242b1c3eadc49291f3792605b02c0c7dac39f8b62ccc45ec","abstract_canon_sha256":"559696e0ae8d01da207bdce2a4d9f16b7c5a997c9f8b2337ba17eafdcc2c1a72"},"schema_version":"1.0"},"canonical_sha256":"5c3b56db887ff7de06438839317bd993ae5780a7ed9df8e58c83bc0b8a1d6e8d","source":{"kind":"arxiv","id":"2405.20543","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.20543","created_at":"2026-07-05T09:39:55Z"},{"alias_kind":"arxiv_version","alias_value":"2405.20543v2","created_at":"2026-07-05T09:39:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.20543","created_at":"2026-07-05T09:39:55Z"},{"alias_kind":"pith_short_12","alias_value":"LQ5VNW4IP735","created_at":"2026-07-05T09:39:55Z"},{"alias_kind":"pith_short_16","alias_value":"LQ5VNW4IP7354BSD","created_at":"2026-07-05T09:39:55Z"},{"alias_kind":"pith_short_8","alias_value":"LQ5VNW4I","created_at":"2026-07-05T09:39:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:LQ5VNW4IP7354BSDRA4TC66ZSO","target":"record","payload":{"canonical_record":{"source":{"id":"2405.20543","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-31T00:02:07Z","cross_cats_sorted":["cs.AI","cs.DM"],"title_canon_sha256":"aeb760c8881c4e52242b1c3eadc49291f3792605b02c0c7dac39f8b62ccc45ec","abstract_canon_sha256":"559696e0ae8d01da207bdce2a4d9f16b7c5a997c9f8b2337ba17eafdcc2c1a72"},"schema_version":"1.0"},"canonical_sha256":"5c3b56db887ff7de06438839317bd993ae5780a7ed9df8e58c83bc0b8a1d6e8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:55.233094Z","signature_b64":"5FWvJyz0dTRhjGdxuuAEhpPuDmzWzCuB0RJKiIupQKrGYpGJhpN+mjnP6J1xUOQ6WKNnn2D91tbVd7bpRYV2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c3b56db887ff7de06438839317bd993ae5780a7ed9df8e58c83bc0b8a1d6e8d","last_reissued_at":"2026-07-05T09:39:55.232610Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:55.232610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.20543","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-05T09:39:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T5C2QQtwF7FtOHFjzzVI9AFe/4S802qgViesVuO06qpng8wmcUOORN59pxQ+c558GGmsvloPOiy7k41AioorCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T10:09:03.107808Z"},"content_sha256":"7717ee5eccb3fe88ae23a1f1de94a7271b7ef0a2520dd8874edaff360d556676","schema_version":"1.0","event_id":"sha256:7717ee5eccb3fe88ae23a1f1de94a7271b7ef0a2520dd8874edaff360d556676"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:LQ5VNW4IP7354BSDRA4TC66ZSO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards a General Recipe for Combinatorial Optimization with Multi-Filter GNNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM"],"primary_cat":"cs.LG","authors_text":"Frederik Wenkel, Guy Wolf, Michael Perlmutter, Semih Cant\\\"urk, Stefan Horoi","submitted_at":"2024-05-31T00:02:07Z","abstract_excerpt":"Graph neural networks (GNNs) have achieved great success for a variety of tasks such as node classification, graph classification, and link prediction. However, the use of GNNs (and machine learning more generally) to solve combinatorial optimization (CO) problems is much less explored. Here, we introduce GCON, a novel GNN architecture that leverages a complex filter bank and localized attention mechanisms to solve CO problems on graphs. We show how our method differentiates itself from prior GNN-based CO solvers and how it can be effectively applied to the maximum cut, minimum dominating set,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.20543","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/2405.20543/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-05T09:39:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r4tlCuw9qS+myGZAXvtW9x8TU/0kguXigbDmrkScG7lEH5+VnBrGGRQSZJSl3lXlgYYknidBsi/Znn9/zaKyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T10:09:03.108221Z"},"content_sha256":"143b2b3888fc5fc7c9f119504bc5607971136561f8c212cd864668e320da9f38","schema_version":"1.0","event_id":"sha256:143b2b3888fc5fc7c9f119504bc5607971136561f8c212cd864668e320da9f38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQ5VNW4IP7354BSDRA4TC66ZSO/bundle.json","state_url":"https://pith.science/pith/LQ5VNW4IP7354BSDRA4TC66ZSO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQ5VNW4IP7354BSDRA4TC66ZSO/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-07-14T10:09:03Z","links":{"resolver":"https://pith.science/pith/LQ5VNW4IP7354BSDRA4TC66ZSO","bundle":"https://pith.science/pith/LQ5VNW4IP7354BSDRA4TC66ZSO/bundle.json","state":"https://pith.science/pith/LQ5VNW4IP7354BSDRA4TC66ZSO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQ5VNW4IP7354BSDRA4TC66ZSO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:LQ5VNW4IP7354BSDRA4TC66ZSO","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":"559696e0ae8d01da207bdce2a4d9f16b7c5a997c9f8b2337ba17eafdcc2c1a72","cross_cats_sorted":["cs.AI","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-31T00:02:07Z","title_canon_sha256":"aeb760c8881c4e52242b1c3eadc49291f3792605b02c0c7dac39f8b62ccc45ec"},"schema_version":"1.0","source":{"id":"2405.20543","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.20543","created_at":"2026-07-05T09:39:55Z"},{"alias_kind":"arxiv_version","alias_value":"2405.20543v2","created_at":"2026-07-05T09:39:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.20543","created_at":"2026-07-05T09:39:55Z"},{"alias_kind":"pith_short_12","alias_value":"LQ5VNW4IP735","created_at":"2026-07-05T09:39:55Z"},{"alias_kind":"pith_short_16","alias_value":"LQ5VNW4IP7354BSD","created_at":"2026-07-05T09:39:55Z"},{"alias_kind":"pith_short_8","alias_value":"LQ5VNW4I","created_at":"2026-07-05T09:39:55Z"}],"graph_snapshots":[{"event_id":"sha256:143b2b3888fc5fc7c9f119504bc5607971136561f8c212cd864668e320da9f38","target":"graph","created_at":"2026-07-05T09:39:55Z","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/2405.20543/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph neural networks (GNNs) have achieved great success for a variety of tasks such as node classification, graph classification, and link prediction. However, the use of GNNs (and machine learning more generally) to solve combinatorial optimization (CO) problems is much less explored. Here, we introduce GCON, a novel GNN architecture that leverages a complex filter bank and localized attention mechanisms to solve CO problems on graphs. We show how our method differentiates itself from prior GNN-based CO solvers and how it can be effectively applied to the maximum cut, minimum dominating set,","authors_text":"Frederik Wenkel, Guy Wolf, Michael Perlmutter, Semih Cant\\\"urk, Stefan Horoi","cross_cats":["cs.AI","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-31T00:02:07Z","title":"Towards a General Recipe for Combinatorial Optimization with Multi-Filter GNNs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.20543","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:7717ee5eccb3fe88ae23a1f1de94a7271b7ef0a2520dd8874edaff360d556676","target":"record","created_at":"2026-07-05T09:39:55Z","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":"559696e0ae8d01da207bdce2a4d9f16b7c5a997c9f8b2337ba17eafdcc2c1a72","cross_cats_sorted":["cs.AI","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-31T00:02:07Z","title_canon_sha256":"aeb760c8881c4e52242b1c3eadc49291f3792605b02c0c7dac39f8b62ccc45ec"},"schema_version":"1.0","source":{"id":"2405.20543","kind":"arxiv","version":2}},"canonical_sha256":"5c3b56db887ff7de06438839317bd993ae5780a7ed9df8e58c83bc0b8a1d6e8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c3b56db887ff7de06438839317bd993ae5780a7ed9df8e58c83bc0b8a1d6e8d","first_computed_at":"2026-07-05T09:39:55.232610Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:39:55.232610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5FWvJyz0dTRhjGdxuuAEhpPuDmzWzCuB0RJKiIupQKrGYpGJhpN+mjnP6J1xUOQ6WKNnn2D91tbVd7bpRYV2Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:39:55.233094Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.20543","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7717ee5eccb3fe88ae23a1f1de94a7271b7ef0a2520dd8874edaff360d556676","sha256:143b2b3888fc5fc7c9f119504bc5607971136561f8c212cd864668e320da9f38"],"state_sha256":"9effbd62c29b6e3357e58913ff280570b453271f8f997b92cde966e83d2a897f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hmoWMJXH7nv+p5JfDJisKqmfVCYGXrF7HCjA41VYlmfPJIWiH6ld6VDMihXyZfe/p8jVGRf/Ao5n9sgZu373Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-14T10:09:03.110375Z","bundle_sha256":"1b5c5d528f1791780f92108b168f9f51f26bc54504b48d999e2e59b2e0558698"}}