{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:N5L7NJSY4W2TFJ66KCH26MHWIZ","short_pith_number":"pith:N5L7NJSY","canonical_record":{"source":{"id":"1906.09722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-06-17T21:56:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"db844e746a6d2788792da97bd631d5f8b80817b8fef40ec7ff42249c3484e766","abstract_canon_sha256":"1f5c76dd742960a0ade51898730e55aff1dc5aecab00f3fa07d9b498baa59a8a"},"schema_version":"1.0"},"canonical_sha256":"6f57f6a658e5b532a7de508faf30f64642b849b675718e253821f7dfce125973","source":{"kind":"arxiv","id":"1906.09722","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09722","created_at":"2026-05-17T23:42:36Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09722v1","created_at":"2026-05-17T23:42:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09722","created_at":"2026-05-17T23:42:36Z"},{"alias_kind":"pith_short_12","alias_value":"N5L7NJSY4W2T","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"N5L7NJSY4W2TFJ66","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"N5L7NJSY","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:N5L7NJSY4W2TFJ66KCH26MHWIZ","target":"record","payload":{"canonical_record":{"source":{"id":"1906.09722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-06-17T21:56:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"db844e746a6d2788792da97bd631d5f8b80817b8fef40ec7ff42249c3484e766","abstract_canon_sha256":"1f5c76dd742960a0ade51898730e55aff1dc5aecab00f3fa07d9b498baa59a8a"},"schema_version":"1.0"},"canonical_sha256":"6f57f6a658e5b532a7de508faf30f64642b849b675718e253821f7dfce125973","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:36.979594Z","signature_b64":"Zl866scfaN78vz7aC6SsJXdGdJbw/clADpXiQGuIC7BfJ1ZRNFKQZZ1ZNPF2n6gQ+Ll23MvyOgXKRDCCd7iUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f57f6a658e5b532a7de508faf30f64642b849b675718e253821f7dfce125973","last_reissued_at":"2026-05-17T23:42:36.978795Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:36.978795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.09722","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:42:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RVn2rWvOAc/If1U7D8Q1rO+i/WQfy0qSTE2n/t7EAN4oL1YYC50RAx30XNuzT0r3GnBcqnVGK+zbAd8efieDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T16:46:14.065304Z"},"content_sha256":"938c02f328d171ff7a0cb210a4d8d8f4f08fade4b4e12e7759228ac6e0e9b32b","schema_version":"1.0","event_id":"sha256:938c02f328d171ff7a0cb210a4d8d8f4f08fade4b4e12e7759228ac6e0e9b32b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:N5L7NJSY4W2TFJ66KCH26MHWIZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The PRIMPing Routine -- Tiling through Proximal Alternating Linearized Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Katharina Morik, Nico Piatkowski, Sibylle Hess","submitted_at":"2019-06-17T21:56:36Z","abstract_excerpt":"Mining and exploring databases should provide users with knowledge and new insights. Tiles of data strive to unveil true underlying structure and distinguish valuable information from various kinds of noise. We propose a novel Boolean matrix factorization algorithm to solve the tiling problem, based on recent results from optimization theory. In contrast to existing work, the new algorithm minimizes the description length of the resulting factorization. This approach is well known for model selection and data compression, but not for finding suitable factorizations via numerical optimization. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09722","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:42:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x0OkistcTL+K1bDY3ZHwdqjekYtMUtcAPvsSbm9KwE4ILV8gWd00HOvG2e5cVZ5vRAX1Z3EEnxhpQxTNGiXvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T16:46:14.065669Z"},"content_sha256":"ee72d0a31a3de11187c8aef1e75d37cb80e8f9e01b960e58119952193e00d540","schema_version":"1.0","event_id":"sha256:ee72d0a31a3de11187c8aef1e75d37cb80e8f9e01b960e58119952193e00d540"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N5L7NJSY4W2TFJ66KCH26MHWIZ/bundle.json","state_url":"https://pith.science/pith/N5L7NJSY4W2TFJ66KCH26MHWIZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N5L7NJSY4W2TFJ66KCH26MHWIZ/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-07-02T16:46:14Z","links":{"resolver":"https://pith.science/pith/N5L7NJSY4W2TFJ66KCH26MHWIZ","bundle":"https://pith.science/pith/N5L7NJSY4W2TFJ66KCH26MHWIZ/bundle.json","state":"https://pith.science/pith/N5L7NJSY4W2TFJ66KCH26MHWIZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N5L7NJSY4W2TFJ66KCH26MHWIZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:N5L7NJSY4W2TFJ66KCH26MHWIZ","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":"1f5c76dd742960a0ade51898730e55aff1dc5aecab00f3fa07d9b498baa59a8a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-06-17T21:56:36Z","title_canon_sha256":"db844e746a6d2788792da97bd631d5f8b80817b8fef40ec7ff42249c3484e766"},"schema_version":"1.0","source":{"id":"1906.09722","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09722","created_at":"2026-05-17T23:42:36Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09722v1","created_at":"2026-05-17T23:42:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09722","created_at":"2026-05-17T23:42:36Z"},{"alias_kind":"pith_short_12","alias_value":"N5L7NJSY4W2T","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"N5L7NJSY4W2TFJ66","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"N5L7NJSY","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:ee72d0a31a3de11187c8aef1e75d37cb80e8f9e01b960e58119952193e00d540","target":"graph","created_at":"2026-05-17T23:42:36Z","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":"Mining and exploring databases should provide users with knowledge and new insights. Tiles of data strive to unveil true underlying structure and distinguish valuable information from various kinds of noise. We propose a novel Boolean matrix factorization algorithm to solve the tiling problem, based on recent results from optimization theory. In contrast to existing work, the new algorithm minimizes the description length of the resulting factorization. This approach is well known for model selection and data compression, but not for finding suitable factorizations via numerical optimization. ","authors_text":"Katharina Morik, Nico Piatkowski, Sibylle Hess","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-06-17T21:56:36Z","title":"The PRIMPing Routine -- Tiling through Proximal Alternating Linearized Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09722","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:938c02f328d171ff7a0cb210a4d8d8f4f08fade4b4e12e7759228ac6e0e9b32b","target":"record","created_at":"2026-05-17T23:42:36Z","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":"1f5c76dd742960a0ade51898730e55aff1dc5aecab00f3fa07d9b498baa59a8a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-06-17T21:56:36Z","title_canon_sha256":"db844e746a6d2788792da97bd631d5f8b80817b8fef40ec7ff42249c3484e766"},"schema_version":"1.0","source":{"id":"1906.09722","kind":"arxiv","version":1}},"canonical_sha256":"6f57f6a658e5b532a7de508faf30f64642b849b675718e253821f7dfce125973","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f57f6a658e5b532a7de508faf30f64642b849b675718e253821f7dfce125973","first_computed_at":"2026-05-17T23:42:36.978795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:36.978795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zl866scfaN78vz7aC6SsJXdGdJbw/clADpXiQGuIC7BfJ1ZRNFKQZZ1ZNPF2n6gQ+Ll23MvyOgXKRDCCd7iUAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:36.979594Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.09722","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:938c02f328d171ff7a0cb210a4d8d8f4f08fade4b4e12e7759228ac6e0e9b32b","sha256:ee72d0a31a3de11187c8aef1e75d37cb80e8f9e01b960e58119952193e00d540"],"state_sha256":"b3e8d25364c6cf569b1027eb81fcc2ac5427e6ba4fa63b0b737d704f5d472cfb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FR7VugJ6/lI5FmBBsCXEfh7p0ODkNCI7GU+V5yoMojfRVDEifMSgNe8i1FgiEgXkiJK58uZfeOedtVuqj/gYBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T16:46:14.067640Z","bundle_sha256":"65405c8f00592c71923c23fd43c752a3affe227093a03770847dd3e4ee830b38"}}