{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NOIYT42L4A53HEUYXJE2CP3SGQ","short_pith_number":"pith:NOIYT42L","schema_version":"1.0","canonical_sha256":"6b9189f34be03bb39298ba49a13f72341a685d9fb30463cb5c144a0b961a2385","source":{"kind":"arxiv","id":"1506.01071","version":2},"attestation_state":"computed","paper":{"title":"Fast Generation of Best Interval Patterns for Nonmonotonic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Aleksey Buzmakov, Amedeo Napoli, Sergei O. Kuznetsov","submitted_at":"2015-06-02T21:32:14Z","abstract_excerpt":"In pattern mining, the main challenge is the exponential explosion of the set of patterns. Typically, to solve this problem, a constraint for pattern selection is introduced. 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 not (anti-)monotonic, which makes it difficult to generate patterns satisfying these constraints. In this paper we introduce the notion of projec"},"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":"1506.01071","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-02T21:32:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7e72b2f7f95eeb251071ab3d9bf233bec6f6aabb2f51918bbd9a28e239c8e996","abstract_canon_sha256":"15170690b3203eca6106fe67b096f00a3ba946a714da85d36df3455e47e00853"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:48:06.069491Z","signature_b64":"WEqF8KG37x84fmMSqSywHWEP9JcFmA6dpUkvW38ZdeE7RcO19jYXPqz2H/0IiQQ3/DQ/ICxewC+2iGq4OXP5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b9189f34be03bb39298ba49a13f72341a685d9fb30463cb5c144a0b961a2385","last_reissued_at":"2026-05-18T01:48:06.068965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:48:06.068965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Generation of Best Interval Patterns for Nonmonotonic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Aleksey Buzmakov, Amedeo Napoli, Sergei O. Kuznetsov","submitted_at":"2015-06-02T21:32:14Z","abstract_excerpt":"In pattern mining, the main challenge is the exponential explosion of the set of patterns. Typically, to solve this problem, a constraint for pattern selection is introduced. 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 not (anti-)monotonic, which makes it difficult to generate patterns satisfying these constraints. In this paper we introduce the notion of projec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01071","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":"1506.01071","created_at":"2026-05-18T01:48:06.069057+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.01071v2","created_at":"2026-05-18T01:48:06.069057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01071","created_at":"2026-05-18T01:48:06.069057+00:00"},{"alias_kind":"pith_short_12","alias_value":"NOIYT42L4A53","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NOIYT42L4A53HEUY","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NOIYT42L","created_at":"2026-05-18T12:29:34.919912+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/NOIYT42L4A53HEUYXJE2CP3SGQ","json":"https://pith.science/pith/NOIYT42L4A53HEUYXJE2CP3SGQ.json","graph_json":"https://pith.science/api/pith-number/NOIYT42L4A53HEUYXJE2CP3SGQ/graph.json","events_json":"https://pith.science/api/pith-number/NOIYT42L4A53HEUYXJE2CP3SGQ/events.json","paper":"https://pith.science/paper/NOIYT42L"},"agent_actions":{"view_html":"https://pith.science/pith/NOIYT42L4A53HEUYXJE2CP3SGQ","download_json":"https://pith.science/pith/NOIYT42L4A53HEUYXJE2CP3SGQ.json","view_paper":"https://pith.science/paper/NOIYT42L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.01071&json=true","fetch_graph":"https://pith.science/api/pith-number/NOIYT42L4A53HEUYXJE2CP3SGQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NOIYT42L4A53HEUYXJE2CP3SGQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NOIYT42L4A53HEUYXJE2CP3SGQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NOIYT42L4A53HEUYXJE2CP3SGQ/action/storage_attestation","attest_author":"https://pith.science/pith/NOIYT42L4A53HEUYXJE2CP3SGQ/action/author_attestation","sign_citation":"https://pith.science/pith/NOIYT42L4A53HEUYXJE2CP3SGQ/action/citation_signature","submit_replication":"https://pith.science/pith/NOIYT42L4A53HEUYXJE2CP3SGQ/action/replication_record"}},"created_at":"2026-05-18T01:48:06.069057+00:00","updated_at":"2026-05-18T01:48:06.069057+00:00"}