{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:S62L4TIVTNFBP6JTKBYMYPGAFB","short_pith_number":"pith:S62L4TIV","canonical_record":{"source":{"id":"1902.02861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-07T21:56:09Z","cross_cats_sorted":[],"title_canon_sha256":"3feb5d8ec7dea72c45549be166188a8c2e57d0f46962a7514e1a8b5ef50e30ee","abstract_canon_sha256":"a054b5b49ee4fc37e0aba48b6d199e12f05de4fba64472df61bd7cd01fbffefd"},"schema_version":"1.0"},"canonical_sha256":"97b4be4d159b4a17f9335070cc3cc0284c91dd2efe98b716a3cce7fe30c54dc6","source":{"kind":"arxiv","id":"1902.02861","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02861","created_at":"2026-05-17T23:54:29Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02861v1","created_at":"2026-05-17T23:54:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02861","created_at":"2026-05-17T23:54:29Z"},{"alias_kind":"pith_short_12","alias_value":"S62L4TIVTNFB","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"S62L4TIVTNFBP6JT","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"S62L4TIV","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:S62L4TIVTNFBP6JTKBYMYPGAFB","target":"record","payload":{"canonical_record":{"source":{"id":"1902.02861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-07T21:56:09Z","cross_cats_sorted":[],"title_canon_sha256":"3feb5d8ec7dea72c45549be166188a8c2e57d0f46962a7514e1a8b5ef50e30ee","abstract_canon_sha256":"a054b5b49ee4fc37e0aba48b6d199e12f05de4fba64472df61bd7cd01fbffefd"},"schema_version":"1.0"},"canonical_sha256":"97b4be4d159b4a17f9335070cc3cc0284c91dd2efe98b716a3cce7fe30c54dc6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:29.003768Z","signature_b64":"rgKhmYSKsOTeUxst4vnU8q8avXiFQ5dXevZDB9l3yIHY/lsTc5nQE9sABGQ3ukIGebdDZQQyPxae18TPf7B8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97b4be4d159b4a17f9335070cc3cc0284c91dd2efe98b716a3cce7fe30c54dc6","last_reissued_at":"2026-05-17T23:54:29.003349Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:29.003349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.02861","source_version":1,"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-17T23:54:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EQu25ExjiTq4YsIoymgPHjpWtO4+iFNadonBXiWRs42XknQLZ9BhPwCCCXFtSNusa463cd7kMtfm3P0YFcQDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:58:01.784456Z"},"content_sha256":"d0e32595dd32155b5f756cb5379dac97a7a50bcdb47f9e4f1b951ad07317dadd","schema_version":"1.0","event_id":"sha256:d0e32595dd32155b5f756cb5379dac97a7a50bcdb47f9e4f1b951ad07317dadd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:S62L4TIVTNFBP6JTKBYMYPGAFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discovering Descriptive Tile Trees by Mining Optimal Geometric Subtiles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jilles Vreeken, Nikolaj Tatti","submitted_at":"2019-02-07T21:56:09Z","abstract_excerpt":"When analysing binary data, the ease at which one can interpret results is very important. Many existing methods, however, discover either models that are difficult to read, or return so many results interpretation becomes impossible. Here, we study a fully automated approach for mining easily interpretable models for binary data. We model data hierarchically with noisy tiles-rectangles with significantly different density than their parent tile. To identify good trees, we employ the Minimum Description Length principle.\n  We propose STIJL, a greedy any-time algorithm for mining good tile tree"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02861","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"},"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-17T23:54:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Ye+4DGdT0503+wloEShuwMcY3mW+fOqhCj0ifHoRw+rmAWNs5jw89uueq3U/n9cmg5RNExBQtYU+qWfz9BlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:58:01.785112Z"},"content_sha256":"1ba67d1c513ff55dc92f410d4532fbfba049ed57c8d3f4353d8ee12e98d9f920","schema_version":"1.0","event_id":"sha256:1ba67d1c513ff55dc92f410d4532fbfba049ed57c8d3f4353d8ee12e98d9f920"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S62L4TIVTNFBP6JTKBYMYPGAFB/bundle.json","state_url":"https://pith.science/pith/S62L4TIVTNFBP6JTKBYMYPGAFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S62L4TIVTNFBP6JTKBYMYPGAFB/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-26T13:58:01Z","links":{"resolver":"https://pith.science/pith/S62L4TIVTNFBP6JTKBYMYPGAFB","bundle":"https://pith.science/pith/S62L4TIVTNFBP6JTKBYMYPGAFB/bundle.json","state":"https://pith.science/pith/S62L4TIVTNFBP6JTKBYMYPGAFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S62L4TIVTNFBP6JTKBYMYPGAFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:S62L4TIVTNFBP6JTKBYMYPGAFB","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":"a054b5b49ee4fc37e0aba48b6d199e12f05de4fba64472df61bd7cd01fbffefd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-07T21:56:09Z","title_canon_sha256":"3feb5d8ec7dea72c45549be166188a8c2e57d0f46962a7514e1a8b5ef50e30ee"},"schema_version":"1.0","source":{"id":"1902.02861","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02861","created_at":"2026-05-17T23:54:29Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02861v1","created_at":"2026-05-17T23:54:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02861","created_at":"2026-05-17T23:54:29Z"},{"alias_kind":"pith_short_12","alias_value":"S62L4TIVTNFB","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"S62L4TIVTNFBP6JT","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"S62L4TIV","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:1ba67d1c513ff55dc92f410d4532fbfba049ed57c8d3f4353d8ee12e98d9f920","target":"graph","created_at":"2026-05-17T23:54:29Z","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":"When analysing binary data, the ease at which one can interpret results is very important. Many existing methods, however, discover either models that are difficult to read, or return so many results interpretation becomes impossible. Here, we study a fully automated approach for mining easily interpretable models for binary data. We model data hierarchically with noisy tiles-rectangles with significantly different density than their parent tile. To identify good trees, we employ the Minimum Description Length principle.\n  We propose STIJL, a greedy any-time algorithm for mining good tile tree","authors_text":"Jilles Vreeken, Nikolaj Tatti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-07T21:56:09Z","title":"Discovering Descriptive Tile Trees by Mining Optimal Geometric Subtiles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02861","kind":"arxiv","version":1},"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:d0e32595dd32155b5f756cb5379dac97a7a50bcdb47f9e4f1b951ad07317dadd","target":"record","created_at":"2026-05-17T23:54:29Z","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":"a054b5b49ee4fc37e0aba48b6d199e12f05de4fba64472df61bd7cd01fbffefd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-07T21:56:09Z","title_canon_sha256":"3feb5d8ec7dea72c45549be166188a8c2e57d0f46962a7514e1a8b5ef50e30ee"},"schema_version":"1.0","source":{"id":"1902.02861","kind":"arxiv","version":1}},"canonical_sha256":"97b4be4d159b4a17f9335070cc3cc0284c91dd2efe98b716a3cce7fe30c54dc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97b4be4d159b4a17f9335070cc3cc0284c91dd2efe98b716a3cce7fe30c54dc6","first_computed_at":"2026-05-17T23:54:29.003349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:29.003349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rgKhmYSKsOTeUxst4vnU8q8avXiFQ5dXevZDB9l3yIHY/lsTc5nQE9sABGQ3ukIGebdDZQQyPxae18TPf7B8Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:29.003768Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.02861","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0e32595dd32155b5f756cb5379dac97a7a50bcdb47f9e4f1b951ad07317dadd","sha256:1ba67d1c513ff55dc92f410d4532fbfba049ed57c8d3f4353d8ee12e98d9f920"],"state_sha256":"1a6b64105162dc7a8c1ade6cac5961d4faf5363ca8ca575fd88790d0e795baf7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c5jSCnZFxlKiuFd8AFwX2bSK+oWNXzzA+d7dk0+yYV9CTwopj6xJFlNIyQ5mZi+ovNxuYZl0e6FAOB2eMdYdDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:58:01.787816Z","bundle_sha256":"fec4c3fe8d6a0abae62aaf71eca33c01a17161112bd41515ae7be10d41fb0ca7"}}