{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FQLRXHYGYYUEP2ZNF57Z7A6UB3","short_pith_number":"pith:FQLRXHYG","schema_version":"1.0","canonical_sha256":"2c171b9f06c62847eb2d2f7f9f83d40ef4652ba9ee4638bf5c097d53d1cef8c3","source":{"kind":"arxiv","id":"1606.03935","version":2},"attestation_state":"computed","paper":{"title":"A framework for redescription set construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.AI","authors_text":"Matej Mihel\\v{c}i\\'c, Nada Lavra\\v{c}, Sa\\v{s}o D\\v{z}eroski, Tomislav \\v{S}muc","submitted_at":"2016-06-13T13:15:41Z","abstract_excerpt":"Redescription mining is a field of knowledge discovery that aims at finding different descriptions of similar subsets of instances in the data. These descriptions are represented as rules inferred from one or more disjoint sets of attributes, called views. As such, they support knowledge discovery process and help domain experts in formulating new hypotheses or constructing new knowledge bases and decision support systems. In contrast to previous approaches that typically create one smaller set of redescriptions satisfying a pre-defined set of constraints, we introduce a framework that creates"},"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":"1606.03935","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-13T13:15:41Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"0d73df9d82f9c9390d547e40a436031e7b11589def51349c298032fb4de3d90a","abstract_canon_sha256":"83de20e6c0682f0ddb5a708a6a235411b1c81ed7d6b468c0a9d6517b7c976bac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:47.650128Z","signature_b64":"5Bi+6gOFPS//mTuBZMnmgFYUmURhSPWfklP02CHtO0kT6Jc0IOdBgatH8Y0Zx5OR5xg8+3Y+8sCfDnaVyu2uDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c171b9f06c62847eb2d2f7f9f83d40ef4652ba9ee4638bf5c097d53d1cef8c3","last_reissued_at":"2026-05-18T00:54:47.649686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:47.649686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A framework for redescription set construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.AI","authors_text":"Matej Mihel\\v{c}i\\'c, Nada Lavra\\v{c}, Sa\\v{s}o D\\v{z}eroski, Tomislav \\v{S}muc","submitted_at":"2016-06-13T13:15:41Z","abstract_excerpt":"Redescription mining is a field of knowledge discovery that aims at finding different descriptions of similar subsets of instances in the data. These descriptions are represented as rules inferred from one or more disjoint sets of attributes, called views. As such, they support knowledge discovery process and help domain experts in formulating new hypotheses or constructing new knowledge bases and decision support systems. In contrast to previous approaches that typically create one smaller set of redescriptions satisfying a pre-defined set of constraints, we introduce a framework that creates"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03935","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.03935","created_at":"2026-05-18T00:54:47.649768+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03935v2","created_at":"2026-05-18T00:54:47.649768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03935","created_at":"2026-05-18T00:54:47.649768+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQLRXHYGYYUE","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQLRXHYGYYUEP2ZN","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQLRXHYG","created_at":"2026-05-18T12:30:15.759754+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/FQLRXHYGYYUEP2ZNF57Z7A6UB3","json":"https://pith.science/pith/FQLRXHYGYYUEP2ZNF57Z7A6UB3.json","graph_json":"https://pith.science/api/pith-number/FQLRXHYGYYUEP2ZNF57Z7A6UB3/graph.json","events_json":"https://pith.science/api/pith-number/FQLRXHYGYYUEP2ZNF57Z7A6UB3/events.json","paper":"https://pith.science/paper/FQLRXHYG"},"agent_actions":{"view_html":"https://pith.science/pith/FQLRXHYGYYUEP2ZNF57Z7A6UB3","download_json":"https://pith.science/pith/FQLRXHYGYYUEP2ZNF57Z7A6UB3.json","view_paper":"https://pith.science/paper/FQLRXHYG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03935&json=true","fetch_graph":"https://pith.science/api/pith-number/FQLRXHYGYYUEP2ZNF57Z7A6UB3/graph.json","fetch_events":"https://pith.science/api/pith-number/FQLRXHYGYYUEP2ZNF57Z7A6UB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQLRXHYGYYUEP2ZNF57Z7A6UB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQLRXHYGYYUEP2ZNF57Z7A6UB3/action/storage_attestation","attest_author":"https://pith.science/pith/FQLRXHYGYYUEP2ZNF57Z7A6UB3/action/author_attestation","sign_citation":"https://pith.science/pith/FQLRXHYGYYUEP2ZNF57Z7A6UB3/action/citation_signature","submit_replication":"https://pith.science/pith/FQLRXHYGYYUEP2ZNF57Z7A6UB3/action/replication_record"}},"created_at":"2026-05-18T00:54:47.649768+00:00","updated_at":"2026-05-18T00:54:47.649768+00:00"}