{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JLZVSZTACGL4BFHM6Y4BGWJDS7","short_pith_number":"pith:JLZVSZTA","schema_version":"1.0","canonical_sha256":"4af35966601197c094ecf63813592397ded46b59918fcb5da3cba1d94d31bd7b","source":{"kind":"arxiv","id":"1905.10006","version":2},"attestation_state":"computed","paper":{"title":"Graph Representations for Higher-Order Logic and Theorem Proving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aditya Paliwal, Christian Szegedy, Kshitij Bansal, Markus Rabe, Sarah Loos","submitted_at":"2019-05-24T02:42:22Z","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"},"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":"1905.10006","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T02:42:22Z","cross_cats_sorted":["cs.AI","cs.LO","stat.ML"],"title_canon_sha256":"bc0703e0526951b5149fa40609a4bc12034d2555c66dc0eb08615a1183e1c42a","abstract_canon_sha256":"51a221fcde62c5bb199c7beab8958df668575e4ba1748d80f5caed65a879abf9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:04:28.072649Z","signature_b64":"3dN9Ibf/D4zmIFxyPll5e1GQfp6ptrIhXqjKk1u+uqe/9TxDnv8ZSbIngP2Z3k7XLbbyIpZpvur3lArzHykRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4af35966601197c094ecf63813592397ded46b59918fcb5da3cba1d94d31bd7b","last_reissued_at":"2026-07-05T00:04:28.072225Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:04:28.072225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Representations for Higher-Order Logic and Theorem Proving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aditya Paliwal, Christian Szegedy, Kshitij Bansal, Markus Rabe, Sarah Loos","submitted_at":"2019-05-24T02:42:22Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10006","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/1905.10006/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":"1905.10006","created_at":"2026-07-05T00:04:28.072281+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10006v2","created_at":"2026-07-05T00:04:28.072281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10006","created_at":"2026-07-05T00:04:28.072281+00:00"},{"alias_kind":"pith_short_12","alias_value":"JLZVSZTACGL4","created_at":"2026-07-05T00:04:28.072281+00:00"},{"alias_kind":"pith_short_16","alias_value":"JLZVSZTACGL4BFHM","created_at":"2026-07-05T00:04:28.072281+00:00"},{"alias_kind":"pith_short_8","alias_value":"JLZVSZTA","created_at":"2026-07-05T00:04:28.072281+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07779","citing_title":"From Solvers to Research: Large Language Model-Driven Formal Mathematics at the Research Frontier","ref_index":188,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JLZVSZTACGL4BFHM6Y4BGWJDS7","json":"https://pith.science/pith/JLZVSZTACGL4BFHM6Y4BGWJDS7.json","graph_json":"https://pith.science/api/pith-number/JLZVSZTACGL4BFHM6Y4BGWJDS7/graph.json","events_json":"https://pith.science/api/pith-number/JLZVSZTACGL4BFHM6Y4BGWJDS7/events.json","paper":"https://pith.science/paper/JLZVSZTA"},"agent_actions":{"view_html":"https://pith.science/pith/JLZVSZTACGL4BFHM6Y4BGWJDS7","download_json":"https://pith.science/pith/JLZVSZTACGL4BFHM6Y4BGWJDS7.json","view_paper":"https://pith.science/paper/JLZVSZTA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10006&json=true","fetch_graph":"https://pith.science/api/pith-number/JLZVSZTACGL4BFHM6Y4BGWJDS7/graph.json","fetch_events":"https://pith.science/api/pith-number/JLZVSZTACGL4BFHM6Y4BGWJDS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JLZVSZTACGL4BFHM6Y4BGWJDS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JLZVSZTACGL4BFHM6Y4BGWJDS7/action/storage_attestation","attest_author":"https://pith.science/pith/JLZVSZTACGL4BFHM6Y4BGWJDS7/action/author_attestation","sign_citation":"https://pith.science/pith/JLZVSZTACGL4BFHM6Y4BGWJDS7/action/citation_signature","submit_replication":"https://pith.science/pith/JLZVSZTACGL4BFHM6Y4BGWJDS7/action/replication_record"}},"created_at":"2026-07-05T00:04:28.072281+00:00","updated_at":"2026-07-05T00:04:28.072281+00:00"}