{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NWOCORB67HIPKCIF2STEDDE6PF","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":"8299d55c384e0aedd30e845cc29b952e4db2fa481edb61631afdb28968a3b87d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-16T13:09:18Z","title_canon_sha256":"c82a8f13f5defd02e826872b15658964cc39cb496c2c9fa8307d1c79e25cce2b"},"schema_version":"1.0","source":{"id":"1609.05034","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05034","created_at":"2026-05-18T01:03:05Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05034v2","created_at":"2026-05-18T01:03:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05034","created_at":"2026-05-18T01:03:05Z"},{"alias_kind":"pith_short_12","alias_value":"NWOCORB67HIP","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NWOCORB67HIPKCIF","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NWOCORB6","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:35014e81c8f7fafde95ceb496a669129d530975027ca140a8dbacbf73420a4f8","target":"graph","created_at":"2026-05-18T01:03:05Z","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":"When factorizing binary matrices, we often have to make a choice between using expensive combinatorial methods that retain the discrete nature of the data and using continuous methods that can be more efficient but destroy the discrete structure. Alternatively, we can first compute a continuous factorization and subsequently apply a rounding procedure to obtain a discrete representation. But what will we gain by rounding? Will this yield lower reconstruction errors? Is it easy to find a low-rank matrix that rounds to a given binary matrix? Does it matter which threshold we use for rounding? Do","authors_text":"Pauli Miettinen, Rainer Gemulla, Stefan Neumann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-16T13:09:18Z","title":"What You Will Gain By Rounding: Theory and Algorithms for Rounding Rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05034","kind":"arxiv","version":2},"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:bd249e81d28f2bf877cb14b31ae2b23dc9aa2f2e2d96ff635a34e858b1413f9a","target":"record","created_at":"2026-05-18T01:03:05Z","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":"8299d55c384e0aedd30e845cc29b952e4db2fa481edb61631afdb28968a3b87d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-16T13:09:18Z","title_canon_sha256":"c82a8f13f5defd02e826872b15658964cc39cb496c2c9fa8307d1c79e25cce2b"},"schema_version":"1.0","source":{"id":"1609.05034","kind":"arxiv","version":2}},"canonical_sha256":"6d9c27443ef9d0f50905d4a6418c9e797ddf8ba47dd17165177cee1b7f86cb0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d9c27443ef9d0f50905d4a6418c9e797ddf8ba47dd17165177cee1b7f86cb0b","first_computed_at":"2026-05-18T01:03:05.546710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:05.546710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c+WAk5xDyw5REgOOkUo7+F88Xgf7etdEzXv3pa5J1zHjpu9GxcP6VZ2c8cLXVUgxtoYU0V7W6U+KVPNjV7ZQDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:05.547236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.05034","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd249e81d28f2bf877cb14b31ae2b23dc9aa2f2e2d96ff635a34e858b1413f9a","sha256:35014e81c8f7fafde95ceb496a669129d530975027ca140a8dbacbf73420a4f8"],"state_sha256":"6c04f0f6908e2ceed87150689495bfa9e0e51490faa701d101688eb18f9ed91c"}