{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QZQJ2FQ4DDXOTHX7IJMBMXSR74","short_pith_number":"pith:QZQJ2FQ4","schema_version":"1.0","canonical_sha256":"86609d161c18eee99eff4258165e51ff0eb74f106f8c8f7fda733b4e0e5fa41d","source":{"kind":"arxiv","id":"1703.09513","version":1},"attestation_state":"computed","paper":{"title":"Mining Best Closed Itemsets for Projection-antimonotonic Constraints in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Aleksey Buzmakov, Amedeo Napoli, Sergei O. Kuznetsov","submitted_at":"2017-03-28T11:40:44Z","abstract_excerpt":"The exponential explosion of the set of patterns is one of the main challenges in pattern mining. This challenge is approached by introducing a constraint for pattern selection. One of the first constraints proposed in pattern mining is support (frequency) of a pattern in a dataset. Frequency is an anti-monotonic function, i.e., given an infrequent pattern, all its superpatterns are not frequent. However, many other constraints for pattern selection are neither monotonic nor anti-monotonic, which makes it difficult to generate patterns satisfying these constraints.\n  In order to deal with nonm"},"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":"1703.09513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-28T11:40:44Z","cross_cats_sorted":[],"title_canon_sha256":"ae736dc92c9956215b6a63bc15b7bece81b4c4ec955496c315bfa9ab685ae77f","abstract_canon_sha256":"83b9c8218d7d1c6cbc962d66ed1d1e8a52d91a869cf6aecfbdd37a8dddff2a87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:44.345063Z","signature_b64":"VsfTBYVcEThY1vsNQYn2PlSgDHlzrybxsnANvtyQ2ApFhga9LFzybGrARZwmLmAQMzjihNXnQFeHqzo1bi+aAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86609d161c18eee99eff4258165e51ff0eb74f106f8c8f7fda733b4e0e5fa41d","last_reissued_at":"2026-05-18T00:47:44.344241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:44.344241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mining Best Closed Itemsets for Projection-antimonotonic Constraints in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Aleksey Buzmakov, Amedeo Napoli, Sergei O. Kuznetsov","submitted_at":"2017-03-28T11:40:44Z","abstract_excerpt":"The exponential explosion of the set of patterns is one of the main challenges in pattern mining. This challenge is approached by introducing a constraint for pattern selection. One of the first constraints proposed in pattern mining is support (frequency) of a pattern in a dataset. Frequency is an anti-monotonic function, i.e., given an infrequent pattern, all its superpatterns are not frequent. However, many other constraints for pattern selection are neither monotonic nor anti-monotonic, which makes it difficult to generate patterns satisfying these constraints.\n  In order to deal with nonm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09513","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.09513","created_at":"2026-05-18T00:47:44.344382+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.09513v1","created_at":"2026-05-18T00:47:44.344382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09513","created_at":"2026-05-18T00:47:44.344382+00:00"},{"alias_kind":"pith_short_12","alias_value":"QZQJ2FQ4DDXO","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QZQJ2FQ4DDXOTHX7","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QZQJ2FQ4","created_at":"2026-05-18T12:31:39.905425+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/QZQJ2FQ4DDXOTHX7IJMBMXSR74","json":"https://pith.science/pith/QZQJ2FQ4DDXOTHX7IJMBMXSR74.json","graph_json":"https://pith.science/api/pith-number/QZQJ2FQ4DDXOTHX7IJMBMXSR74/graph.json","events_json":"https://pith.science/api/pith-number/QZQJ2FQ4DDXOTHX7IJMBMXSR74/events.json","paper":"https://pith.science/paper/QZQJ2FQ4"},"agent_actions":{"view_html":"https://pith.science/pith/QZQJ2FQ4DDXOTHX7IJMBMXSR74","download_json":"https://pith.science/pith/QZQJ2FQ4DDXOTHX7IJMBMXSR74.json","view_paper":"https://pith.science/paper/QZQJ2FQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.09513&json=true","fetch_graph":"https://pith.science/api/pith-number/QZQJ2FQ4DDXOTHX7IJMBMXSR74/graph.json","fetch_events":"https://pith.science/api/pith-number/QZQJ2FQ4DDXOTHX7IJMBMXSR74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QZQJ2FQ4DDXOTHX7IJMBMXSR74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QZQJ2FQ4DDXOTHX7IJMBMXSR74/action/storage_attestation","attest_author":"https://pith.science/pith/QZQJ2FQ4DDXOTHX7IJMBMXSR74/action/author_attestation","sign_citation":"https://pith.science/pith/QZQJ2FQ4DDXOTHX7IJMBMXSR74/action/citation_signature","submit_replication":"https://pith.science/pith/QZQJ2FQ4DDXOTHX7IJMBMXSR74/action/replication_record"}},"created_at":"2026-05-18T00:47:44.344382+00:00","updated_at":"2026-05-18T00:47:44.344382+00:00"}