{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:6O7ZBZXODJAU5TLD3D6USCCCZ5","short_pith_number":"pith:6O7ZBZXO","canonical_record":{"source":{"id":"2004.04139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-04-08T17:50:18Z","cross_cats_sorted":[],"title_canon_sha256":"389312f3ef431a2327f14d87f28a230b4a24560a64d5ee1836aafa2716628153","abstract_canon_sha256":"0d622bb139ee50ab54205331eb8dfb77014c5ff48f54bed68fc09ceb2f7d8fbe"},"schema_version":"1.0"},"canonical_sha256":"f3bf90e6ee1a414ecd63d8fd490842cf485af434fdb27af56f12a5e44b929991","source":{"kind":"arxiv","id":"2004.04139","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.04139","created_at":"2026-07-05T00:53:59Z"},{"alias_kind":"arxiv_version","alias_value":"2004.04139v1","created_at":"2026-07-05T00:53:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.04139","created_at":"2026-07-05T00:53:59Z"},{"alias_kind":"pith_short_12","alias_value":"6O7ZBZXODJAU","created_at":"2026-07-05T00:53:59Z"},{"alias_kind":"pith_short_16","alias_value":"6O7ZBZXODJAU5TLD","created_at":"2026-07-05T00:53:59Z"},{"alias_kind":"pith_short_8","alias_value":"6O7ZBZXO","created_at":"2026-07-05T00:53:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:6O7ZBZXODJAU5TLD3D6USCCCZ5","target":"record","payload":{"canonical_record":{"source":{"id":"2004.04139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-04-08T17:50:18Z","cross_cats_sorted":[],"title_canon_sha256":"389312f3ef431a2327f14d87f28a230b4a24560a64d5ee1836aafa2716628153","abstract_canon_sha256":"0d622bb139ee50ab54205331eb8dfb77014c5ff48f54bed68fc09ceb2f7d8fbe"},"schema_version":"1.0"},"canonical_sha256":"f3bf90e6ee1a414ecd63d8fd490842cf485af434fdb27af56f12a5e44b929991","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:53:59.317403Z","signature_b64":"2aYpRPC1kdS/QVigJx3wNfbVQfGjQ/ngfD6R2JybvNA44Rc1OMz4jpmxDSMACB8g1v7MmAGbwgZaNpN6e3zEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3bf90e6ee1a414ecd63d8fd490842cf485af434fdb27af56f12a5e44b929991","last_reissued_at":"2026-07-05T00:53:59.316958Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:53:59.316958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.04139","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-05T00:53:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZlD6k5GDFcg3/opapi2bisFVQx9D4R3SK22tHoNmG/ohxJd8/sU1XQNQPtPYDsrcOEI7NnmSjeutTkQ4qxi8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:33:28.720033Z"},"content_sha256":"f25ed06f005de2daf2253d76ac21b9a4085b980d45d2d7864d01275bd3f0f39e","schema_version":"1.0","event_id":"sha256:f25ed06f005de2daf2253d76ac21b9a4085b980d45d2d7864d01275bd3f0f39e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:6O7ZBZXODJAU5TLD3D6USCCCZ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and Reliable Missing Data Contingency Analysis with Predicate-Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Aaron J. Elmore, Michael J. Franklin, Sanjay Krishnan, Xi Liang, Zechao Shang","submitted_at":"2020-04-08T17:50:18Z","abstract_excerpt":"Today, data analysts largely rely on intuition to determine whether missing or withheld rows of a dataset significantly affect their analyses. We propose a framework that can produce automatic contingency analysis, i.e., the range of values an aggregate SQL query could take, under formal constraints describing the variation and frequency of missing data tuples. We describe how to process SUM, COUNT, AVG, MIN, and MAX queries in these conditions resulting in hard error bounds with testable constraints. We propose an optimization algorithm based on an integer program that reconciles a set of suc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.04139","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/2004.04139/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-05T00:53:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RnaoDbXn7ym3R2nLrWv3U5Q6ipXPaCD1Q31HAR8fSKHbG5BtQvMR3jd4w+2sfx6MNRJm5ThJ6Xr/2DQnj4NTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:33:28.720452Z"},"content_sha256":"075ae019c28e0622a608512ff9275be8fdff391e8f119a9a7775ff6e4f4948ac","schema_version":"1.0","event_id":"sha256:075ae019c28e0622a608512ff9275be8fdff391e8f119a9a7775ff6e4f4948ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6O7ZBZXODJAU5TLD3D6USCCCZ5/bundle.json","state_url":"https://pith.science/pith/6O7ZBZXODJAU5TLD3D6USCCCZ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6O7ZBZXODJAU5TLD3D6USCCCZ5/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-07-07T05:33:28Z","links":{"resolver":"https://pith.science/pith/6O7ZBZXODJAU5TLD3D6USCCCZ5","bundle":"https://pith.science/pith/6O7ZBZXODJAU5TLD3D6USCCCZ5/bundle.json","state":"https://pith.science/pith/6O7ZBZXODJAU5TLD3D6USCCCZ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6O7ZBZXODJAU5TLD3D6USCCCZ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:6O7ZBZXODJAU5TLD3D6USCCCZ5","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":"0d622bb139ee50ab54205331eb8dfb77014c5ff48f54bed68fc09ceb2f7d8fbe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-04-08T17:50:18Z","title_canon_sha256":"389312f3ef431a2327f14d87f28a230b4a24560a64d5ee1836aafa2716628153"},"schema_version":"1.0","source":{"id":"2004.04139","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.04139","created_at":"2026-07-05T00:53:59Z"},{"alias_kind":"arxiv_version","alias_value":"2004.04139v1","created_at":"2026-07-05T00:53:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.04139","created_at":"2026-07-05T00:53:59Z"},{"alias_kind":"pith_short_12","alias_value":"6O7ZBZXODJAU","created_at":"2026-07-05T00:53:59Z"},{"alias_kind":"pith_short_16","alias_value":"6O7ZBZXODJAU5TLD","created_at":"2026-07-05T00:53:59Z"},{"alias_kind":"pith_short_8","alias_value":"6O7ZBZXO","created_at":"2026-07-05T00:53:59Z"}],"graph_snapshots":[{"event_id":"sha256:075ae019c28e0622a608512ff9275be8fdff391e8f119a9a7775ff6e4f4948ac","target":"graph","created_at":"2026-07-05T00:53:59Z","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/2004.04139/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Today, data analysts largely rely on intuition to determine whether missing or withheld rows of a dataset significantly affect their analyses. We propose a framework that can produce automatic contingency analysis, i.e., the range of values an aggregate SQL query could take, under formal constraints describing the variation and frequency of missing data tuples. We describe how to process SUM, COUNT, AVG, MIN, and MAX queries in these conditions resulting in hard error bounds with testable constraints. We propose an optimization algorithm based on an integer program that reconciles a set of suc","authors_text":"Aaron J. Elmore, Michael J. Franklin, Sanjay Krishnan, Xi Liang, Zechao Shang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-04-08T17:50:18Z","title":"Fast and Reliable Missing Data Contingency Analysis with Predicate-Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.04139","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:f25ed06f005de2daf2253d76ac21b9a4085b980d45d2d7864d01275bd3f0f39e","target":"record","created_at":"2026-07-05T00:53:59Z","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":"0d622bb139ee50ab54205331eb8dfb77014c5ff48f54bed68fc09ceb2f7d8fbe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-04-08T17:50:18Z","title_canon_sha256":"389312f3ef431a2327f14d87f28a230b4a24560a64d5ee1836aafa2716628153"},"schema_version":"1.0","source":{"id":"2004.04139","kind":"arxiv","version":1}},"canonical_sha256":"f3bf90e6ee1a414ecd63d8fd490842cf485af434fdb27af56f12a5e44b929991","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3bf90e6ee1a414ecd63d8fd490842cf485af434fdb27af56f12a5e44b929991","first_computed_at":"2026-07-05T00:53:59.316958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:53:59.316958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2aYpRPC1kdS/QVigJx3wNfbVQfGjQ/ngfD6R2JybvNA44Rc1OMz4jpmxDSMACB8g1v7MmAGbwgZaNpN6e3zEDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:53:59.317403Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.04139","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f25ed06f005de2daf2253d76ac21b9a4085b980d45d2d7864d01275bd3f0f39e","sha256:075ae019c28e0622a608512ff9275be8fdff391e8f119a9a7775ff6e4f4948ac"],"state_sha256":"800c98f7931526f9375f9fd7843e7109d9417dcd165174479f00db919d76f43e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jQU7Bh+xBzJt0s0lziaqR/uv4Xb58fEs7HMr96DS1pHuAzDEO/b+ycJf8ovU/54jWP/0Sm3uM5K7P+8XPVKXDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T05:33:28.722838Z","bundle_sha256":"f38bf970382909d70f33c328a8d6b7ab0670b5e07359a235b46cead942aa23e0"}}