{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:W2FE2EQBLPGOEBWWS6V2NW2ZZ6","short_pith_number":"pith:W2FE2EQB","canonical_record":{"source":{"id":"1705.09391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-05-25T23:00:46Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"title_canon_sha256":"a903515ddadceb71d8af06ada62c4522742f252fe6b7bff1b25e23d85f2261db","abstract_canon_sha256":"95badd606cd72d804b91ab293d6ea9881492d44f8b3039fa49c009193502cf50"},"schema_version":"1.0"},"canonical_sha256":"b68a4d12015bcce206d697aba6db59cfb293d863911e2ed0168c7431a609a203","source":{"kind":"arxiv","id":"1705.09391","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09391","created_at":"2026-05-18T00:42:11Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09391v2","created_at":"2026-05-18T00:42:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09391","created_at":"2026-05-18T00:42:11Z"},{"alias_kind":"pith_short_12","alias_value":"W2FE2EQBLPGO","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"W2FE2EQBLPGOEBWW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"W2FE2EQB","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:W2FE2EQBLPGOEBWWS6V2NW2ZZ6","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-05-25T23:00:46Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"title_canon_sha256":"a903515ddadceb71d8af06ada62c4522742f252fe6b7bff1b25e23d85f2261db","abstract_canon_sha256":"95badd606cd72d804b91ab293d6ea9881492d44f8b3039fa49c009193502cf50"},"schema_version":"1.0"},"canonical_sha256":"b68a4d12015bcce206d697aba6db59cfb293d863911e2ed0168c7431a609a203","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:11.930325Z","signature_b64":"9irz0ew1cEVq3griGeZAOGs+nePlBNbcQf5XpSaNA9latzz4Me+0ZsNgPC7DNjf5UGtVRWN4yHtEOoVW/biVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b68a4d12015bcce206d697aba6db59cfb293d863911e2ed0168c7431a609a203","last_reissued_at":"2026-05-18T00:42:11.929721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:11.929721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09391","source_version":2,"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-05-18T00:42:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x8Dbd3BBmtP8413Tv02dXNL84rci0dh4q18828CojaBN88YuHrXTk39NyToO18bTe/xQIygvPc5Fo3Fn/8HzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:04:07.567028Z"},"content_sha256":"159ed884c8df9cf1c1bf73395db4f091e38831db2cec59766534175e4a6c6d94","schema_version":"1.0","event_id":"sha256:159ed884c8df9cf1c1bf73395db4f091e38831db2cec59766534175e4a6c6d94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:W2FE2EQBLPGOEBWWS6V2NW2ZZ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discovering Reliable Approximate Functional Dependencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT"],"primary_cat":"cs.DB","authors_text":"Jilles Vreeken, Mario Boley, Panagiotis Mandros","submitted_at":"2017-05-25T23:00:46Z","abstract_excerpt":"Given a database and a target attribute of interest, how can we tell whether there exists a functional, or approximately functional dependence of the target on any set of other attributes in the data? How can we reliably, without bias to sample size or dimensionality, measure the strength of such a dependence? And, how can we efficiently discover the optimal or $\\alpha$-approximate top-$k$ dependencies? These are exactly the questions we answer in this paper.\n  As we want to be agnostic on the form of the dependence, we adopt an information-theoretic approach, and construct a reliable, bias co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09391","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:42:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S5nRLbgY4OeQ4XrDFSr1PnTty4zxCFx0J1R7uo+GVD4jYFO/CXV9kNbNfAczRus+Xj1a7ngvfbHCXgbUODimCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:04:07.567385Z"},"content_sha256":"e05c7545ba19c450dd2255baaca410a0cdb0f8c712db422afd447e15920202ba","schema_version":"1.0","event_id":"sha256:e05c7545ba19c450dd2255baaca410a0cdb0f8c712db422afd447e15920202ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W2FE2EQBLPGOEBWWS6V2NW2ZZ6/bundle.json","state_url":"https://pith.science/pith/W2FE2EQBLPGOEBWWS6V2NW2ZZ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W2FE2EQBLPGOEBWWS6V2NW2ZZ6/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-06-20T23:04:07Z","links":{"resolver":"https://pith.science/pith/W2FE2EQBLPGOEBWWS6V2NW2ZZ6","bundle":"https://pith.science/pith/W2FE2EQBLPGOEBWWS6V2NW2ZZ6/bundle.json","state":"https://pith.science/pith/W2FE2EQBLPGOEBWWS6V2NW2ZZ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W2FE2EQBLPGOEBWWS6V2NW2ZZ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:W2FE2EQBLPGOEBWWS6V2NW2ZZ6","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":"95badd606cd72d804b91ab293d6ea9881492d44f8b3039fa49c009193502cf50","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-05-25T23:00:46Z","title_canon_sha256":"a903515ddadceb71d8af06ada62c4522742f252fe6b7bff1b25e23d85f2261db"},"schema_version":"1.0","source":{"id":"1705.09391","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09391","created_at":"2026-05-18T00:42:11Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09391v2","created_at":"2026-05-18T00:42:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09391","created_at":"2026-05-18T00:42:11Z"},{"alias_kind":"pith_short_12","alias_value":"W2FE2EQBLPGO","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"W2FE2EQBLPGOEBWW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"W2FE2EQB","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:e05c7545ba19c450dd2255baaca410a0cdb0f8c712db422afd447e15920202ba","target":"graph","created_at":"2026-05-18T00:42:11Z","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"},"paper":{"abstract_excerpt":"Given a database and a target attribute of interest, how can we tell whether there exists a functional, or approximately functional dependence of the target on any set of other attributes in the data? How can we reliably, without bias to sample size or dimensionality, measure the strength of such a dependence? And, how can we efficiently discover the optimal or $\\alpha$-approximate top-$k$ dependencies? These are exactly the questions we answer in this paper.\n  As we want to be agnostic on the form of the dependence, we adopt an information-theoretic approach, and construct a reliable, bias co","authors_text":"Jilles Vreeken, Mario Boley, Panagiotis Mandros","cross_cats":["cs.AI","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-05-25T23:00:46Z","title":"Discovering Reliable Approximate Functional Dependencies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09391","kind":"arxiv","version":2},"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:159ed884c8df9cf1c1bf73395db4f091e38831db2cec59766534175e4a6c6d94","target":"record","created_at":"2026-05-18T00:42:11Z","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":"95badd606cd72d804b91ab293d6ea9881492d44f8b3039fa49c009193502cf50","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-05-25T23:00:46Z","title_canon_sha256":"a903515ddadceb71d8af06ada62c4522742f252fe6b7bff1b25e23d85f2261db"},"schema_version":"1.0","source":{"id":"1705.09391","kind":"arxiv","version":2}},"canonical_sha256":"b68a4d12015bcce206d697aba6db59cfb293d863911e2ed0168c7431a609a203","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b68a4d12015bcce206d697aba6db59cfb293d863911e2ed0168c7431a609a203","first_computed_at":"2026-05-18T00:42:11.929721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:11.929721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9irz0ew1cEVq3griGeZAOGs+nePlBNbcQf5XpSaNA9latzz4Me+0ZsNgPC7DNjf5UGtVRWN4yHtEOoVW/biVAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:11.930325Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09391","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:159ed884c8df9cf1c1bf73395db4f091e38831db2cec59766534175e4a6c6d94","sha256:e05c7545ba19c450dd2255baaca410a0cdb0f8c712db422afd447e15920202ba"],"state_sha256":"882de87803520e19bbdcce2d1ec354a662ba143f88f39db9cbeaf0f2d5ac29c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"85XjSYzGNauZv17bjwtqxQLEjP0WT/hMu5Os1efey6SYkT21LEA5jpnFU6jJOhdOsmj8AvlMCJVS5e59GPOyBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T23:04:07.569229Z","bundle_sha256":"21cdfbd671fb8e11419adef560e75fef4cbe19af681bad44540ac366eedeb162"}}