{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:G7TWRWYT7KPDUYOL4WOJQM4IZV","short_pith_number":"pith:G7TWRWYT","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"},"canonical_sha256":"37e768db13fa9e3a61cbe59c983388cd55e380418188fc01cac7904035beda5f","source":{"kind":"arxiv","id":"2503.05945","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.05945","created_at":"2026-07-05T10:26:49Z"},{"alias_kind":"arxiv_version","alias_value":"2503.05945v1","created_at":"2026-07-05T10:26:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.05945","created_at":"2026-07-05T10:26:49Z"},{"alias_kind":"pith_short_12","alias_value":"G7TWRWYT7KPD","created_at":"2026-07-05T10:26:49Z"},{"alias_kind":"pith_short_16","alias_value":"G7TWRWYT7KPDUYOL","created_at":"2026-07-05T10:26:49Z"},{"alias_kind":"pith_short_8","alias_value":"G7TWRWYT","created_at":"2026-07-05T10:26:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:G7TWRWYT7KPDUYOL4WOJQM4IZV","target":"record","payload":{"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"},"canonical_sha256":"37e768db13fa9e3a61cbe59c983388cd55e380418188fc01cac7904035beda5f","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"},"source_kind":"arxiv","source_id":"2503.05945","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:26:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"guv5sQObx9RMUukGyjYVzHNc6AGos3tKVPUSwKXVW1x+vd4kDgf1ZKXp5zJBX0h6/driV1bwJp4FeL3IAsW/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T10:55:35.871496Z"},"content_sha256":"1bdddfcb1aefe457bd152b858ccc62ce8561bf27110542fa1a27b14ff9a30d9c","schema_version":"1.0","event_id":"sha256:1bdddfcb1aefe457bd152b858ccc62ce8561bf27110542fa1a27b14ff9a30d9c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:G7TWRWYT7KPDUYOL4WOJQM4IZV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:26:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RlPM4shnRrVR+0YfhKEPAaLrHV0SOyHZvDENBVhO4UIIeKOFpVwaqEgfrAG9JbcxWMCMBw0LWRtQh/v6NIqtBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T10:55:35.872003Z"},"content_sha256":"3e207ed35dab0ba146d5dc3c10b219bb9b0841062f1540bc1d64f71dddfc174e","schema_version":"1.0","event_id":"sha256:3e207ed35dab0ba146d5dc3c10b219bb9b0841062f1540bc1d64f71dddfc174e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G7TWRWYT7KPDUYOL4WOJQM4IZV/bundle.json","state_url":"https://pith.science/pith/G7TWRWYT7KPDUYOL4WOJQM4IZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G7TWRWYT7KPDUYOL4WOJQM4IZV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-23T10:55:35Z","links":{"resolver":"https://pith.science/pith/G7TWRWYT7KPDUYOL4WOJQM4IZV","bundle":"https://pith.science/pith/G7TWRWYT7KPDUYOL4WOJQM4IZV/bundle.json","state":"https://pith.science/pith/G7TWRWYT7KPDUYOL4WOJQM4IZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G7TWRWYT7KPDUYOL4WOJQM4IZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:G7TWRWYT7KPDUYOL4WOJQM4IZV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9214ab15d404239c233ca8cebddee0cfbc0396847c2c7795a143eba8f3b06762","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2025-03-07T21:23:02Z","title_canon_sha256":"5bb48617535b4f5e26a98b6388c64602397f0252b415eb56667f2600fd65e11d"},"schema_version":"1.0","source":{"id":"2503.05945","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.05945","created_at":"2026-07-05T10:26:49Z"},{"alias_kind":"arxiv_version","alias_value":"2503.05945v1","created_at":"2026-07-05T10:26:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.05945","created_at":"2026-07-05T10:26:49Z"},{"alias_kind":"pith_short_12","alias_value":"G7TWRWYT7KPD","created_at":"2026-07-05T10:26:49Z"},{"alias_kind":"pith_short_16","alias_value":"G7TWRWYT7KPDUYOL","created_at":"2026-07-05T10:26:49Z"},{"alias_kind":"pith_short_8","alias_value":"G7TWRWYT","created_at":"2026-07-05T10:26:49Z"}],"graph_snapshots":[{"event_id":"sha256:3e207ed35dab0ba146d5dc3c10b219bb9b0841062f1540bc1d64f71dddfc174e","target":"graph","created_at":"2026-07-05T10:26:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.05945/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Anastasios Antoniadis, Ilias Tsatiris, Nevill Grech, Yannis Smaragdakis","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2025-03-07T21:23:02Z","title":"Universal Scalability in Declarative Program Analysis (with Choice-Based Combination Pruning)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.05945","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1bdddfcb1aefe457bd152b858ccc62ce8561bf27110542fa1a27b14ff9a30d9c","target":"record","created_at":"2026-07-05T10:26:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9214ab15d404239c233ca8cebddee0cfbc0396847c2c7795a143eba8f3b06762","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2025-03-07T21:23:02Z","title_canon_sha256":"5bb48617535b4f5e26a98b6388c64602397f0252b415eb56667f2600fd65e11d"},"schema_version":"1.0","source":{"id":"2503.05945","kind":"arxiv","version":1}},"canonical_sha256":"37e768db13fa9e3a61cbe59c983388cd55e380418188fc01cac7904035beda5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37e768db13fa9e3a61cbe59c983388cd55e380418188fc01cac7904035beda5f","first_computed_at":"2026-07-05T10:26:49.809369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:26:49.809369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"184VOFcJK9+LyD55WniAKcLnpM+EZ3a3MkmeEkKoSvC/+cuKEOVf4UzzGInhOGir3D520DQoFzagp1hinOsaBg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:26:49.809858Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.05945","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bdddfcb1aefe457bd152b858ccc62ce8561bf27110542fa1a27b14ff9a30d9c","sha256:3e207ed35dab0ba146d5dc3c10b219bb9b0841062f1540bc1d64f71dddfc174e"],"state_sha256":"9e1ce3464021535791c68230a459ac012c03b1a50a4861a34d7f5778a05e31eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aebz/pYwiMaRqNqMMDdxM6HFZ4YnP+9K8hMa3VvtsNy1TOFr1EnoZjLi6FqOJACiCha49r/eua5c3fDmYriUDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T10:55:35.876789Z","bundle_sha256":"e1facfd7eeb6137640f207ee461472e4186d323df661f1752a6994a455ae659e"}}