{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JLZVSZTACGL4BFHM6Y4BGWJDS7","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":"51a221fcde62c5bb199c7beab8958df668575e4ba1748d80f5caed65a879abf9","cross_cats_sorted":["cs.AI","cs.LO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T02:42:22Z","title_canon_sha256":"bc0703e0526951b5149fa40609a4bc12034d2555c66dc0eb08615a1183e1c42a"},"schema_version":"1.0","source":{"id":"1905.10006","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10006","created_at":"2026-07-05T00:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10006v2","created_at":"2026-07-05T00:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10006","created_at":"2026-07-05T00:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"JLZVSZTACGL4","created_at":"2026-07-05T00:04:28Z"},{"alias_kind":"pith_short_16","alias_value":"JLZVSZTACGL4BFHM","created_at":"2026-07-05T00:04:28Z"},{"alias_kind":"pith_short_8","alias_value":"JLZVSZTA","created_at":"2026-07-05T00:04:28Z"}],"graph_snapshots":[{"event_id":"sha256:e1d1e453af678389ca693959f80ddace6aa81d06c09b4a264ac63bb67c5c5ac7","target":"graph","created_at":"2026-07-05T00:04:28Z","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/1905.10006/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents the first use of graph neural networks (GNNs) for higher-order proof search and demonstrates that GNNs can improve upon state-of-the-art results in this domain. Interactive, higher-order theorem provers allow for the formalization of most mathematical theories and have been shown to pose a significant challenge for deep learning. Higher-order logic is highly expressive and, even though it is well-structured with a clearly defined grammar and semantics, there still remains no well-established method to convert formulas into graph-based representations. In this paper, we cons","authors_text":"Aditya Paliwal, Christian Szegedy, Kshitij Bansal, Markus Rabe, Sarah Loos","cross_cats":["cs.AI","cs.LO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T02:42:22Z","title":"Graph Representations for Higher-Order Logic and Theorem Proving"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10006","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:b12be43fba6a49799b968f96544ddff8ffcef3a264c29111070b5b79a2bc9bc1","target":"record","created_at":"2026-07-05T00:04:28Z","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":"51a221fcde62c5bb199c7beab8958df668575e4ba1748d80f5caed65a879abf9","cross_cats_sorted":["cs.AI","cs.LO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T02:42:22Z","title_canon_sha256":"bc0703e0526951b5149fa40609a4bc12034d2555c66dc0eb08615a1183e1c42a"},"schema_version":"1.0","source":{"id":"1905.10006","kind":"arxiv","version":2}},"canonical_sha256":"4af35966601197c094ecf63813592397ded46b59918fcb5da3cba1d94d31bd7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4af35966601197c094ecf63813592397ded46b59918fcb5da3cba1d94d31bd7b","first_computed_at":"2026-07-05T00:04:28.072225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:04:28.072225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3dN9Ibf/D4zmIFxyPll5e1GQfp6ptrIhXqjKk1u+uqe/9TxDnv8ZSbIngP2Z3k7XLbbyIpZpvur3lArzHykRBw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:04:28.072649Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10006","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b12be43fba6a49799b968f96544ddff8ffcef3a264c29111070b5b79a2bc9bc1","sha256:e1d1e453af678389ca693959f80ddace6aa81d06c09b4a264ac63bb67c5c5ac7"],"state_sha256":"31aaab5d0f26d2c148e6ec3702eb07d3f7e49862dfd9143369718bf98002e01b"}