{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JFALCYRBHTC6QTR47AXYNXF5CL","short_pith_number":"pith:JFALCYRB","canonical_record":{"source":{"id":"1909.08387","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-09-18T12:17:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b3054669cabe1d4c6b4b32caa11fb1ddd124658efc05009a17f3fdb3e5788226","abstract_canon_sha256":"fedab56e6a3ef175ed4a554115f5c29f0d786f1f5c0ad33162cd7b83da8f4cba"},"schema_version":"1.0"},"canonical_sha256":"4940b162213cc5e84e3cf82f86dcbd12f0e1ba9b76fa306db1ce19ae55d00182","source":{"kind":"arxiv","id":"1909.08387","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.08387","created_at":"2026-07-05T00:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"1909.08387v3","created_at":"2026-07-05T00:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.08387","created_at":"2026-07-05T00:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"JFALCYRBHTC6","created_at":"2026-07-05T00:39:38Z"},{"alias_kind":"pith_short_16","alias_value":"JFALCYRBHTC6QTR4","created_at":"2026-07-05T00:39:38Z"},{"alias_kind":"pith_short_8","alias_value":"JFALCYRB","created_at":"2026-07-05T00:39:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JFALCYRBHTC6QTR47AXYNXF5CL","target":"record","payload":{"canonical_record":{"source":{"id":"1909.08387","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-09-18T12:17:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b3054669cabe1d4c6b4b32caa11fb1ddd124658efc05009a17f3fdb3e5788226","abstract_canon_sha256":"fedab56e6a3ef175ed4a554115f5c29f0d786f1f5c0ad33162cd7b83da8f4cba"},"schema_version":"1.0"},"canonical_sha256":"4940b162213cc5e84e3cf82f86dcbd12f0e1ba9b76fa306db1ce19ae55d00182","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:39:38.483178Z","signature_b64":"u6rjGtwxfN383xuXEihVZ5bgfWt/OGi57aCJujX6/MRUJq08mzSf1GjcLOp5W34Bt4ab+g4/JxEb9ALsHlQGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4940b162213cc5e84e3cf82f86dcbd12f0e1ba9b76fa306db1ce19ae55d00182","last_reissued_at":"2026-07-05T00:39:38.482719Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:39:38.482719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.08387","source_version":3,"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-05T00:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NTjnqtvWNS/lGh/Z4F2EPIWHf/ykKE4+ecM/FewAESVysLQlzbSdHOhkZ3ZmzSYJ7Lt/HA6F5tjj8Edx0fZQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:14:36.818790Z"},"content_sha256":"b05cfd83e3aaff9d6a471b2c718aa5085772b8738ab11fb46421b4f3e34a39f1","schema_version":"1.0","event_id":"sha256:b05cfd83e3aaff9d6a471b2c718aa5085772b8738ab11fb46421b4f3e34a39f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JFALCYRBHTC6QTR47AXYNXF5CL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Neural Networks for Maximum Constraint Satisfaction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Hinrikus Wolf, Jan Toenshoff, Martin Grohe, Martin Ritzert","submitted_at":"2019-09-18T12:17:20Z","abstract_excerpt":"Many combinatorial optimization problems can be phrased in the language of constraint satisfaction problems. We introduce a graph neural network architecture for solving such optimization problems. The architecture is generic; it works for all binary constraint satisfaction problems. Training is unsupervised, and it is sufficient to train on relatively small instances; the resulting networks perform well on much larger instances (at least 10-times larger). We experimentally evaluate our approach for a variety of problems, including Maximum Cut and Maximum Independent Set. Despite being generic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.08387","kind":"arxiv","version":3},"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/1909.08387/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-05T00:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E2evHWoqYAz5JmLNa2wMMA0KAn77SiCUOIoGfcSTL9HgSBU8xLlLhIggxm2c+Mk8ozFCdKZALqRZPLXgsDkDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:14:36.819164Z"},"content_sha256":"9f17388b27d2f0ca251fe54ab82f3a80a136f5c13ef9619924e0f69672765ba4","schema_version":"1.0","event_id":"sha256:9f17388b27d2f0ca251fe54ab82f3a80a136f5c13ef9619924e0f69672765ba4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JFALCYRBHTC6QTR47AXYNXF5CL/bundle.json","state_url":"https://pith.science/pith/JFALCYRBHTC6QTR47AXYNXF5CL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JFALCYRBHTC6QTR47AXYNXF5CL/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-05T09:14:36Z","links":{"resolver":"https://pith.science/pith/JFALCYRBHTC6QTR47AXYNXF5CL","bundle":"https://pith.science/pith/JFALCYRBHTC6QTR47AXYNXF5CL/bundle.json","state":"https://pith.science/pith/JFALCYRBHTC6QTR47AXYNXF5CL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JFALCYRBHTC6QTR47AXYNXF5CL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JFALCYRBHTC6QTR47AXYNXF5CL","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":"fedab56e6a3ef175ed4a554115f5c29f0d786f1f5c0ad33162cd7b83da8f4cba","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-09-18T12:17:20Z","title_canon_sha256":"b3054669cabe1d4c6b4b32caa11fb1ddd124658efc05009a17f3fdb3e5788226"},"schema_version":"1.0","source":{"id":"1909.08387","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.08387","created_at":"2026-07-05T00:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"1909.08387v3","created_at":"2026-07-05T00:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.08387","created_at":"2026-07-05T00:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"JFALCYRBHTC6","created_at":"2026-07-05T00:39:38Z"},{"alias_kind":"pith_short_16","alias_value":"JFALCYRBHTC6QTR4","created_at":"2026-07-05T00:39:38Z"},{"alias_kind":"pith_short_8","alias_value":"JFALCYRB","created_at":"2026-07-05T00:39:38Z"}],"graph_snapshots":[{"event_id":"sha256:9f17388b27d2f0ca251fe54ab82f3a80a136f5c13ef9619924e0f69672765ba4","target":"graph","created_at":"2026-07-05T00:39:38Z","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.08387/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many combinatorial optimization problems can be phrased in the language of constraint satisfaction problems. We introduce a graph neural network architecture for solving such optimization problems. The architecture is generic; it works for all binary constraint satisfaction problems. Training is unsupervised, and it is sufficient to train on relatively small instances; the resulting networks perform well on much larger instances (at least 10-times larger). We experimentally evaluate our approach for a variety of problems, including Maximum Cut and Maximum Independent Set. Despite being generic","authors_text":"Hinrikus Wolf, Jan Toenshoff, Martin Grohe, Martin Ritzert","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-09-18T12:17:20Z","title":"Graph Neural Networks for Maximum Constraint Satisfaction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.08387","kind":"arxiv","version":3},"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:b05cfd83e3aaff9d6a471b2c718aa5085772b8738ab11fb46421b4f3e34a39f1","target":"record","created_at":"2026-07-05T00:39:38Z","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":"fedab56e6a3ef175ed4a554115f5c29f0d786f1f5c0ad33162cd7b83da8f4cba","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-09-18T12:17:20Z","title_canon_sha256":"b3054669cabe1d4c6b4b32caa11fb1ddd124658efc05009a17f3fdb3e5788226"},"schema_version":"1.0","source":{"id":"1909.08387","kind":"arxiv","version":3}},"canonical_sha256":"4940b162213cc5e84e3cf82f86dcbd12f0e1ba9b76fa306db1ce19ae55d00182","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4940b162213cc5e84e3cf82f86dcbd12f0e1ba9b76fa306db1ce19ae55d00182","first_computed_at":"2026-07-05T00:39:38.482719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:39:38.482719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u6rjGtwxfN383xuXEihVZ5bgfWt/OGi57aCJujX6/MRUJq08mzSf1GjcLOp5W34Bt4ab+g4/JxEb9ALsHlQGCA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:39:38.483178Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.08387","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b05cfd83e3aaff9d6a471b2c718aa5085772b8738ab11fb46421b4f3e34a39f1","sha256:9f17388b27d2f0ca251fe54ab82f3a80a136f5c13ef9619924e0f69672765ba4"],"state_sha256":"d88deaa5cc1e90739ea6e128775086e5885b149bdeb6ba10688ca6d4588e52a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MjoVr+KVglDgQ292vTm6st2HwNhL9xewSryX5gPEvFRopXpX4qmJrLkvQw7aAtD8ofqLTl9K1zeAYUezicjPDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T09:14:36.821189Z","bundle_sha256":"042915215883f245bf0a45f686fc3d95626ee08f89bcdecd0351cd2ece59ac96"}}