{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7K4DL2GUI7YJJYKBG6YNIDQCXC","short_pith_number":"pith:7K4DL2GU","canonical_record":{"source":{"id":"1809.05467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-14T15:33:06Z","cross_cats_sorted":["cs.DB","cs.IT","math.IT"],"title_canon_sha256":"2a50a1a3466868f2178a62a2c7208532b354a3528c739b70e7527fb85709925c","abstract_canon_sha256":"bd3d0f812d647f8668be45c17fb131c2bf13c2a691a5d147a4e4f6358694fa42"},"schema_version":"1.0"},"canonical_sha256":"fab835e8d447f094e14137b0d40e02b886a01a5d5ab68060ec3f7d00efa8dced","source":{"kind":"arxiv","id":"1809.05467","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05467","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05467v1","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05467","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"7K4DL2GUI7YJ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7K4DL2GUI7YJJYKB","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7K4DL2GU","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7K4DL2GUI7YJJYKBG6YNIDQCXC","target":"record","payload":{"canonical_record":{"source":{"id":"1809.05467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-14T15:33:06Z","cross_cats_sorted":["cs.DB","cs.IT","math.IT"],"title_canon_sha256":"2a50a1a3466868f2178a62a2c7208532b354a3528c739b70e7527fb85709925c","abstract_canon_sha256":"bd3d0f812d647f8668be45c17fb131c2bf13c2a691a5d147a4e4f6358694fa42"},"schema_version":"1.0"},"canonical_sha256":"fab835e8d447f094e14137b0d40e02b886a01a5d5ab68060ec3f7d00efa8dced","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:41.344532Z","signature_b64":"vLvAQ4zMp7gUOaKbsWC0ePwCSPYK6SewzKBBhvc060qOMiFqDakR8EXhfnEjowfK1C+G+rfR6eqIK2TwnX7LBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fab835e8d447f094e14137b0d40e02b886a01a5d5ab68060ec3f7d00efa8dced","last_reissued_at":"2026-05-18T00:05:41.343835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:41.343835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.05467","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-05-18T00:05:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JuETh8mZBXRC4NOpWfwXLZsLOHQkrB3F/0wqd3N9aIXJabv1vekhBf+PETZufh8YqtiNvUtDNXWqMjHQW2SLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:54:01.995545Z"},"content_sha256":"6aa81c4189c92533f84e08781d2bd6c12734e6cdae0edbd3933f5dbfd055925d","schema_version":"1.0","event_id":"sha256:6aa81c4189c92533f84e08781d2bd6c12734e6cdae0edbd3933f5dbfd055925d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7K4DL2GUI7YJJYKBG6YNIDQCXC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discovering Reliable Dependencies from Data: Hardness and Improved Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.IT","math.IT"],"primary_cat":"cs.AI","authors_text":"Jilles Vreeken, Mario Boley, Panagiotis Mandros","submitted_at":"2018-09-14T15:33:06Z","abstract_excerpt":"The reliable fraction of information is an attractive score for quantifying (functional) dependencies in high-dimensional data. In this paper, we systematically explore the algorithmic implications of using this measure for optimization. We show that the problem is NP-hard, which justifies the usage of worst-case exponential-time as well as heuristic search methods. We then substantially improve the practical performance for both optimization styles by deriving a novel admissible bounding function that has an unbounded potential for additional pruning over the previously proposed one. Finally,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05467","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":""},"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:05:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rARy90UbhyhIiJqLLRiVR//jDjvTE0n6F1yNwPff6aZWq5UdxIqicmYiNPGx3oen17tZYa1EjvT4VX9EvLkFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:54:01.995895Z"},"content_sha256":"900030786988f4f9a003ce4337078fdb71890a8646b141a89623b83bcdb14c44","schema_version":"1.0","event_id":"sha256:900030786988f4f9a003ce4337078fdb71890a8646b141a89623b83bcdb14c44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7K4DL2GUI7YJJYKBG6YNIDQCXC/bundle.json","state_url":"https://pith.science/pith/7K4DL2GUI7YJJYKBG6YNIDQCXC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7K4DL2GUI7YJJYKBG6YNIDQCXC/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-20T22:54:01Z","links":{"resolver":"https://pith.science/pith/7K4DL2GUI7YJJYKBG6YNIDQCXC","bundle":"https://pith.science/pith/7K4DL2GUI7YJJYKBG6YNIDQCXC/bundle.json","state":"https://pith.science/pith/7K4DL2GUI7YJJYKBG6YNIDQCXC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7K4DL2GUI7YJJYKBG6YNIDQCXC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7K4DL2GUI7YJJYKBG6YNIDQCXC","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":"bd3d0f812d647f8668be45c17fb131c2bf13c2a691a5d147a4e4f6358694fa42","cross_cats_sorted":["cs.DB","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-14T15:33:06Z","title_canon_sha256":"2a50a1a3466868f2178a62a2c7208532b354a3528c739b70e7527fb85709925c"},"schema_version":"1.0","source":{"id":"1809.05467","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05467","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05467v1","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05467","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"7K4DL2GUI7YJ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7K4DL2GUI7YJJYKB","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7K4DL2GU","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:900030786988f4f9a003ce4337078fdb71890a8646b141a89623b83bcdb14c44","target":"graph","created_at":"2026-05-18T00:05:41Z","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":"The reliable fraction of information is an attractive score for quantifying (functional) dependencies in high-dimensional data. In this paper, we systematically explore the algorithmic implications of using this measure for optimization. We show that the problem is NP-hard, which justifies the usage of worst-case exponential-time as well as heuristic search methods. We then substantially improve the practical performance for both optimization styles by deriving a novel admissible bounding function that has an unbounded potential for additional pruning over the previously proposed one. Finally,","authors_text":"Jilles Vreeken, Mario Boley, Panagiotis Mandros","cross_cats":["cs.DB","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-14T15:33:06Z","title":"Discovering Reliable Dependencies from Data: Hardness and Improved Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05467","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:6aa81c4189c92533f84e08781d2bd6c12734e6cdae0edbd3933f5dbfd055925d","target":"record","created_at":"2026-05-18T00:05:41Z","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":"bd3d0f812d647f8668be45c17fb131c2bf13c2a691a5d147a4e4f6358694fa42","cross_cats_sorted":["cs.DB","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-14T15:33:06Z","title_canon_sha256":"2a50a1a3466868f2178a62a2c7208532b354a3528c739b70e7527fb85709925c"},"schema_version":"1.0","source":{"id":"1809.05467","kind":"arxiv","version":1}},"canonical_sha256":"fab835e8d447f094e14137b0d40e02b886a01a5d5ab68060ec3f7d00efa8dced","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fab835e8d447f094e14137b0d40e02b886a01a5d5ab68060ec3f7d00efa8dced","first_computed_at":"2026-05-18T00:05:41.343835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:41.343835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vLvAQ4zMp7gUOaKbsWC0ePwCSPYK6SewzKBBhvc060qOMiFqDakR8EXhfnEjowfK1C+G+rfR6eqIK2TwnX7LBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:41.344532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.05467","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6aa81c4189c92533f84e08781d2bd6c12734e6cdae0edbd3933f5dbfd055925d","sha256:900030786988f4f9a003ce4337078fdb71890a8646b141a89623b83bcdb14c44"],"state_sha256":"f0ea19207c60b1225e319ffb7b89b795a2a5f4a76d26439a0c96979d9c77b93a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H3BgV6JqtsCKyO8y+XcrhmMun9Xxkar7ukqkhL+YSQm/UiXdtm1x9cFEBUxhJo5lfwmg2e5jPfIYfvliDemECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T22:54:01.997853Z","bundle_sha256":"dfcf8494927905562104ac6b00628b8d7ffb3dc54cf1dac9d26770bd38d194d1"}}