{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:SBCZQEEPWZPDMII2BZUWWDRGRE","short_pith_number":"pith:SBCZQEEP","canonical_record":{"source":{"id":"2309.12436","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2023-09-21T19:07:49Z","cross_cats_sorted":[],"title_canon_sha256":"5e55b451623d5531f7cf74c83aa884954c9e5cb0ad7ca956547e604bcf692021","abstract_canon_sha256":"f677ba6af971618b1c29c8fe402c39cf87ca4e29ab78e47c3533de37e46f008e"},"schema_version":"1.0"},"canonical_sha256":"904598108fb65e36211a0e696b0e268920663f8bda7b15dc1d2964c789920e9a","source":{"kind":"arxiv","id":"2309.12436","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.12436","created_at":"2026-07-05T06:53:12Z"},{"alias_kind":"arxiv_version","alias_value":"2309.12436v1","created_at":"2026-07-05T06:53:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.12436","created_at":"2026-07-05T06:53:12Z"},{"alias_kind":"pith_short_12","alias_value":"SBCZQEEPWZPD","created_at":"2026-07-05T06:53:12Z"},{"alias_kind":"pith_short_16","alias_value":"SBCZQEEPWZPDMII2","created_at":"2026-07-05T06:53:12Z"},{"alias_kind":"pith_short_8","alias_value":"SBCZQEEP","created_at":"2026-07-05T06:53:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:SBCZQEEPWZPDMII2BZUWWDRGRE","target":"record","payload":{"canonical_record":{"source":{"id":"2309.12436","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2023-09-21T19:07:49Z","cross_cats_sorted":[],"title_canon_sha256":"5e55b451623d5531f7cf74c83aa884954c9e5cb0ad7ca956547e604bcf692021","abstract_canon_sha256":"f677ba6af971618b1c29c8fe402c39cf87ca4e29ab78e47c3533de37e46f008e"},"schema_version":"1.0"},"canonical_sha256":"904598108fb65e36211a0e696b0e268920663f8bda7b15dc1d2964c789920e9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:53:12.749477Z","signature_b64":"0UT9s5KufsX3jpDlogSugUm+BDJ2rmPe8/ymSktLUg1M6i/Fu31jlJsG4npAptfurIs6EVM71zrRTSD8QJuQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"904598108fb65e36211a0e696b0e268920663f8bda7b15dc1d2964c789920e9a","last_reissued_at":"2026-07-05T06:53:12.748976Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:53:12.748976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.12436","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-05T06:53:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IsMH50sx26z8GnWCD7RmqYLyokzhtSWmJ27HkmbLwE8OYAGgT9I+TkkrAvjY2AWfOFfIX4r/SzE0hyZx3uV0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:02:06.795073Z"},"content_sha256":"0fcf396d0cea81a5cd1c2f173514906af690995276ab39b40b3b97c8e33d5514","schema_version":"1.0","event_id":"sha256:0fcf396d0cea81a5cd1c2f173514906af690995276ab39b40b3b97c8e33d5514"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:SBCZQEEPWZPDMII2BZUWWDRGRE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rapidash: Efficient Constraint Discovery via Rapid Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Anna Fariha, Ashish Tiwari, Avrilia Floratou, Fotis Psallidas, Shaleen Deep, Zifan Liu","submitted_at":"2023-09-21T19:07:49Z","abstract_excerpt":"Denial Constraint (DC) is a well-established formalism that captures a wide range of integrity constraints commonly encountered, including candidate keys, functional dependencies, and ordering constraints, among others. Given their significance, there has been considerable research interest in achieving fast verification and discovery of exact DCs within the database community. Despite the significant advancements in the field, prior work exhibits notable limitations when confronted with large-scale datasets. The current state-of-the-art exact DC verification algorithm demonstrates a quadratic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.12436","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/2309.12436/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-05T06:53:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iguS4X0S1BLdaQUcIXw6ThJxKOboYsCBeG8JCyFNcenolzwGxDlkN9z3iYQ6IzRb7Ig4OrQWysPUw8z1fgl0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:02:06.795470Z"},"content_sha256":"26b4c918a64b38c3c1b10f46946f8185aa2cbabf8059ce1435abe59c035ad4a4","schema_version":"1.0","event_id":"sha256:26b4c918a64b38c3c1b10f46946f8185aa2cbabf8059ce1435abe59c035ad4a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBCZQEEPWZPDMII2BZUWWDRGRE/bundle.json","state_url":"https://pith.science/pith/SBCZQEEPWZPDMII2BZUWWDRGRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBCZQEEPWZPDMII2BZUWWDRGRE/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-09T06:02:06Z","links":{"resolver":"https://pith.science/pith/SBCZQEEPWZPDMII2BZUWWDRGRE","bundle":"https://pith.science/pith/SBCZQEEPWZPDMII2BZUWWDRGRE/bundle.json","state":"https://pith.science/pith/SBCZQEEPWZPDMII2BZUWWDRGRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBCZQEEPWZPDMII2BZUWWDRGRE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:SBCZQEEPWZPDMII2BZUWWDRGRE","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":"f677ba6af971618b1c29c8fe402c39cf87ca4e29ab78e47c3533de37e46f008e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2023-09-21T19:07:49Z","title_canon_sha256":"5e55b451623d5531f7cf74c83aa884954c9e5cb0ad7ca956547e604bcf692021"},"schema_version":"1.0","source":{"id":"2309.12436","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.12436","created_at":"2026-07-05T06:53:12Z"},{"alias_kind":"arxiv_version","alias_value":"2309.12436v1","created_at":"2026-07-05T06:53:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.12436","created_at":"2026-07-05T06:53:12Z"},{"alias_kind":"pith_short_12","alias_value":"SBCZQEEPWZPD","created_at":"2026-07-05T06:53:12Z"},{"alias_kind":"pith_short_16","alias_value":"SBCZQEEPWZPDMII2","created_at":"2026-07-05T06:53:12Z"},{"alias_kind":"pith_short_8","alias_value":"SBCZQEEP","created_at":"2026-07-05T06:53:12Z"}],"graph_snapshots":[{"event_id":"sha256:26b4c918a64b38c3c1b10f46946f8185aa2cbabf8059ce1435abe59c035ad4a4","target":"graph","created_at":"2026-07-05T06:53:12Z","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/2309.12436/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Denial Constraint (DC) is a well-established formalism that captures a wide range of integrity constraints commonly encountered, including candidate keys, functional dependencies, and ordering constraints, among others. Given their significance, there has been considerable research interest in achieving fast verification and discovery of exact DCs within the database community. Despite the significant advancements in the field, prior work exhibits notable limitations when confronted with large-scale datasets. The current state-of-the-art exact DC verification algorithm demonstrates a quadratic","authors_text":"Anna Fariha, Ashish Tiwari, Avrilia Floratou, Fotis Psallidas, Shaleen Deep, Zifan Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2023-09-21T19:07:49Z","title":"Rapidash: Efficient Constraint Discovery via Rapid Verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.12436","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:0fcf396d0cea81a5cd1c2f173514906af690995276ab39b40b3b97c8e33d5514","target":"record","created_at":"2026-07-05T06:53:12Z","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":"f677ba6af971618b1c29c8fe402c39cf87ca4e29ab78e47c3533de37e46f008e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2023-09-21T19:07:49Z","title_canon_sha256":"5e55b451623d5531f7cf74c83aa884954c9e5cb0ad7ca956547e604bcf692021"},"schema_version":"1.0","source":{"id":"2309.12436","kind":"arxiv","version":1}},"canonical_sha256":"904598108fb65e36211a0e696b0e268920663f8bda7b15dc1d2964c789920e9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"904598108fb65e36211a0e696b0e268920663f8bda7b15dc1d2964c789920e9a","first_computed_at":"2026-07-05T06:53:12.748976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:53:12.748976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0UT9s5KufsX3jpDlogSugUm+BDJ2rmPe8/ymSktLUg1M6i/Fu31jlJsG4npAptfurIs6EVM71zrRTSD8QJuQDA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:53:12.749477Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.12436","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fcf396d0cea81a5cd1c2f173514906af690995276ab39b40b3b97c8e33d5514","sha256:26b4c918a64b38c3c1b10f46946f8185aa2cbabf8059ce1435abe59c035ad4a4"],"state_sha256":"6781fb2621e5c864e6eac0b658cae40e7fcd2280ec837287b32e8f8cb69c5625"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eggPpGjSsBiYBDc16V7P+l7YTOyWhC1PMr8rTDyEzfQ3caWElaOb4LmdIuQzvyQYRnwvC6x10u6M9xSS6aMgAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T06:02:06.797785Z","bundle_sha256":"ddfc87572bd6c8a3d0f305a26c48a3b8f689140806a04c978e448f47792adf3a"}}