{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZS5SYORD5IPEZ7KYSYJF2F2VS4","short_pith_number":"pith:ZS5SYORD","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"},"canonical_sha256":"ccbb2c3a23ea1e4cfd5896125d1755971e4dbc3b0a46eba325156bed7197d773","source":{"kind":"arxiv","id":"1901.05797","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05797","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05797v1","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05797","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZS5SYORD5IPE","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZS5SYORD5IPEZ7KY","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZS5SYORD","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZS5SYORD5IPEZ7KYSYJF2F2VS4","target":"record","payload":{"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"},"canonical_sha256":"ccbb2c3a23ea1e4cfd5896125d1755971e4dbc3b0a46eba325156bed7197d773","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"},"source_kind":"arxiv","source_id":"1901.05797","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:46:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+UxH1fEhwfSUjfm3Yigu2QvlddCZO+M4X9mSfLknYfUvg/a93Z5IP5eusLd17ABKd/BNmL3uqDHKW/4tQypGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:37:10.487372Z"},"content_sha256":"cb66ae358ca93bdd47709946252ebd37f2364caaa1c04a5a564d5f5154e56345","schema_version":"1.0","event_id":"sha256:cb66ae358ca93bdd47709946252ebd37f2364caaa1c04a5a564d5f5154e56345"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZS5SYORD5IPEZ7KYSYJF2F2VS4","target":"graph","payload":{"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"},"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:46:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CcwKNWF2fAkZL7Yi2J4bkMagr4Oja5DJXRDXWL4USQaEjkg+W6UpZuH8Bw2dCbA9lLZzQgF9ByB3091gOaFlCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:37:10.487982Z"},"content_sha256":"d3afddaeb092ab529a73676347f6a0569945da4daf34be503f307414915aa150","schema_version":"1.0","event_id":"sha256:d3afddaeb092ab529a73676347f6a0569945da4daf34be503f307414915aa150"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZS5SYORD5IPEZ7KYSYJF2F2VS4/bundle.json","state_url":"https://pith.science/pith/ZS5SYORD5IPEZ7KYSYJF2F2VS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZS5SYORD5IPEZ7KYSYJF2F2VS4/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-26T14:37:10Z","links":{"resolver":"https://pith.science/pith/ZS5SYORD5IPEZ7KYSYJF2F2VS4","bundle":"https://pith.science/pith/ZS5SYORD5IPEZ7KYSYJF2F2VS4/bundle.json","state":"https://pith.science/pith/ZS5SYORD5IPEZ7KYSYJF2F2VS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZS5SYORD5IPEZ7KYSYJF2F2VS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZS5SYORD5IPEZ7KYSYJF2F2VS4","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":"8601237866a51bb0e2976ecf1a4c7882cdad301499ffa88cb6cfe309cfc9f1e8","cross_cats_sorted":["cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-17T14:16:55Z","title_canon_sha256":"d67a8b2de7cfd1c2e5795bd0d996807647098818b39ef67f2590ff263c12d66e"},"schema_version":"1.0","source":{"id":"1901.05797","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05797","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05797v1","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05797","created_at":"2026-05-17T23:46:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZS5SYORD5IPE","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZS5SYORD5IPEZ7KY","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZS5SYORD","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:d3afddaeb092ab529a73676347f6a0569945da4daf34be503f307414915aa150","target":"graph","created_at":"2026-05-17T23:46:09Z","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":"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","authors_text":"Nikolaj Tatti, Pauli Miettinen","cross_cats":["cs.DM","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-17T14:16:55Z","title":"Boolean matrix factorization meets consecutive ones property"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05797","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:cb66ae358ca93bdd47709946252ebd37f2364caaa1c04a5a564d5f5154e56345","target":"record","created_at":"2026-05-17T23:46:09Z","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":"8601237866a51bb0e2976ecf1a4c7882cdad301499ffa88cb6cfe309cfc9f1e8","cross_cats_sorted":["cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-17T14:16:55Z","title_canon_sha256":"d67a8b2de7cfd1c2e5795bd0d996807647098818b39ef67f2590ff263c12d66e"},"schema_version":"1.0","source":{"id":"1901.05797","kind":"arxiv","version":1}},"canonical_sha256":"ccbb2c3a23ea1e4cfd5896125d1755971e4dbc3b0a46eba325156bed7197d773","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccbb2c3a23ea1e4cfd5896125d1755971e4dbc3b0a46eba325156bed7197d773","first_computed_at":"2026-05-17T23:46:09.229480Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:09.229480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P/730oifyeP/J7Iak+Fg1INnkgs3ldnWB3SggfUdxrE7ozSgI15XYJ4PQSgnP4h+KSYuBzbkD5jHKd+DggieBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:09.229947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.05797","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb66ae358ca93bdd47709946252ebd37f2364caaa1c04a5a564d5f5154e56345","sha256:d3afddaeb092ab529a73676347f6a0569945da4daf34be503f307414915aa150"],"state_sha256":"53a95f4698f477af8e98188121ef3d5fa3d7275b8b1c7174e6c4144d58f88707"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+mKIV78YkxM4jMuSbSdvVAYVRb4gfWHfg0mwzYnjLe4kgZhlZibLDHxeqM588k5DjpvG95/pgCSBw44g53ltAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:37:10.491482Z","bundle_sha256":"18783188e3e13a26047694f2c2a5380b10b1f0d5263659f481341783f2952e45"}}