{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UD7ITEK4DSIHPYPRP43PDLMVOV","short_pith_number":"pith:UD7ITEK4","schema_version":"1.0","canonical_sha256":"a0fe89915c1c9077e1f17f36f1ad9575706588de1b943caa8b4ba427db9956c5","source":{"kind":"arxiv","id":"2608.09190","version":1},"attestation_state":"computed","paper":{"title":"Structure-Preserving Uncertainty Propagation in First-Order Proof Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Tanel Tammet","submitted_at":"2026-08-10T07:00:55Z","abstract_excerpt":"GK is a query-directed first-order prover that extends ordinary resolution-based proof search with explicit positive and negative claims, numerical confidence values, and prioritized default rules with exceptions. It works directly with non-ground clauses, including equality and function terms. Candidate proofs are found by bounded first-order proof search; exception conditions of defaults are checked by further bounded searches, recursively when exceptions themselves depend on defaults. This avoids requiring a finite global grounding, while allowing incomplete searches to be reported as such."},"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":"2608.09190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-08-10T07:00:55Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"ec5fe244a63bc7ddb715114b3d5f1faa752ea1174261cb032f524fd77de8a5e9","abstract_canon_sha256":"5fa85987060424b6d51bce44951d047ee8ba069e31e293ff969d3f026d735234"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T02:22:03.109226Z","signature_b64":"1pi32nObCL8WmaenGvOj99ns59l3KXwjZK9ZJCNvwX3wSabW0Q33no4kdmxujwFJ2JQrW6B4nVN2gEjnSeeSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0fe89915c1c9077e1f17f36f1ad9575706588de1b943caa8b4ba427db9956c5","last_reissued_at":"2026-08-11T02:22:03.107642Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T02:22:03.107642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structure-Preserving Uncertainty Propagation in First-Order Proof Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Tanel Tammet","submitted_at":"2026-08-10T07:00:55Z","abstract_excerpt":"GK is a query-directed first-order prover that extends ordinary resolution-based proof search with explicit positive and negative claims, numerical confidence values, and prioritized default rules with exceptions. It works directly with non-ground clauses, including equality and function terms. Candidate proofs are found by bounded first-order proof search; exception conditions of defaults are checked by further bounded searches, recursively when exceptions themselves depend on defaults. This avoids requiring a finite global grounding, while allowing incomplete searches to be reported as such."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.09190","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/2608.09190/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":"2608.09190","created_at":"2026-08-11T02:22:03.108263+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.09190v1","created_at":"2026-08-11T02:22:03.108263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09190","created_at":"2026-08-11T02:22:03.108263+00:00"},{"alias_kind":"pith_short_12","alias_value":"UD7ITEK4DSIH","created_at":"2026-08-11T02:22:03.108263+00:00"},{"alias_kind":"pith_short_16","alias_value":"UD7ITEK4DSIHPYPR","created_at":"2026-08-11T02:22:03.108263+00:00"},{"alias_kind":"pith_short_8","alias_value":"UD7ITEK4","created_at":"2026-08-11T02:22:03.108263+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.11275","citing_title":"Every pooling rule has its world: matching probability combination rules to situations and stakes","ref_index":67,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UD7ITEK4DSIHPYPRP43PDLMVOV","json":"https://pith.science/pith/UD7ITEK4DSIHPYPRP43PDLMVOV.json","graph_json":"https://pith.science/api/pith-number/UD7ITEK4DSIHPYPRP43PDLMVOV/graph.json","events_json":"https://pith.science/api/pith-number/UD7ITEK4DSIHPYPRP43PDLMVOV/events.json","paper":"https://pith.science/paper/UD7ITEK4"},"agent_actions":{"view_html":"https://pith.science/pith/UD7ITEK4DSIHPYPRP43PDLMVOV","download_json":"https://pith.science/pith/UD7ITEK4DSIHPYPRP43PDLMVOV.json","view_paper":"https://pith.science/paper/UD7ITEK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.09190&json=true","fetch_graph":"https://pith.science/api/pith-number/UD7ITEK4DSIHPYPRP43PDLMVOV/graph.json","fetch_events":"https://pith.science/api/pith-number/UD7ITEK4DSIHPYPRP43PDLMVOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UD7ITEK4DSIHPYPRP43PDLMVOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UD7ITEK4DSIHPYPRP43PDLMVOV/action/storage_attestation","attest_author":"https://pith.science/pith/UD7ITEK4DSIHPYPRP43PDLMVOV/action/author_attestation","sign_citation":"https://pith.science/pith/UD7ITEK4DSIHPYPRP43PDLMVOV/action/citation_signature","submit_replication":"https://pith.science/pith/UD7ITEK4DSIHPYPRP43PDLMVOV/action/replication_record"}},"created_at":"2026-08-11T02:22:03.108263+00:00","updated_at":"2026-08-11T02:22:03.108263+00:00"}