{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:G7TWRWYT7KPDUYOL4WOJQM4IZV","short_pith_number":"pith:G7TWRWYT","schema_version":"1.0","canonical_sha256":"37e768db13fa9e3a61cbe59c983388cd55e380418188fc01cac7904035beda5f","source":{"kind":"arxiv","id":"2503.05945","version":1},"attestation_state":"computed","paper":{"title":"Universal Scalability in Declarative Program Analysis (with Choice-Based Combination Pruning)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Anastasios Antoniadis, Ilias Tsatiris, Nevill Grech, Yannis Smaragdakis","submitted_at":"2025-03-07T21:23:02Z","abstract_excerpt":"In this work, we present a simple, uniform, and elegant solution to the problem, with stunning practical effectiveness and application to virtually any Datalog-based analysis. The approach consists of leveraging the choice construct, supported natively in modern Datalog engines like Souffl\\'e. The choice construct allows the definition of functional dependencies in a relation and has been used in the past for expressing worklist algorithms. We show a near-universal construction that allows the choice construct to flexibly limit evaluation of predicates. The technique is applicable to practical"},"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":"2503.05945","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2025-03-07T21:23:02Z","cross_cats_sorted":[],"title_canon_sha256":"5bb48617535b4f5e26a98b6388c64602397f0252b415eb56667f2600fd65e11d","abstract_canon_sha256":"9214ab15d404239c233ca8cebddee0cfbc0396847c2c7795a143eba8f3b06762"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:26:49.809858Z","signature_b64":"184VOFcJK9+LyD55WniAKcLnpM+EZ3a3MkmeEkKoSvC/+cuKEOVf4UzzGInhOGir3D520DQoFzagp1hinOsaBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37e768db13fa9e3a61cbe59c983388cd55e380418188fc01cac7904035beda5f","last_reissued_at":"2026-07-05T10:26:49.809369Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:26:49.809369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Scalability in Declarative Program Analysis (with Choice-Based Combination Pruning)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Anastasios Antoniadis, Ilias Tsatiris, Nevill Grech, Yannis Smaragdakis","submitted_at":"2025-03-07T21:23:02Z","abstract_excerpt":"In this work, we present a simple, uniform, and elegant solution to the problem, with stunning practical effectiveness and application to virtually any Datalog-based analysis. The approach consists of leveraging the choice construct, supported natively in modern Datalog engines like Souffl\\'e. The choice construct allows the definition of functional dependencies in a relation and has been used in the past for expressing worklist algorithms. We show a near-universal construction that allows the choice construct to flexibly limit evaluation of predicates. The technique is applicable to practical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.05945","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/2503.05945/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":"2503.05945","created_at":"2026-07-05T10:26:49.809431+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.05945v1","created_at":"2026-07-05T10:26:49.809431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.05945","created_at":"2026-07-05T10:26:49.809431+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7TWRWYT7KPD","created_at":"2026-07-05T10:26:49.809431+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7TWRWYT7KPDUYOL","created_at":"2026-07-05T10:26:49.809431+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7TWRWYT","created_at":"2026-07-05T10:26:49.809431+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/G7TWRWYT7KPDUYOL4WOJQM4IZV","json":"https://pith.science/pith/G7TWRWYT7KPDUYOL4WOJQM4IZV.json","graph_json":"https://pith.science/api/pith-number/G7TWRWYT7KPDUYOL4WOJQM4IZV/graph.json","events_json":"https://pith.science/api/pith-number/G7TWRWYT7KPDUYOL4WOJQM4IZV/events.json","paper":"https://pith.science/paper/G7TWRWYT"},"agent_actions":{"view_html":"https://pith.science/pith/G7TWRWYT7KPDUYOL4WOJQM4IZV","download_json":"https://pith.science/pith/G7TWRWYT7KPDUYOL4WOJQM4IZV.json","view_paper":"https://pith.science/paper/G7TWRWYT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.05945&json=true","fetch_graph":"https://pith.science/api/pith-number/G7TWRWYT7KPDUYOL4WOJQM4IZV/graph.json","fetch_events":"https://pith.science/api/pith-number/G7TWRWYT7KPDUYOL4WOJQM4IZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7TWRWYT7KPDUYOL4WOJQM4IZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7TWRWYT7KPDUYOL4WOJQM4IZV/action/storage_attestation","attest_author":"https://pith.science/pith/G7TWRWYT7KPDUYOL4WOJQM4IZV/action/author_attestation","sign_citation":"https://pith.science/pith/G7TWRWYT7KPDUYOL4WOJQM4IZV/action/citation_signature","submit_replication":"https://pith.science/pith/G7TWRWYT7KPDUYOL4WOJQM4IZV/action/replication_record"}},"created_at":"2026-07-05T10:26:49.809431+00:00","updated_at":"2026-07-05T10:26:49.809431+00:00"}