{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BBLDP3JFSAZTSIV5S6AUE5N5WC","short_pith_number":"pith:BBLDP3JF","canonical_record":{"source":{"id":"1807.07156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-18T21:11:35Z","cross_cats_sorted":["cs.CC","cs.LG"],"title_canon_sha256":"c73400608a044801ef0b236c9cdab208771fc3028a753d5c2085f975515b2d26","abstract_canon_sha256":"7107d291b4393b24d9f568cb0e0e7f17d0d5c25e1c042a61833568624eb88970"},"schema_version":"1.0"},"canonical_sha256":"085637ed2590333922bd97814275bdb0a7569df354dbc4272b2c75a037a54036","source":{"kind":"arxiv","id":"1807.07156","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07156","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07156v1","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07156","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"pith_short_12","alias_value":"BBLDP3JFSAZT","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BBLDP3JFSAZTSIV5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BBLDP3JF","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BBLDP3JFSAZTSIV5S6AUE5N5WC","target":"record","payload":{"canonical_record":{"source":{"id":"1807.07156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-18T21:11:35Z","cross_cats_sorted":["cs.CC","cs.LG"],"title_canon_sha256":"c73400608a044801ef0b236c9cdab208771fc3028a753d5c2085f975515b2d26","abstract_canon_sha256":"7107d291b4393b24d9f568cb0e0e7f17d0d5c25e1c042a61833568624eb88970"},"schema_version":"1.0"},"canonical_sha256":"085637ed2590333922bd97814275bdb0a7569df354dbc4272b2c75a037a54036","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:21.110257Z","signature_b64":"X0JNdZSegv0bKx+f5SWIamYALvyMsCnsZ4DH2inQgIuGrLJUiTpWwqv+53tRyZIL0Qj3/A6NNmsxYlpyQoyVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"085637ed2590333922bd97814275bdb0a7569df354dbc4272b2c75a037a54036","last_reissued_at":"2026-05-18T00:10:21.109599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:21.109599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.07156","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-18T00:10:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EIqe+rEZ4+v+jSDzVKtC0ITtWb9CK9Q9eicj3hADkGzWzhVcpjHwHFe+T/YddKm1B5sckpKObl1zDeV7lBIICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:25:29.145291Z"},"content_sha256":"d2adb00be2268b2e3f78e0be4a790a56d27f0af97f17b04ae7651ccb52cef256","schema_version":"1.0","event_id":"sha256:d2adb00be2268b2e3f78e0be4a790a56d27f0af97f17b04ae7651ccb52cef256"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BBLDP3JFSAZTSIV5S6AUE5N5WC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Schemes for Low-Rank Binary Matrix Approximation Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fahad Panolan, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh","submitted_at":"2018-07-18T21:11:35Z","abstract_excerpt":"We provide a randomized linear time approximation scheme for a generic problem about clustering of binary vectors subject to additional constrains. The new constrained clustering problem encompasses a number of problems and by solving it, we obtain the first linear time-approximation schemes for a number of well-studied fundamental problems concerning clustering of binary vectors and low-rank approximation of binary matrices. Among the problems solvable by our approach are \\textsc{Low GF(2)-Rank Approximation}, \\textsc{Low Boolean-Rank Approximation}, and various versions of \\textsc{Binary Clu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07156","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-18T00:10:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pmUqTiS4fSNSO4CajAf3DjqMOXGxnKgZN7ilMY7Kj0lg0zTPEYBPrehRaF2luzpq7JMRb1Pm67AuLz3wH+/4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:25:29.145953Z"},"content_sha256":"0abb9c54d4f63155560a4c056aad2a2bfb1f107ab3e526f958428e36c3f3a66f","schema_version":"1.0","event_id":"sha256:0abb9c54d4f63155560a4c056aad2a2bfb1f107ab3e526f958428e36c3f3a66f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BBLDP3JFSAZTSIV5S6AUE5N5WC/bundle.json","state_url":"https://pith.science/pith/BBLDP3JFSAZTSIV5S6AUE5N5WC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BBLDP3JFSAZTSIV5S6AUE5N5WC/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-25T16:25:29Z","links":{"resolver":"https://pith.science/pith/BBLDP3JFSAZTSIV5S6AUE5N5WC","bundle":"https://pith.science/pith/BBLDP3JFSAZTSIV5S6AUE5N5WC/bundle.json","state":"https://pith.science/pith/BBLDP3JFSAZTSIV5S6AUE5N5WC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BBLDP3JFSAZTSIV5S6AUE5N5WC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BBLDP3JFSAZTSIV5S6AUE5N5WC","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":"7107d291b4393b24d9f568cb0e0e7f17d0d5c25e1c042a61833568624eb88970","cross_cats_sorted":["cs.CC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-18T21:11:35Z","title_canon_sha256":"c73400608a044801ef0b236c9cdab208771fc3028a753d5c2085f975515b2d26"},"schema_version":"1.0","source":{"id":"1807.07156","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07156","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07156v1","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07156","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"pith_short_12","alias_value":"BBLDP3JFSAZT","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BBLDP3JFSAZTSIV5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BBLDP3JF","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:0abb9c54d4f63155560a4c056aad2a2bfb1f107ab3e526f958428e36c3f3a66f","target":"graph","created_at":"2026-05-18T00:10:21Z","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":"We provide a randomized linear time approximation scheme for a generic problem about clustering of binary vectors subject to additional constrains. The new constrained clustering problem encompasses a number of problems and by solving it, we obtain the first linear time-approximation schemes for a number of well-studied fundamental problems concerning clustering of binary vectors and low-rank approximation of binary matrices. Among the problems solvable by our approach are \\textsc{Low GF(2)-Rank Approximation}, \\textsc{Low Boolean-Rank Approximation}, and various versions of \\textsc{Binary Clu","authors_text":"Daniel Lokshtanov, Fahad Panolan, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh","cross_cats":["cs.CC","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-18T21:11:35Z","title":"Approximation Schemes for Low-Rank Binary Matrix Approximation Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07156","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:d2adb00be2268b2e3f78e0be4a790a56d27f0af97f17b04ae7651ccb52cef256","target":"record","created_at":"2026-05-18T00:10:21Z","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":"7107d291b4393b24d9f568cb0e0e7f17d0d5c25e1c042a61833568624eb88970","cross_cats_sorted":["cs.CC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-18T21:11:35Z","title_canon_sha256":"c73400608a044801ef0b236c9cdab208771fc3028a753d5c2085f975515b2d26"},"schema_version":"1.0","source":{"id":"1807.07156","kind":"arxiv","version":1}},"canonical_sha256":"085637ed2590333922bd97814275bdb0a7569df354dbc4272b2c75a037a54036","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"085637ed2590333922bd97814275bdb0a7569df354dbc4272b2c75a037a54036","first_computed_at":"2026-05-18T00:10:21.109599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:21.109599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X0JNdZSegv0bKx+f5SWIamYALvyMsCnsZ4DH2inQgIuGrLJUiTpWwqv+53tRyZIL0Qj3/A6NNmsxYlpyQoyVBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:21.110257Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.07156","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2adb00be2268b2e3f78e0be4a790a56d27f0af97f17b04ae7651ccb52cef256","sha256:0abb9c54d4f63155560a4c056aad2a2bfb1f107ab3e526f958428e36c3f3a66f"],"state_sha256":"5d001006814dbf8278d574fdd60cf93a94505c5dfd3c737409bac029f3fc504e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R6utldnI1M12RG+GOJpsAB2AQX+1eMtECjnlx968aQZHf4+gO36uTcsUec0r4oWMXuC9SUCjQ5oPzDsVADJbAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:25:29.149884Z","bundle_sha256":"70ec473dd08b48d014c03b7bae20678efeb73de73ff1d7ff257aaa0d7b18ac23"}}