{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BBLDP3JFSAZTSIV5S6AUE5N5WC","short_pith_number":"pith:BBLDP3JF","schema_version":"1.0","canonical_sha256":"085637ed2590333922bd97814275bdb0a7569df354dbc4272b2c75a037a54036","source":{"kind":"arxiv","id":"1807.07156","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.07156","created_at":"2026-05-18T00:10:21.109697+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07156v1","created_at":"2026-05-18T00:10:21.109697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07156","created_at":"2026-05-18T00:10:21.109697+00:00"},{"alias_kind":"pith_short_12","alias_value":"BBLDP3JFSAZT","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"BBLDP3JFSAZTSIV5","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"BBLDP3JF","created_at":"2026-05-18T12:32:13.499390+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/BBLDP3JFSAZTSIV5S6AUE5N5WC","json":"https://pith.science/pith/BBLDP3JFSAZTSIV5S6AUE5N5WC.json","graph_json":"https://pith.science/api/pith-number/BBLDP3JFSAZTSIV5S6AUE5N5WC/graph.json","events_json":"https://pith.science/api/pith-number/BBLDP3JFSAZTSIV5S6AUE5N5WC/events.json","paper":"https://pith.science/paper/BBLDP3JF"},"agent_actions":{"view_html":"https://pith.science/pith/BBLDP3JFSAZTSIV5S6AUE5N5WC","download_json":"https://pith.science/pith/BBLDP3JFSAZTSIV5S6AUE5N5WC.json","view_paper":"https://pith.science/paper/BBLDP3JF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07156&json=true","fetch_graph":"https://pith.science/api/pith-number/BBLDP3JFSAZTSIV5S6AUE5N5WC/graph.json","fetch_events":"https://pith.science/api/pith-number/BBLDP3JFSAZTSIV5S6AUE5N5WC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BBLDP3JFSAZTSIV5S6AUE5N5WC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BBLDP3JFSAZTSIV5S6AUE5N5WC/action/storage_attestation","attest_author":"https://pith.science/pith/BBLDP3JFSAZTSIV5S6AUE5N5WC/action/author_attestation","sign_citation":"https://pith.science/pith/BBLDP3JFSAZTSIV5S6AUE5N5WC/action/citation_signature","submit_replication":"https://pith.science/pith/BBLDP3JFSAZTSIV5S6AUE5N5WC/action/replication_record"}},"created_at":"2026-05-18T00:10:21.109697+00:00","updated_at":"2026-05-18T00:10:21.109697+00:00"}