{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FAMT6CPVPN4FG7C3X7AGBF4CMJ","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":"8e0ce056a3e05ccb6c21f653612fb7a7fcdb3d3d934040027f2955934a8dfacc","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-30T22:26:51Z","title_canon_sha256":"939ae889270ba76df3beecefffd3149831aecf78442f66989518dbde6a5120e0"},"schema_version":"1.0","source":{"id":"1205.0044","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0044","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0044v1","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0044","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"FAMT6CPVPN4F","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"FAMT6CPVPN4FG7C3","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"FAMT6CPV","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:c2e1e6e68c06bab166d98b7098ef8c8a25fb7afddbea89a6f4fee422420f7eb1","target":"graph","created_at":"2026-05-18T03:56:35Z","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":"Here, we give an algorithm for deciding if the nonnegative rank of a matrix $M$ of dimension $m \\times n$ is at most $r$ which runs in time $(nm)^{O(r^2)}$. This is the first exact algorithm that runs in time singly-exponential in $r$. This algorithm (and earlier algorithms) are built on methods for finding a solution to a system of polynomial inequalities (if one exists). Notably, the best algorithms for this task run in time exponential in the number of variables but polynomial in all of the other parameters (the number of inequalities and the maximum degree).\n  Hence these algorithms motiva","authors_text":"Ankur Moitra","cross_cats":["cs.IR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-30T22:26:51Z","title":"A Singly-Exponential Time Algorithm for Computing Nonnegative Rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0044","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:8f1d3c38d28783fc421012cd220b05fcb5c528269fc5b545abf09f99034dacd9","target":"record","created_at":"2026-05-18T03:56:35Z","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":"8e0ce056a3e05ccb6c21f653612fb7a7fcdb3d3d934040027f2955934a8dfacc","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-30T22:26:51Z","title_canon_sha256":"939ae889270ba76df3beecefffd3149831aecf78442f66989518dbde6a5120e0"},"schema_version":"1.0","source":{"id":"1205.0044","kind":"arxiv","version":1}},"canonical_sha256":"28193f09f57b78537c5bbfc06097826259d4e16a78e4c02286a62a311fbf3466","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28193f09f57b78537c5bbfc06097826259d4e16a78e4c02286a62a311fbf3466","first_computed_at":"2026-05-18T03:56:35.963241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:35.963241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pOub2CnsVaKR6q2ExLZwTIRL6qrYpSPhtHZq2FsrYYnJSNUYiSevDfu6W7U0Vr5EWSZpXNfl0o0fbrDgTzYwBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:35.963885Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.0044","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f1d3c38d28783fc421012cd220b05fcb5c528269fc5b545abf09f99034dacd9","sha256:c2e1e6e68c06bab166d98b7098ef8c8a25fb7afddbea89a6f4fee422420f7eb1"],"state_sha256":"e00472801516e4047a9c82f4d7ab2c7f44cc1de96661f7b55eae278fd031ddf1"}