{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VI67VJYSV5JFEYEDFENBBXDAYF","short_pith_number":"pith:VI67VJYS","schema_version":"1.0","canonical_sha256":"aa3dfaa712af52526083291a10dc60c14364452bb011af95d25a3ae4f79511a7","source":{"kind":"arxiv","id":"1412.5980","version":1},"attestation_state":"computed","paper":{"title":"GraATP: A Graph Theoretic Approach for Automated Theorem Proving in Plane Geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Mohammad Murtaza Mahmud, Mohammad Nurul Huda, Swakkhar Shatabda","submitted_at":"2014-12-18T18:10:03Z","abstract_excerpt":"Automated Theorem Proving (ATP) is an established branch of Artificial Intelligence. The purpose of ATP is to design a system which can automatically figure out an algorithm either to prove or disprove a mathematical claim, on the basis of a set of given premises, using a set of fundamental postulates and following the method of logical inference. In this paper, we propose GraATP, a generalized framework for automated theorem proving in plane geometry. Our proposed method translates the geometric entities into nodes of a graph and the relations between them as edges of that graph. The automate"},"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":"1412.5980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-12-18T18:10:03Z","cross_cats_sorted":[],"title_canon_sha256":"2f40604e667ce8b4ad4c362534b0e6c55afe914969c9464ec71c271b58b5bf18","abstract_canon_sha256":"1a2e296111da6b7414d9b3d13ccd052f4e2fba6decc38aa85ca08f58ba0eff48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:55.824752Z","signature_b64":"boiwzhxKtmEXMFvndoEIf1u7hm9kq89hxpcVkW3rnyvEPIytWvh+HcP5vaC/EgdYFSEtLudvrG5A7s7H4JS9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa3dfaa712af52526083291a10dc60c14364452bb011af95d25a3ae4f79511a7","last_reissued_at":"2026-05-18T02:30:55.824070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:55.824070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraATP: A Graph Theoretic Approach for Automated Theorem Proving in Plane Geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Mohammad Murtaza Mahmud, Mohammad Nurul Huda, Swakkhar Shatabda","submitted_at":"2014-12-18T18:10:03Z","abstract_excerpt":"Automated Theorem Proving (ATP) is an established branch of Artificial Intelligence. The purpose of ATP is to design a system which can automatically figure out an algorithm either to prove or disprove a mathematical claim, on the basis of a set of given premises, using a set of fundamental postulates and following the method of logical inference. In this paper, we propose GraATP, a generalized framework for automated theorem proving in plane geometry. Our proposed method translates the geometric entities into nodes of a graph and the relations between them as edges of that graph. The automate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5980","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":""},"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":"1412.5980","created_at":"2026-05-18T02:30:55.824187+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.5980v1","created_at":"2026-05-18T02:30:55.824187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5980","created_at":"2026-05-18T02:30:55.824187+00:00"},{"alias_kind":"pith_short_12","alias_value":"VI67VJYSV5JF","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VI67VJYSV5JFEYED","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VI67VJYS","created_at":"2026-05-18T12:28:54.890064+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/VI67VJYSV5JFEYEDFENBBXDAYF","json":"https://pith.science/pith/VI67VJYSV5JFEYEDFENBBXDAYF.json","graph_json":"https://pith.science/api/pith-number/VI67VJYSV5JFEYEDFENBBXDAYF/graph.json","events_json":"https://pith.science/api/pith-number/VI67VJYSV5JFEYEDFENBBXDAYF/events.json","paper":"https://pith.science/paper/VI67VJYS"},"agent_actions":{"view_html":"https://pith.science/pith/VI67VJYSV5JFEYEDFENBBXDAYF","download_json":"https://pith.science/pith/VI67VJYSV5JFEYEDFENBBXDAYF.json","view_paper":"https://pith.science/paper/VI67VJYS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.5980&json=true","fetch_graph":"https://pith.science/api/pith-number/VI67VJYSV5JFEYEDFENBBXDAYF/graph.json","fetch_events":"https://pith.science/api/pith-number/VI67VJYSV5JFEYEDFENBBXDAYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VI67VJYSV5JFEYEDFENBBXDAYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VI67VJYSV5JFEYEDFENBBXDAYF/action/storage_attestation","attest_author":"https://pith.science/pith/VI67VJYSV5JFEYEDFENBBXDAYF/action/author_attestation","sign_citation":"https://pith.science/pith/VI67VJYSV5JFEYEDFENBBXDAYF/action/citation_signature","submit_replication":"https://pith.science/pith/VI67VJYSV5JFEYEDFENBBXDAYF/action/replication_record"}},"created_at":"2026-05-18T02:30:55.824187+00:00","updated_at":"2026-05-18T02:30:55.824187+00:00"}