{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CKSKTKCXORKQCWNATQY4XHJEMH","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":"e079e9b7ac5c30e17f997998d525a3ba1680d89b3cb9a82dd4d18a994334dcb3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-16T07:47:27Z","title_canon_sha256":"579176c0ccba90d129b2fa4cac55ec6a4a8036840e0b167c686f1b6bb39ee9ac"},"schema_version":"1.0","source":{"id":"1803.06102","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06102","created_at":"2026-05-18T00:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06102v1","created_at":"2026-05-18T00:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06102","created_at":"2026-05-18T00:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"CKSKTKCXORKQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CKSKTKCXORKQCWNA","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CKSKTKCX","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:d70a148d1bd46d092a11ceb5266bf24f18fbb9fff4d0abbdef2eff7ebbafb01a","target":"graph","created_at":"2026-05-18T00:20:50Z","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 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","authors_text":"Fahad Panolan, Fedor V. Fomin, Petr A. Golovach","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-16T07:47:27Z","title":"Parameterized Low-Rank Binary Matrix Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06102","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:1f2b41f51a529f4b82c00c94a91fc355ebb3301f8700052ea469ced080ad3867","target":"record","created_at":"2026-05-18T00:20:50Z","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":"e079e9b7ac5c30e17f997998d525a3ba1680d89b3cb9a82dd4d18a994334dcb3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-16T07:47:27Z","title_canon_sha256":"579176c0ccba90d129b2fa4cac55ec6a4a8036840e0b167c686f1b6bb39ee9ac"},"schema_version":"1.0","source":{"id":"1803.06102","kind":"arxiv","version":1}},"canonical_sha256":"12a4a9a85774550159a09c31cb9d2461c061c95b6eea7e29b2fe237f058ecb18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12a4a9a85774550159a09c31cb9d2461c061c95b6eea7e29b2fe237f058ecb18","first_computed_at":"2026-05-18T00:20:50.641362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:50.641362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gZZfy7KkgmxPOqbvxFFhiU3iQ3D+95z0JnQgRtH+FnpH2SYQOexMTnEhNKHt5XFBMxw6e62NA8LY+dbmIxUvDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:50.641851Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06102","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f2b41f51a529f4b82c00c94a91fc355ebb3301f8700052ea469ced080ad3867","sha256:d70a148d1bd46d092a11ceb5266bf24f18fbb9fff4d0abbdef2eff7ebbafb01a"],"state_sha256":"920b6c79c440615fce644e57d882893ae21df219490b6545f697b450f65b8d8f"}