{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DXFU3XDWEEZOLX7WCO3HXFFIH5","short_pith_number":"pith:DXFU3XDW","schema_version":"1.0","canonical_sha256":"1dcb4ddc762132e5dff613b67b94a83f73adec08227ebb81c4bcb2bd21640dff","source":{"kind":"arxiv","id":"2607.03109","version":1},"attestation_state":"computed","paper":{"title":"Graph Neural Networks for the Graphical Bootstrap","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"hep-th","authors_text":"Gabriele Dian, Paul Heslop, Reza Doobary, Rigers Aliaj","submitted_at":"2026-07-03T08:45:19Z","abstract_excerpt":"We study a graph classification problem involving over 20 million graphs, arising from high-order perturbative computations of correlators in planar $\\mathcal{N}=4$ super-Yang--Mills, a model closely related to the theory of the strong nuclear force. We benchmark graph neural networks, including graph transformers, achieving robust generalization to larger graphs with up to $99.996\\%$ ROC AUC. Then, we analyze how the models can be used to gain a computational speedup compared to the traditional graphical bootstrap algorithm, through shrinking the redundant data by up to $85.5\\%$ at the level "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.03109","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"hep-th","submitted_at":"2026-07-03T08:45:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"05d2a05428ab488aba8cd0ec5010bc7fb90ceec42d58f25bea54f8e41bb5fe96","abstract_canon_sha256":"3a4a958a5a4c0c6e93a800349a6f2c1bcfa5543b88e4460a99953e5c1901160d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T01:16:43.264031Z","signature_b64":"PoaHFMaZLvWHEsasMC2ZADva4hiTaDWjlU/8+3Q2JJAfjWm3fDyHif4FSXwQo7xAdZk0q8niaB6+ns3i+46kDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dcb4ddc762132e5dff613b67b94a83f73adec08227ebb81c4bcb2bd21640dff","last_reissued_at":"2026-07-07T01:16:43.263613Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T01:16:43.263613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Neural Networks for the Graphical Bootstrap","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"hep-th","authors_text":"Gabriele Dian, Paul Heslop, Reza Doobary, Rigers Aliaj","submitted_at":"2026-07-03T08:45:19Z","abstract_excerpt":"We study a graph classification problem involving over 20 million graphs, arising from high-order perturbative computations of correlators in planar $\\mathcal{N}=4$ super-Yang--Mills, a model closely related to the theory of the strong nuclear force. We benchmark graph neural networks, including graph transformers, achieving robust generalization to larger graphs with up to $99.996\\%$ ROC AUC. Then, we analyze how the models can be used to gain a computational speedup compared to the traditional graphical bootstrap algorithm, through shrinking the redundant data by up to $85.5\\%$ at the level "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.03109","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/2607.03109/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.03109","created_at":"2026-07-07T01:16:43.263677+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.03109v1","created_at":"2026-07-07T01:16:43.263677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.03109","created_at":"2026-07-07T01:16:43.263677+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXFU3XDWEEZO","created_at":"2026-07-07T01:16:43.263677+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXFU3XDWEEZOLX7W","created_at":"2026-07-07T01:16:43.263677+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXFU3XDW","created_at":"2026-07-07T01:16:43.263677+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DXFU3XDWEEZOLX7WCO3HXFFIH5","json":"https://pith.science/pith/DXFU3XDWEEZOLX7WCO3HXFFIH5.json","graph_json":"https://pith.science/api/pith-number/DXFU3XDWEEZOLX7WCO3HXFFIH5/graph.json","events_json":"https://pith.science/api/pith-number/DXFU3XDWEEZOLX7WCO3HXFFIH5/events.json","paper":"https://pith.science/paper/DXFU3XDW"},"agent_actions":{"view_html":"https://pith.science/pith/DXFU3XDWEEZOLX7WCO3HXFFIH5","download_json":"https://pith.science/pith/DXFU3XDWEEZOLX7WCO3HXFFIH5.json","view_paper":"https://pith.science/paper/DXFU3XDW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.03109&json=true","fetch_graph":"https://pith.science/api/pith-number/DXFU3XDWEEZOLX7WCO3HXFFIH5/graph.json","fetch_events":"https://pith.science/api/pith-number/DXFU3XDWEEZOLX7WCO3HXFFIH5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXFU3XDWEEZOLX7WCO3HXFFIH5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXFU3XDWEEZOLX7WCO3HXFFIH5/action/storage_attestation","attest_author":"https://pith.science/pith/DXFU3XDWEEZOLX7WCO3HXFFIH5/action/author_attestation","sign_citation":"https://pith.science/pith/DXFU3XDWEEZOLX7WCO3HXFFIH5/action/citation_signature","submit_replication":"https://pith.science/pith/DXFU3XDWEEZOLX7WCO3HXFFIH5/action/replication_record"}},"created_at":"2026-07-07T01:16:43.263677+00:00","updated_at":"2026-07-07T01:16:43.263677+00:00"}