{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ECNTXEX6JGNHRKLAFRLJZSYSEF","short_pith_number":"pith:ECNTXEX6","schema_version":"1.0","canonical_sha256":"209b3b92fe499a78a9602c569ccb122169200c9d5c0f4f978f290072a29b1516","source":{"kind":"arxiv","id":"1911.12933","version":1},"attestation_state":"computed","paper":{"title":"Mining Approximate Acyclic Schemes from Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Babak Salimi, Batya Kenig, Dan Suciu, Guna Prasad, Pranay Mundra","submitted_at":"2019-11-29T03:09:41Z","abstract_excerpt":"Acyclic schemes have numerous applications in databases and in machine learning, such as improved design, more efficient storage, and increased performance for queries and machine learning algorithms. Multivalued dependencies (MVDs) are the building blocks of acyclic schemes. The discovery from data of both MVDs and acyclic schemes is more challenging than other forms of data dependencies, such as Functional Dependencies, because these dependencies do not hold on subsets of data, and because they are very sensitive to noise in the data; for example a single wrong or missing tuple may invalidat"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1911.12933","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-11-29T03:09:41Z","cross_cats_sorted":[],"title_canon_sha256":"8fc785dc1e37c8db4f49e8d73e390df796f896b7aee6bbd44b01c476addaf1d8","abstract_canon_sha256":"880ec384d36f6f4451b9d08e33759653de470f7a0d9721d2fa03dadc7eb3399b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:22:50.529049Z","signature_b64":"Xao4wk0skcI05216fJDgS+K/Cucp6Ghzbp2/EghPJydJgc5KJ4wPTJ0jnA8qO1+vLVspRKBVH7yBa6cYAG+bAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"209b3b92fe499a78a9602c569ccb122169200c9d5c0f4f978f290072a29b1516","last_reissued_at":"2026-07-05T00:22:50.528664Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:22:50.528664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mining Approximate Acyclic Schemes from Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Babak Salimi, Batya Kenig, Dan Suciu, Guna Prasad, Pranay Mundra","submitted_at":"2019-11-29T03:09:41Z","abstract_excerpt":"Acyclic schemes have numerous applications in databases and in machine learning, such as improved design, more efficient storage, and increased performance for queries and machine learning algorithms. Multivalued dependencies (MVDs) are the building blocks of acyclic schemes. The discovery from data of both MVDs and acyclic schemes is more challenging than other forms of data dependencies, such as Functional Dependencies, because these dependencies do not hold on subsets of data, and because they are very sensitive to noise in the data; for example a single wrong or missing tuple may invalidat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.12933","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/1911.12933/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1911.12933","created_at":"2026-07-05T00:22:50.528720+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.12933v1","created_at":"2026-07-05T00:22:50.528720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.12933","created_at":"2026-07-05T00:22:50.528720+00:00"},{"alias_kind":"pith_short_12","alias_value":"ECNTXEX6JGNH","created_at":"2026-07-05T00:22:50.528720+00:00"},{"alias_kind":"pith_short_16","alias_value":"ECNTXEX6JGNHRKLA","created_at":"2026-07-05T00:22:50.528720+00:00"},{"alias_kind":"pith_short_8","alias_value":"ECNTXEX6","created_at":"2026-07-05T00:22:50.528720+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ECNTXEX6JGNHRKLAFRLJZSYSEF","json":"https://pith.science/pith/ECNTXEX6JGNHRKLAFRLJZSYSEF.json","graph_json":"https://pith.science/api/pith-number/ECNTXEX6JGNHRKLAFRLJZSYSEF/graph.json","events_json":"https://pith.science/api/pith-number/ECNTXEX6JGNHRKLAFRLJZSYSEF/events.json","paper":"https://pith.science/paper/ECNTXEX6"},"agent_actions":{"view_html":"https://pith.science/pith/ECNTXEX6JGNHRKLAFRLJZSYSEF","download_json":"https://pith.science/pith/ECNTXEX6JGNHRKLAFRLJZSYSEF.json","view_paper":"https://pith.science/paper/ECNTXEX6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.12933&json=true","fetch_graph":"https://pith.science/api/pith-number/ECNTXEX6JGNHRKLAFRLJZSYSEF/graph.json","fetch_events":"https://pith.science/api/pith-number/ECNTXEX6JGNHRKLAFRLJZSYSEF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ECNTXEX6JGNHRKLAFRLJZSYSEF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ECNTXEX6JGNHRKLAFRLJZSYSEF/action/storage_attestation","attest_author":"https://pith.science/pith/ECNTXEX6JGNHRKLAFRLJZSYSEF/action/author_attestation","sign_citation":"https://pith.science/pith/ECNTXEX6JGNHRKLAFRLJZSYSEF/action/citation_signature","submit_replication":"https://pith.science/pith/ECNTXEX6JGNHRKLAFRLJZSYSEF/action/replication_record"}},"created_at":"2026-07-05T00:22:50.528720+00:00","updated_at":"2026-07-05T00:22:50.528720+00:00"}