{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SDYVIHJSYGJDNCELK35NYXMNT4","short_pith_number":"pith:SDYVIHJS","schema_version":"1.0","canonical_sha256":"90f1541d32c19236888b56fadc5d8d9f28e3109aaa92931b912849814820a014","source":{"kind":"arxiv","id":"1605.06996","version":1},"attestation_state":"computed","paper":{"title":"Extracting Higher-Order Goals from the Mizar Mathematical Library","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Chad Brown, Josef Urban","submitted_at":"2016-05-23T12:37:54Z","abstract_excerpt":"Certain constructs allowed in Mizar articles cannot be represented in first-order logic but can be represented in higher-order logic. We describe a way to obtain higher-order theorem proving problems from Mizar articles that make use of these constructs. In particular, higher-order logic is used to represent schemes, a global choice construct and set level binders. The higher-order automated theorem provers Satallax and LEO-II have been run on collections of these problems and the results are discussed."},"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":"1605.06996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-23T12:37:54Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7303f66c2b01817a0374055207ee22e4d8fae75dc45d549a712ac48c6a35617d","abstract_canon_sha256":"521dda487c13425347fb3754dd28fa919ebae806d58a1eded4d62ad83d58e785"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:10.642064Z","signature_b64":"dIXSb9pvRteQxiopRumJc44dTuz+0gLv99gz/gzOzLLdz9SUhzW6lVMFdwuToV8lyCgiJsyWrbjMFZiWj03lDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90f1541d32c19236888b56fadc5d8d9f28e3109aaa92931b912849814820a014","last_reissued_at":"2026-05-18T01:14:10.641265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:10.641265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extracting Higher-Order Goals from the Mizar Mathematical Library","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Chad Brown, Josef Urban","submitted_at":"2016-05-23T12:37:54Z","abstract_excerpt":"Certain constructs allowed in Mizar articles cannot be represented in first-order logic but can be represented in higher-order logic. We describe a way to obtain higher-order theorem proving problems from Mizar articles that make use of these constructs. In particular, higher-order logic is used to represent schemes, a global choice construct and set level binders. The higher-order automated theorem provers Satallax and LEO-II have been run on collections of these problems and the results are discussed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06996","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":"1605.06996","created_at":"2026-05-18T01:14:10.641397+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.06996v1","created_at":"2026-05-18T01:14:10.641397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06996","created_at":"2026-05-18T01:14:10.641397+00:00"},{"alias_kind":"pith_short_12","alias_value":"SDYVIHJSYGJD","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SDYVIHJSYGJDNCEL","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SDYVIHJS","created_at":"2026-05-18T12:30:44.179134+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/SDYVIHJSYGJDNCELK35NYXMNT4","json":"https://pith.science/pith/SDYVIHJSYGJDNCELK35NYXMNT4.json","graph_json":"https://pith.science/api/pith-number/SDYVIHJSYGJDNCELK35NYXMNT4/graph.json","events_json":"https://pith.science/api/pith-number/SDYVIHJSYGJDNCELK35NYXMNT4/events.json","paper":"https://pith.science/paper/SDYVIHJS"},"agent_actions":{"view_html":"https://pith.science/pith/SDYVIHJSYGJDNCELK35NYXMNT4","download_json":"https://pith.science/pith/SDYVIHJSYGJDNCELK35NYXMNT4.json","view_paper":"https://pith.science/paper/SDYVIHJS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.06996&json=true","fetch_graph":"https://pith.science/api/pith-number/SDYVIHJSYGJDNCELK35NYXMNT4/graph.json","fetch_events":"https://pith.science/api/pith-number/SDYVIHJSYGJDNCELK35NYXMNT4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SDYVIHJSYGJDNCELK35NYXMNT4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SDYVIHJSYGJDNCELK35NYXMNT4/action/storage_attestation","attest_author":"https://pith.science/pith/SDYVIHJSYGJDNCELK35NYXMNT4/action/author_attestation","sign_citation":"https://pith.science/pith/SDYVIHJSYGJDNCELK35NYXMNT4/action/citation_signature","submit_replication":"https://pith.science/pith/SDYVIHJSYGJDNCELK35NYXMNT4/action/replication_record"}},"created_at":"2026-05-18T01:14:10.641397+00:00","updated_at":"2026-05-18T01:14:10.641397+00:00"}