{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EB6S3H42APYD4F7XCIUTR7TWXA","short_pith_number":"pith:EB6S3H42","schema_version":"1.0","canonical_sha256":"207d2d9f9a03f03e17f7122938fe76b831de900c739b1bbdd915c78e16638a09","source":{"kind":"arxiv","id":"1901.01710","version":1},"attestation_state":"computed","paper":{"title":"Approximate-Closed-Itemset Mining for Streaming Data Under Resource Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Koji Iwanuma, Yasuo Tabei, Yoshitaka Yamamoto","submitted_at":"2019-01-07T08:58:59Z","abstract_excerpt":"Here, we present a novel algorithm for frequent itemset mining for streaming data (FIM-SD). For the past decade, various FIM-SD methods in one-pass approximation settings have been developed to approximate the frequency of each itemset. These approaches can be categorized into two approximation types: parameter-constrained (PC) mining and resource-constrained (RC) mining. PC methods control the maximum error that can be included in the frequency based on a pre-defined parameter. In contrast, RC methods limit the maximum memory consumption based on resource constraints. However, the existing PC"},"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":"1901.01710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-01-07T08:58:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ae92ae5e8140429f6c00edf7125308561817ebf0a0052e1f9510a642b0a53a4a","abstract_canon_sha256":"bddde4042ffd77b2a375d74fc40e889bd92a3334eb10e81b27b07860a84504ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:51.402369Z","signature_b64":"/RPLq0ImrVhTerVldw/UZg6Bzop5lALdP6GL7Yy4+7YDTElgJ6yUOJpjAoyHAydcqU8Xw1R1RBuRhTwHwgm7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"207d2d9f9a03f03e17f7122938fe76b831de900c739b1bbdd915c78e16638a09","last_reissued_at":"2026-05-17T23:56:51.401944Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:51.401944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate-Closed-Itemset Mining for Streaming Data Under Resource Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Koji Iwanuma, Yasuo Tabei, Yoshitaka Yamamoto","submitted_at":"2019-01-07T08:58:59Z","abstract_excerpt":"Here, we present a novel algorithm for frequent itemset mining for streaming data (FIM-SD). For the past decade, various FIM-SD methods in one-pass approximation settings have been developed to approximate the frequency of each itemset. These approaches can be categorized into two approximation types: parameter-constrained (PC) mining and resource-constrained (RC) mining. PC methods control the maximum error that can be included in the frequency based on a pre-defined parameter. In contrast, RC methods limit the maximum memory consumption based on resource constraints. However, the existing PC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01710","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":"1901.01710","created_at":"2026-05-17T23:56:51.402005+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.01710v1","created_at":"2026-05-17T23:56:51.402005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01710","created_at":"2026-05-17T23:56:51.402005+00:00"},{"alias_kind":"pith_short_12","alias_value":"EB6S3H42APYD","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EB6S3H42APYD4F7X","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EB6S3H42","created_at":"2026-05-18T12:33:15.570797+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/EB6S3H42APYD4F7XCIUTR7TWXA","json":"https://pith.science/pith/EB6S3H42APYD4F7XCIUTR7TWXA.json","graph_json":"https://pith.science/api/pith-number/EB6S3H42APYD4F7XCIUTR7TWXA/graph.json","events_json":"https://pith.science/api/pith-number/EB6S3H42APYD4F7XCIUTR7TWXA/events.json","paper":"https://pith.science/paper/EB6S3H42"},"agent_actions":{"view_html":"https://pith.science/pith/EB6S3H42APYD4F7XCIUTR7TWXA","download_json":"https://pith.science/pith/EB6S3H42APYD4F7XCIUTR7TWXA.json","view_paper":"https://pith.science/paper/EB6S3H42","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.01710&json=true","fetch_graph":"https://pith.science/api/pith-number/EB6S3H42APYD4F7XCIUTR7TWXA/graph.json","fetch_events":"https://pith.science/api/pith-number/EB6S3H42APYD4F7XCIUTR7TWXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EB6S3H42APYD4F7XCIUTR7TWXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EB6S3H42APYD4F7XCIUTR7TWXA/action/storage_attestation","attest_author":"https://pith.science/pith/EB6S3H42APYD4F7XCIUTR7TWXA/action/author_attestation","sign_citation":"https://pith.science/pith/EB6S3H42APYD4F7XCIUTR7TWXA/action/citation_signature","submit_replication":"https://pith.science/pith/EB6S3H42APYD4F7XCIUTR7TWXA/action/replication_record"}},"created_at":"2026-05-17T23:56:51.402005+00:00","updated_at":"2026-05-17T23:56:51.402005+00:00"}