{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TZ5IEDNDGZ3ROABYVXFUZTZBBR","short_pith_number":"pith:TZ5IEDND","canonical_record":{"source":{"id":"1908.05767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-15T21:15:49Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e5bd28663fd897dcbfc59c552a061e2fea8f825073a497a6959f07cf3aebb654","abstract_canon_sha256":"6259e6a5d1cafd88806d2b272a76900c4303f5ffc958e592637ff7cb5787069a"},"schema_version":"1.0"},"canonical_sha256":"9e7a820da33677170038adcb4ccf210c7a2f8a12419b3ebd2e4d04fa7ab4e46d","source":{"kind":"arxiv","id":"1908.05767","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05767","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05767v1","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05767","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"TZ5IEDNDGZ3R","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"pith_short_16","alias_value":"TZ5IEDNDGZ3ROABY","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"pith_short_8","alias_value":"TZ5IEDND","created_at":"2026-07-04T23:57:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TZ5IEDNDGZ3ROABYVXFUZTZBBR","target":"record","payload":{"canonical_record":{"source":{"id":"1908.05767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-15T21:15:49Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e5bd28663fd897dcbfc59c552a061e2fea8f825073a497a6959f07cf3aebb654","abstract_canon_sha256":"6259e6a5d1cafd88806d2b272a76900c4303f5ffc958e592637ff7cb5787069a"},"schema_version":"1.0"},"canonical_sha256":"9e7a820da33677170038adcb4ccf210c7a2f8a12419b3ebd2e4d04fa7ab4e46d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:57:52.965904Z","signature_b64":"R2ySjvXBfpkFpS3bYrpwdWXrqS4wTqvBOSS+hlAajNSZxWigF/Co67C1qqa9vkm0RPoD6OipWgzUEWtnEou8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e7a820da33677170038adcb4ccf210c7a2f8a12419b3ebd2e4d04fa7ab4e46d","last_reissued_at":"2026-07-04T23:57:52.965553Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:57:52.965553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.05767","source_version":1,"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-04T23:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+SkmRHUc7ydpIHq594Aj5hFwEvN72xZVnDViRmC/qLRBjsRS8jVqoEBw+8/Re9KBR95mqEgJZ2Fft8IxatUKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T18:29:16.374735Z"},"content_sha256":"b6ee8a0246d3548fccd473888a482b4d328de10fb20ca1d1bd2af1da5838748a","schema_version":"1.0","event_id":"sha256:b6ee8a0246d3548fccd473888a482b4d328de10fb20ca1d1bd2af1da5838748a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TZ5IEDNDGZ3ROABYVXFUZTZBBR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Experimental performance of graph neural networks on random instances of max-cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Afonso S. Bandeira, Soledad Villar, Weichi Yao","submitted_at":"2019-08-15T21:15:49Z","abstract_excerpt":"This note explores the applicability of unsupervised machine learning techniques towards hard optimization problems on random inputs. In particular we consider Graph Neural Networks (GNNs) -- a class of neural networks designed to learn functions on graphs -- and we apply them to the max-cut problem on random regular graphs. We focus on the max-cut problem on random regular graphs because it is a fundamental problem that has been widely studied. In particular, even though there is no known explicit solution to compare the output of our algorithm to, we can leverage the known asymptotics of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05767","kind":"arxiv","version":1},"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/1908.05767/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-04T23:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D35rw5Q0olW6Bo6MZssGFR+xtMUtFSisef++exvJUHqd7GRakEGQUicPwxTr4ooVjyZ5UBaT1ENxaDyRXc4lDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T18:29:16.375266Z"},"content_sha256":"a15d216966bb77b88a168520e90154ca75910c5db9916596d7ddea34f86f3200","schema_version":"1.0","event_id":"sha256:a15d216966bb77b88a168520e90154ca75910c5db9916596d7ddea34f86f3200"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TZ5IEDNDGZ3ROABYVXFUZTZBBR/bundle.json","state_url":"https://pith.science/pith/TZ5IEDNDGZ3ROABYVXFUZTZBBR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TZ5IEDNDGZ3ROABYVXFUZTZBBR/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-16T18:29:16Z","links":{"resolver":"https://pith.science/pith/TZ5IEDNDGZ3ROABYVXFUZTZBBR","bundle":"https://pith.science/pith/TZ5IEDNDGZ3ROABYVXFUZTZBBR/bundle.json","state":"https://pith.science/pith/TZ5IEDNDGZ3ROABYVXFUZTZBBR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TZ5IEDNDGZ3ROABYVXFUZTZBBR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TZ5IEDNDGZ3ROABYVXFUZTZBBR","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":"6259e6a5d1cafd88806d2b272a76900c4303f5ffc958e592637ff7cb5787069a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-15T21:15:49Z","title_canon_sha256":"e5bd28663fd897dcbfc59c552a061e2fea8f825073a497a6959f07cf3aebb654"},"schema_version":"1.0","source":{"id":"1908.05767","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05767","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05767v1","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05767","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"TZ5IEDNDGZ3R","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"pith_short_16","alias_value":"TZ5IEDNDGZ3ROABY","created_at":"2026-07-04T23:57:52Z"},{"alias_kind":"pith_short_8","alias_value":"TZ5IEDND","created_at":"2026-07-04T23:57:52Z"}],"graph_snapshots":[{"event_id":"sha256:a15d216966bb77b88a168520e90154ca75910c5db9916596d7ddea34f86f3200","target":"graph","created_at":"2026-07-04T23:57: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/1908.05767/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This note explores the applicability of unsupervised machine learning techniques towards hard optimization problems on random inputs. In particular we consider Graph Neural Networks (GNNs) -- a class of neural networks designed to learn functions on graphs -- and we apply them to the max-cut problem on random regular graphs. We focus on the max-cut problem on random regular graphs because it is a fundamental problem that has been widely studied. In particular, even though there is no known explicit solution to compare the output of our algorithm to, we can leverage the known asymptotics of the","authors_text":"Afonso S. Bandeira, Soledad Villar, Weichi Yao","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-15T21:15:49Z","title":"Experimental performance of graph neural networks on random instances of max-cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05767","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:b6ee8a0246d3548fccd473888a482b4d328de10fb20ca1d1bd2af1da5838748a","target":"record","created_at":"2026-07-04T23:57: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":"6259e6a5d1cafd88806d2b272a76900c4303f5ffc958e592637ff7cb5787069a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-15T21:15:49Z","title_canon_sha256":"e5bd28663fd897dcbfc59c552a061e2fea8f825073a497a6959f07cf3aebb654"},"schema_version":"1.0","source":{"id":"1908.05767","kind":"arxiv","version":1}},"canonical_sha256":"9e7a820da33677170038adcb4ccf210c7a2f8a12419b3ebd2e4d04fa7ab4e46d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e7a820da33677170038adcb4ccf210c7a2f8a12419b3ebd2e4d04fa7ab4e46d","first_computed_at":"2026-07-04T23:57:52.965553Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:57:52.965553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R2ySjvXBfpkFpS3bYrpwdWXrqS4wTqvBOSS+hlAajNSZxWigF/Co67C1qqa9vkm0RPoD6OipWgzUEWtnEou8Dg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:57:52.965904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05767","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6ee8a0246d3548fccd473888a482b4d328de10fb20ca1d1bd2af1da5838748a","sha256:a15d216966bb77b88a168520e90154ca75910c5db9916596d7ddea34f86f3200"],"state_sha256":"ac2bede5c2f256d63abaaea004172ab343a17f6d20d232207b9cf5d89f6c34d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uCtYnANLS4es8jAzzM0sNxPEvXXtdCPKEiakeIj5VZw3JUV/1I0t76wtbniZn5LFvmYqCNyXk7RnbyTZwBwdCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T18:29:16.381102Z","bundle_sha256":"1baed3e08a796a4fae065c0653230b55f56e6609f18a22a37135568cf68d5380"}}