{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XX4DH74SGFJJQBWBXPVGMYARG6","short_pith_number":"pith:XX4DH74S","schema_version":"1.0","canonical_sha256":"bdf833ff9231529806c1bbea666011379bf5d3cb4637911bef5cd06cc4097d17","source":{"kind":"arxiv","id":"2606.21983","version":1},"attestation_state":"computed","paper":{"title":"Shared-Context Batched Satisfiability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Hanrui Zuo, Hanyun Jiang, Jiening Siow, Peisen Yao, Weiqi Wang","submitted_at":"2026-06-20T10:38:18Z","abstract_excerpt":"Program analyzers often issue batches of SMT queries that share a large symbolic context and differ only in a small predicate. We formalize this recurring pattern as \\emph{Shared-Context Batched Satisfiability}: given a formula $\\varphi$ and predicates $P$, determine whether $\\varphi \\land p$ is satisfiable for each $p \\in P$. We study three theory-agnostic strategies for this problem: predicate-by-predicate checking, disjunctive over-approximation, and Core-Literal Filter (CLF), a new algorithm that learns literals inconsistent with $\\varphi$ and uses them to reject later predicates. Our eval"},"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":"2606.21983","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-06-20T10:38:18Z","cross_cats_sorted":[],"title_canon_sha256":"d3cd1eae064bdbb43bc510e8e9ee4afb7061e24ad6c4b5b24b912e4fbd2679dc","abstract_canon_sha256":"37157993702ef679000dd4fb736239217cdef871a27b9c021075464af0ff7c40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:04.923544Z","signature_b64":"uA/VyN217WyzNiRR4Da1iQSQbShaKSEv9nxEPKrJi8VlcG1Ut4kx/HG/JxRD2VkoKOJGVJEi/99uNU0YaEk0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdf833ff9231529806c1bbea666011379bf5d3cb4637911bef5cd06cc4097d17","last_reissued_at":"2026-06-23T02:13:04.923127Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:04.923127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shared-Context Batched Satisfiability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Hanrui Zuo, Hanyun Jiang, Jiening Siow, Peisen Yao, Weiqi Wang","submitted_at":"2026-06-20T10:38:18Z","abstract_excerpt":"Program analyzers often issue batches of SMT queries that share a large symbolic context and differ only in a small predicate. We formalize this recurring pattern as \\emph{Shared-Context Batched Satisfiability}: given a formula $\\varphi$ and predicates $P$, determine whether $\\varphi \\land p$ is satisfiable for each $p \\in P$. We study three theory-agnostic strategies for this problem: predicate-by-predicate checking, disjunctive over-approximation, and Core-Literal Filter (CLF), a new algorithm that learns literals inconsistent with $\\varphi$ and uses them to reject later predicates. Our eval"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21983","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/2606.21983/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":"2606.21983","created_at":"2026-06-23T02:13:04.923192+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.21983v1","created_at":"2026-06-23T02:13:04.923192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21983","created_at":"2026-06-23T02:13:04.923192+00:00"},{"alias_kind":"pith_short_12","alias_value":"XX4DH74SGFJJ","created_at":"2026-06-23T02:13:04.923192+00:00"},{"alias_kind":"pith_short_16","alias_value":"XX4DH74SGFJJQBWB","created_at":"2026-06-23T02:13:04.923192+00:00"},{"alias_kind":"pith_short_8","alias_value":"XX4DH74S","created_at":"2026-06-23T02:13:04.923192+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/XX4DH74SGFJJQBWBXPVGMYARG6","json":"https://pith.science/pith/XX4DH74SGFJJQBWBXPVGMYARG6.json","graph_json":"https://pith.science/api/pith-number/XX4DH74SGFJJQBWBXPVGMYARG6/graph.json","events_json":"https://pith.science/api/pith-number/XX4DH74SGFJJQBWBXPVGMYARG6/events.json","paper":"https://pith.science/paper/XX4DH74S"},"agent_actions":{"view_html":"https://pith.science/pith/XX4DH74SGFJJQBWBXPVGMYARG6","download_json":"https://pith.science/pith/XX4DH74SGFJJQBWBXPVGMYARG6.json","view_paper":"https://pith.science/paper/XX4DH74S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.21983&json=true","fetch_graph":"https://pith.science/api/pith-number/XX4DH74SGFJJQBWBXPVGMYARG6/graph.json","fetch_events":"https://pith.science/api/pith-number/XX4DH74SGFJJQBWBXPVGMYARG6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XX4DH74SGFJJQBWBXPVGMYARG6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XX4DH74SGFJJQBWBXPVGMYARG6/action/storage_attestation","attest_author":"https://pith.science/pith/XX4DH74SGFJJQBWBXPVGMYARG6/action/author_attestation","sign_citation":"https://pith.science/pith/XX4DH74SGFJJQBWBXPVGMYARG6/action/citation_signature","submit_replication":"https://pith.science/pith/XX4DH74SGFJJQBWBXPVGMYARG6/action/replication_record"}},"created_at":"2026-06-23T02:13:04.923192+00:00","updated_at":"2026-06-23T02:13:04.923192+00:00"}