{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CKSKTKCXORKQCWNATQY4XHJEMH","short_pith_number":"pith:CKSKTKCX","schema_version":"1.0","canonical_sha256":"12a4a9a85774550159a09c31cb9d2461c061c95b6eea7e29b2fe237f058ecb18","source":{"kind":"arxiv","id":"1803.06102","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Low-Rank Binary Matrix Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Fahad Panolan, Fedor V. Fomin, Petr A. Golovach","submitted_at":"2018-03-16T07:47:27Z","abstract_excerpt":"We provide a number of algorithmic results for the following family of problems: For a given binary m\\times n matrix A and integer k, decide whether there is a \"simple\" binary matrix B which differs from A in at most k entries. For an integer r, the \"simplicity\" of B is characterized as follows.\n  - Binary r-Means: Matrix B has at most r different columns. This problem is known to be NP-complete already for r=2. We show that the problem is solvable in time 2^{O(k\\log k)}\\cdot(nm)^{O(1)} and thus is fixed-parameter tractable parameterized by k. We prove that the problem admits a polynomial kern"},"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":"1803.06102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-16T07:47:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"579176c0ccba90d129b2fa4cac55ec6a4a8036840e0b167c686f1b6bb39ee9ac","abstract_canon_sha256":"e079e9b7ac5c30e17f997998d525a3ba1680d89b3cb9a82dd4d18a994334dcb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:50.641851Z","signature_b64":"gZZfy7KkgmxPOqbvxFFhiU3iQ3D+95z0JnQgRtH+FnpH2SYQOexMTnEhNKHt5XFBMxw6e62NA8LY+dbmIxUvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12a4a9a85774550159a09c31cb9d2461c061c95b6eea7e29b2fe237f058ecb18","last_reissued_at":"2026-05-18T00:20:50.641362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:50.641362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Low-Rank Binary Matrix Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Fahad Panolan, Fedor V. Fomin, Petr A. Golovach","submitted_at":"2018-03-16T07:47:27Z","abstract_excerpt":"We provide a number of algorithmic results for the following family of problems: For a given binary m\\times n matrix A and integer k, decide whether there is a \"simple\" binary matrix B which differs from A in at most k entries. For an integer r, the \"simplicity\" of B is characterized as follows.\n  - Binary r-Means: Matrix B has at most r different columns. This problem is known to be NP-complete already for r=2. We show that the problem is solvable in time 2^{O(k\\log k)}\\cdot(nm)^{O(1)} and thus is fixed-parameter tractable parameterized by k. We prove that the problem admits a polynomial kern"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06102","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":"1803.06102","created_at":"2026-05-18T00:20:50.641435+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06102v1","created_at":"2026-05-18T00:20:50.641435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06102","created_at":"2026-05-18T00:20:50.641435+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKSKTKCXORKQ","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKSKTKCXORKQCWNA","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKSKTKCX","created_at":"2026-05-18T12:32:16.446611+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/CKSKTKCXORKQCWNATQY4XHJEMH","json":"https://pith.science/pith/CKSKTKCXORKQCWNATQY4XHJEMH.json","graph_json":"https://pith.science/api/pith-number/CKSKTKCXORKQCWNATQY4XHJEMH/graph.json","events_json":"https://pith.science/api/pith-number/CKSKTKCXORKQCWNATQY4XHJEMH/events.json","paper":"https://pith.science/paper/CKSKTKCX"},"agent_actions":{"view_html":"https://pith.science/pith/CKSKTKCXORKQCWNATQY4XHJEMH","download_json":"https://pith.science/pith/CKSKTKCXORKQCWNATQY4XHJEMH.json","view_paper":"https://pith.science/paper/CKSKTKCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06102&json=true","fetch_graph":"https://pith.science/api/pith-number/CKSKTKCXORKQCWNATQY4XHJEMH/graph.json","fetch_events":"https://pith.science/api/pith-number/CKSKTKCXORKQCWNATQY4XHJEMH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKSKTKCXORKQCWNATQY4XHJEMH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKSKTKCXORKQCWNATQY4XHJEMH/action/storage_attestation","attest_author":"https://pith.science/pith/CKSKTKCXORKQCWNATQY4XHJEMH/action/author_attestation","sign_citation":"https://pith.science/pith/CKSKTKCXORKQCWNATQY4XHJEMH/action/citation_signature","submit_replication":"https://pith.science/pith/CKSKTKCXORKQCWNATQY4XHJEMH/action/replication_record"}},"created_at":"2026-05-18T00:20:50.641435+00:00","updated_at":"2026-05-18T00:20:50.641435+00:00"}