{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JNHJ33GZKL6OF4D62JSVNEOS5G","short_pith_number":"pith:JNHJ33GZ","schema_version":"1.0","canonical_sha256":"4b4e9decd952fce2f07ed2655691d2e9bce1d66251d5bbe3bce8af5b3e582d34","source":{"kind":"arxiv","id":"2412.16226","version":1},"attestation_state":"computed","paper":{"title":"Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"{\\DJ}or{\\dj}e \\v{Z}ikeli\\'c, Ehsan Kafshdar Goharshady, Harshit J Motwani, Krishnendu Chatterjee, Maximilian Seeliger, Mehrdad Karrabi","submitted_at":"2024-12-18T14:37:15Z","abstract_excerpt":"The problem of checking satisfiability of linear real arithmetic (LRA) and non-linear real arithmetic (NRA) formulas has broad applications, in particular, they are at the heart of logic-related applications such as logic for artificial intelligence, program analysis, etc. While there has been much work on checking satisfiability of unquantified LRA and NRA formulas, the problem of checking satisfiability of quantified LRA and NRA formulas remains a significant challenge. The main bottleneck in the existing methods is a computationally expensive quantifier elimination step. In this work, we pr"},"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":"2412.16226","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-12-18T14:37:15Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"caaad1b32659bb2a9dc9a54707ff0580821af6ec618755d289dca1ae369e6c38","abstract_canon_sha256":"70b801f0e23a8400928088ccbf119b2f21f11fec59ea39c0e635fbb4adfa7a25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:52:43.314066Z","signature_b64":"TYpTzCIwWdmu95qvLwy1jS/Bu/P0J3j3FhclIA7ev53OO23WUSS35pJoKUFSei+GmMZd1fFrLi9uHeJVg3ETCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b4e9decd952fce2f07ed2655691d2e9bce1d66251d5bbe3bce8af5b3e582d34","last_reissued_at":"2026-07-05T09:52:43.313640Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:52:43.313640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"{\\DJ}or{\\dj}e \\v{Z}ikeli\\'c, Ehsan Kafshdar Goharshady, Harshit J Motwani, Krishnendu Chatterjee, Maximilian Seeliger, Mehrdad Karrabi","submitted_at":"2024-12-18T14:37:15Z","abstract_excerpt":"The problem of checking satisfiability of linear real arithmetic (LRA) and non-linear real arithmetic (NRA) formulas has broad applications, in particular, they are at the heart of logic-related applications such as logic for artificial intelligence, program analysis, etc. While there has been much work on checking satisfiability of unquantified LRA and NRA formulas, the problem of checking satisfiability of quantified LRA and NRA formulas remains a significant challenge. The main bottleneck in the existing methods is a computationally expensive quantifier elimination step. In this work, we pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.16226","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/2412.16226/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":"2412.16226","created_at":"2026-07-05T09:52:43.313698+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.16226v1","created_at":"2026-07-05T09:52:43.313698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.16226","created_at":"2026-07-05T09:52:43.313698+00:00"},{"alias_kind":"pith_short_12","alias_value":"JNHJ33GZKL6O","created_at":"2026-07-05T09:52:43.313698+00:00"},{"alias_kind":"pith_short_16","alias_value":"JNHJ33GZKL6OF4D6","created_at":"2026-07-05T09:52:43.313698+00:00"},{"alias_kind":"pith_short_8","alias_value":"JNHJ33GZ","created_at":"2026-07-05T09:52:43.313698+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/JNHJ33GZKL6OF4D62JSVNEOS5G","json":"https://pith.science/pith/JNHJ33GZKL6OF4D62JSVNEOS5G.json","graph_json":"https://pith.science/api/pith-number/JNHJ33GZKL6OF4D62JSVNEOS5G/graph.json","events_json":"https://pith.science/api/pith-number/JNHJ33GZKL6OF4D62JSVNEOS5G/events.json","paper":"https://pith.science/paper/JNHJ33GZ"},"agent_actions":{"view_html":"https://pith.science/pith/JNHJ33GZKL6OF4D62JSVNEOS5G","download_json":"https://pith.science/pith/JNHJ33GZKL6OF4D62JSVNEOS5G.json","view_paper":"https://pith.science/paper/JNHJ33GZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.16226&json=true","fetch_graph":"https://pith.science/api/pith-number/JNHJ33GZKL6OF4D62JSVNEOS5G/graph.json","fetch_events":"https://pith.science/api/pith-number/JNHJ33GZKL6OF4D62JSVNEOS5G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JNHJ33GZKL6OF4D62JSVNEOS5G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JNHJ33GZKL6OF4D62JSVNEOS5G/action/storage_attestation","attest_author":"https://pith.science/pith/JNHJ33GZKL6OF4D62JSVNEOS5G/action/author_attestation","sign_citation":"https://pith.science/pith/JNHJ33GZKL6OF4D62JSVNEOS5G/action/citation_signature","submit_replication":"https://pith.science/pith/JNHJ33GZKL6OF4D62JSVNEOS5G/action/replication_record"}},"created_at":"2026-07-05T09:52:43.313698+00:00","updated_at":"2026-07-05T09:52:43.313698+00:00"}