{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZS5SYORD5IPEZ7KYSYJF2F2VS4","short_pith_number":"pith:ZS5SYORD","schema_version":"1.0","canonical_sha256":"ccbb2c3a23ea1e4cfd5896125d1755971e4dbc3b0a46eba325156bed7197d773","source":{"kind":"arxiv","id":"1901.05797","version":1},"attestation_state":"computed","paper":{"title":"Boolean matrix factorization meets consecutive ones property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG"],"primary_cat":"cs.DS","authors_text":"Nikolaj Tatti, Pauli Miettinen","submitted_at":"2019-01-17T14:16:55Z","abstract_excerpt":"Boolean matrix factorization is a natural and a popular technique for summarizing binary matrices. In this paper, we study a problem of Boolean matrix factorization where we additionally require that the factor matrices have consecutive ones property (OBMF). A major application of this optimization problem comes from graph visualization: standard techniques for visualizing graphs are circular or linear layout, where nodes are ordered in circle or on a line. A common problem with visualizing graphs is clutter due to too many edges. The standard approach to deal with this is to bundle edges toge"},"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.05797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-17T14:16:55Z","cross_cats_sorted":["cs.DM","cs.LG"],"title_canon_sha256":"d67a8b2de7cfd1c2e5795bd0d996807647098818b39ef67f2590ff263c12d66e","abstract_canon_sha256":"8601237866a51bb0e2976ecf1a4c7882cdad301499ffa88cb6cfe309cfc9f1e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:09.229947Z","signature_b64":"P/730oifyeP/J7Iak+Fg1INnkgs3ldnWB3SggfUdxrE7ozSgI15XYJ4PQSgnP4h+KSYuBzbkD5jHKd+DggieBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccbb2c3a23ea1e4cfd5896125d1755971e4dbc3b0a46eba325156bed7197d773","last_reissued_at":"2026-05-17T23:46:09.229480Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:09.229480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Boolean matrix factorization meets consecutive ones property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG"],"primary_cat":"cs.DS","authors_text":"Nikolaj Tatti, Pauli Miettinen","submitted_at":"2019-01-17T14:16:55Z","abstract_excerpt":"Boolean matrix factorization is a natural and a popular technique for summarizing binary matrices. In this paper, we study a problem of Boolean matrix factorization where we additionally require that the factor matrices have consecutive ones property (OBMF). A major application of this optimization problem comes from graph visualization: standard techniques for visualizing graphs are circular or linear layout, where nodes are ordered in circle or on a line. A common problem with visualizing graphs is clutter due to too many edges. The standard approach to deal with this is to bundle edges toge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05797","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.05797","created_at":"2026-05-17T23:46:09.229544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.05797v1","created_at":"2026-05-17T23:46:09.229544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05797","created_at":"2026-05-17T23:46:09.229544+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZS5SYORD5IPE","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZS5SYORD5IPEZ7KY","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZS5SYORD","created_at":"2026-05-18T12:33:33.725879+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/ZS5SYORD5IPEZ7KYSYJF2F2VS4","json":"https://pith.science/pith/ZS5SYORD5IPEZ7KYSYJF2F2VS4.json","graph_json":"https://pith.science/api/pith-number/ZS5SYORD5IPEZ7KYSYJF2F2VS4/graph.json","events_json":"https://pith.science/api/pith-number/ZS5SYORD5IPEZ7KYSYJF2F2VS4/events.json","paper":"https://pith.science/paper/ZS5SYORD"},"agent_actions":{"view_html":"https://pith.science/pith/ZS5SYORD5IPEZ7KYSYJF2F2VS4","download_json":"https://pith.science/pith/ZS5SYORD5IPEZ7KYSYJF2F2VS4.json","view_paper":"https://pith.science/paper/ZS5SYORD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.05797&json=true","fetch_graph":"https://pith.science/api/pith-number/ZS5SYORD5IPEZ7KYSYJF2F2VS4/graph.json","fetch_events":"https://pith.science/api/pith-number/ZS5SYORD5IPEZ7KYSYJF2F2VS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZS5SYORD5IPEZ7KYSYJF2F2VS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZS5SYORD5IPEZ7KYSYJF2F2VS4/action/storage_attestation","attest_author":"https://pith.science/pith/ZS5SYORD5IPEZ7KYSYJF2F2VS4/action/author_attestation","sign_citation":"https://pith.science/pith/ZS5SYORD5IPEZ7KYSYJF2F2VS4/action/citation_signature","submit_replication":"https://pith.science/pith/ZS5SYORD5IPEZ7KYSYJF2F2VS4/action/replication_record"}},"created_at":"2026-05-17T23:46:09.229544+00:00","updated_at":"2026-05-17T23:46:09.229544+00:00"}