{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZL7A37RPZ3QRFPXYN64XDVO4RU","short_pith_number":"pith:ZL7A37RP","canonical_record":{"source":{"id":"1401.1043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-01-06T11:16:01Z","cross_cats_sorted":[],"title_canon_sha256":"7ca8ed03dffa82c86772039bdf28ce9c3f64ab332d7132d6facd7d4bbcbf5801","abstract_canon_sha256":"db918e2e6cbd854b466acef100d01276b063c50d6013054a465ee03dbfe4e42e"},"schema_version":"1.0"},"canonical_sha256":"cafe0dfe2fcee112bef86fb971d5dc8d0a37120e42da9749a1c71082919121dc","source":{"kind":"arxiv","id":"1401.1043","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1043","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1043v2","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1043","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZL7A37RPZ3QR","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZL7A37RPZ3QRFPXY","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZL7A37RP","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZL7A37RPZ3QRFPXYN64XDVO4RU","target":"record","payload":{"canonical_record":{"source":{"id":"1401.1043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-01-06T11:16:01Z","cross_cats_sorted":[],"title_canon_sha256":"7ca8ed03dffa82c86772039bdf28ce9c3f64ab332d7132d6facd7d4bbcbf5801","abstract_canon_sha256":"db918e2e6cbd854b466acef100d01276b063c50d6013054a465ee03dbfe4e42e"},"schema_version":"1.0"},"canonical_sha256":"cafe0dfe2fcee112bef86fb971d5dc8d0a37120e42da9749a1c71082919121dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:18.542517Z","signature_b64":"TgAgPLaj7QPfa9hhFPxNQ3P0srIqn43rrV381esmKnL14lqx/1IY4qieyLoNiLg7iqIY7d56upORk/eh1MEuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cafe0dfe2fcee112bef86fb971d5dc8d0a37120e42da9749a1c71082919121dc","last_reissued_at":"2026-05-18T02:40:18.541806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:18.541806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.1043","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g3K+M+JtGVkGDs7imgFByJl5cP28ZtSreJash9+zcA51ebUEKJirlypkwy8LgON67jXJu3niMVci6BwHH/JhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:30:17.208026Z"},"content_sha256":"0fa5f3e2b84a3e1a36d448ae3a87ed457debdf690f995218e13de8368002608c","schema_version":"1.0","event_id":"sha256:0fa5f3e2b84a3e1a36d448ae3a87ed457debdf690f995218e13de8368002608c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZL7A37RPZ3QRFPXYN64XDVO4RU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discovering Compressing Serial Episodes from Event Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"A. Ibrahim, P.S. Sastry, Shivakumar Sastry","submitted_at":"2014-01-06T11:16:01Z","abstract_excerpt":"Most pattern mining methods output a very large number of frequent patterns and isolating a small but relevant subset is a challenging problem of current interest in frequent pattern mining. In this paper we consider discovery of a small set of relevant frequent episodes from data sequences. We make use of the Minimum Description Length principle to formulate the problem of selecting a subset of episodes. Using an interesting class of serial episodes with inter-event constraints and a novel encoding scheme for data using such episodes, we present algorithms for discovering small set of episode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1043","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2c4rB35yPbVz4eAXQg1nF9W3fuks3BVMJ5YyyO7sYGvyKbJSBz0U88r4tfV5cgZCEa7mb9kfDKS6lZ6Kon8zAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:30:17.208391Z"},"content_sha256":"4d5028621b02ab4fbd717e772d1cbb938997c5e775e3a38ecbca230ac2c95776","schema_version":"1.0","event_id":"sha256:4d5028621b02ab4fbd717e772d1cbb938997c5e775e3a38ecbca230ac2c95776"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZL7A37RPZ3QRFPXYN64XDVO4RU/bundle.json","state_url":"https://pith.science/pith/ZL7A37RPZ3QRFPXYN64XDVO4RU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZL7A37RPZ3QRFPXYN64XDVO4RU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T06:30:17Z","links":{"resolver":"https://pith.science/pith/ZL7A37RPZ3QRFPXYN64XDVO4RU","bundle":"https://pith.science/pith/ZL7A37RPZ3QRFPXYN64XDVO4RU/bundle.json","state":"https://pith.science/pith/ZL7A37RPZ3QRFPXYN64XDVO4RU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZL7A37RPZ3QRFPXYN64XDVO4RU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZL7A37RPZ3QRFPXYN64XDVO4RU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"db918e2e6cbd854b466acef100d01276b063c50d6013054a465ee03dbfe4e42e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-01-06T11:16:01Z","title_canon_sha256":"7ca8ed03dffa82c86772039bdf28ce9c3f64ab332d7132d6facd7d4bbcbf5801"},"schema_version":"1.0","source":{"id":"1401.1043","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1043","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1043v2","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1043","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZL7A37RPZ3QR","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZL7A37RPZ3QRFPXY","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZL7A37RP","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:4d5028621b02ab4fbd717e772d1cbb938997c5e775e3a38ecbca230ac2c95776","target":"graph","created_at":"2026-05-18T02:40:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Most pattern mining methods output a very large number of frequent patterns and isolating a small but relevant subset is a challenging problem of current interest in frequent pattern mining. In this paper we consider discovery of a small set of relevant frequent episodes from data sequences. We make use of the Minimum Description Length principle to formulate the problem of selecting a subset of episodes. Using an interesting class of serial episodes with inter-event constraints and a novel encoding scheme for data using such episodes, we present algorithms for discovering small set of episode","authors_text":"A. Ibrahim, P.S. Sastry, Shivakumar Sastry","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-01-06T11:16:01Z","title":"Discovering Compressing Serial Episodes from Event Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1043","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0fa5f3e2b84a3e1a36d448ae3a87ed457debdf690f995218e13de8368002608c","target":"record","created_at":"2026-05-18T02:40:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"db918e2e6cbd854b466acef100d01276b063c50d6013054a465ee03dbfe4e42e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-01-06T11:16:01Z","title_canon_sha256":"7ca8ed03dffa82c86772039bdf28ce9c3f64ab332d7132d6facd7d4bbcbf5801"},"schema_version":"1.0","source":{"id":"1401.1043","kind":"arxiv","version":2}},"canonical_sha256":"cafe0dfe2fcee112bef86fb971d5dc8d0a37120e42da9749a1c71082919121dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cafe0dfe2fcee112bef86fb971d5dc8d0a37120e42da9749a1c71082919121dc","first_computed_at":"2026-05-18T02:40:18.541806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:18.541806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TgAgPLaj7QPfa9hhFPxNQ3P0srIqn43rrV381esmKnL14lqx/1IY4qieyLoNiLg7iqIY7d56upORk/eh1MEuBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:18.542517Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.1043","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fa5f3e2b84a3e1a36d448ae3a87ed457debdf690f995218e13de8368002608c","sha256:4d5028621b02ab4fbd717e772d1cbb938997c5e775e3a38ecbca230ac2c95776"],"state_sha256":"94410040ded31211c3c869d53fb59503b8825a96e4f5ce76d93088f6153a4e82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"28WSmPgncFsZEzGX94baMPZ17JYUr1MUGkrwUrtDa1LP8WB7x3yweoXt7uE6FLzQY/tPb5RAaBA0nOrW2ylnDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:30:17.210547Z","bundle_sha256":"87d9743b9e863dd6aeef8300fec84cda911f7d717c9ee0402aa41e63718ad8d6"}}