{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:22E7RZGACIHLIWK2M4GKL7OH7J","short_pith_number":"pith:22E7RZGA","canonical_record":{"source":{"id":"1210.6970","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-25T19:51:09Z","cross_cats_sorted":[],"title_canon_sha256":"edae3f8a7c416300fcd0c58863544fe43bb9aa8fc5ea4e9dd569146bcd4bed67","abstract_canon_sha256":"a368358f4d2ccf488c6ea56ac1cc1c435c9ca38c1c851e8e30f85eafb05f6423"},"schema_version":"1.0"},"canonical_sha256":"d689f8e4c0120eb4595a670ca5fdc7fa695775fd0da280ee904c09a763dcb2df","source":{"kind":"arxiv","id":"1210.6970","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6970","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6970v2","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6970","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"22E7RZGACIHL","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"22E7RZGACIHLIWK2","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"22E7RZGA","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:22E7RZGACIHLIWK2M4GKL7OH7J","target":"record","payload":{"canonical_record":{"source":{"id":"1210.6970","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-25T19:51:09Z","cross_cats_sorted":[],"title_canon_sha256":"edae3f8a7c416300fcd0c58863544fe43bb9aa8fc5ea4e9dd569146bcd4bed67","abstract_canon_sha256":"a368358f4d2ccf488c6ea56ac1cc1c435c9ca38c1c851e8e30f85eafb05f6423"},"schema_version":"1.0"},"canonical_sha256":"d689f8e4c0120eb4595a670ca5fdc7fa695775fd0da280ee904c09a763dcb2df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:07.104721Z","signature_b64":"UOEH6NvkFkD8cShVCvSefH71yvIjWGL5qtrKoRY6Qb4IzSYL4mtAKVqFlBiPLM3ihxtDDDBZEZJUYZZ2ysDvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d689f8e4c0120eb4595a670ca5fdc7fa695775fd0da280ee904c09a763dcb2df","last_reissued_at":"2026-05-18T01:33:07.104181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:07.104181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.6970","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vdGcftLgVK/dH1ltU4/BazaYFtU53eXMiAQ0hFYKsS/BJUzbpmWxu/ozsfrf8gbQ6aNR9PAtLsFn27YcxfjoBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:31:00.166190Z"},"content_sha256":"fd6d76a2c1bbf9d8b2967bb6d344fbef4371b86f3d876ed6bf5ddc543a0b6787","schema_version":"1.0","event_id":"sha256:fd6d76a2c1bbf9d8b2967bb6d344fbef4371b86f3d876ed6bf5ddc543a0b6787"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:22E7RZGACIHLIWK2M4GKL7OH7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower bounds on nonnegative rank via nonnegative nuclear norms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hamza Fawzi, Pablo A. Parrilo","submitted_at":"2012-10-25T19:51:09Z","abstract_excerpt":"The nonnegative rank of an entrywise nonnegative matrix A of size mxn is the smallest integer r such that A can be written as A=UV where U is mxr and V is rxn and U and V are both nonnegative. The nonnegative rank arises in different areas such as combinatorial optimization and communication complexity. Computing this quantity is NP-hard in general and it is thus important to find efficient bounding techniques especially in the context of the aforementioned applications. In this paper we propose a new lower bound on the nonnegative rank which, unlike most existing lower bounds, does not explic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6970","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EjEqgnMVt8upciZOpt0zwX5LM/gKG01e9GawNp7L6iW8j0ytc5k7YLKZfgCHGfp4GT4pOLX52pfRcpImXA7nBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:31:00.166651Z"},"content_sha256":"4862f7de638931a9e8f2581fabe094f7a0903e12e638e3c759f70af81050aef0","schema_version":"1.0","event_id":"sha256:4862f7de638931a9e8f2581fabe094f7a0903e12e638e3c759f70af81050aef0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22E7RZGACIHLIWK2M4GKL7OH7J/bundle.json","state_url":"https://pith.science/pith/22E7RZGACIHLIWK2M4GKL7OH7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22E7RZGACIHLIWK2M4GKL7OH7J/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T15:31:00Z","links":{"resolver":"https://pith.science/pith/22E7RZGACIHLIWK2M4GKL7OH7J","bundle":"https://pith.science/pith/22E7RZGACIHLIWK2M4GKL7OH7J/bundle.json","state":"https://pith.science/pith/22E7RZGACIHLIWK2M4GKL7OH7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22E7RZGACIHLIWK2M4GKL7OH7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:22E7RZGACIHLIWK2M4GKL7OH7J","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":"a368358f4d2ccf488c6ea56ac1cc1c435c9ca38c1c851e8e30f85eafb05f6423","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-25T19:51:09Z","title_canon_sha256":"edae3f8a7c416300fcd0c58863544fe43bb9aa8fc5ea4e9dd569146bcd4bed67"},"schema_version":"1.0","source":{"id":"1210.6970","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6970","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6970v2","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6970","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"22E7RZGACIHL","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"22E7RZGACIHLIWK2","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"22E7RZGA","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:4862f7de638931a9e8f2581fabe094f7a0903e12e638e3c759f70af81050aef0","target":"graph","created_at":"2026-05-18T01:33:07Z","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":"The nonnegative rank of an entrywise nonnegative matrix A of size mxn is the smallest integer r such that A can be written as A=UV where U is mxr and V is rxn and U and V are both nonnegative. The nonnegative rank arises in different areas such as combinatorial optimization and communication complexity. Computing this quantity is NP-hard in general and it is thus important to find efficient bounding techniques especially in the context of the aforementioned applications. In this paper we propose a new lower bound on the nonnegative rank which, unlike most existing lower bounds, does not explic","authors_text":"Hamza Fawzi, Pablo A. Parrilo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-25T19:51:09Z","title":"Lower bounds on nonnegative rank via nonnegative nuclear norms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6970","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:fd6d76a2c1bbf9d8b2967bb6d344fbef4371b86f3d876ed6bf5ddc543a0b6787","target":"record","created_at":"2026-05-18T01:33:07Z","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":"a368358f4d2ccf488c6ea56ac1cc1c435c9ca38c1c851e8e30f85eafb05f6423","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-25T19:51:09Z","title_canon_sha256":"edae3f8a7c416300fcd0c58863544fe43bb9aa8fc5ea4e9dd569146bcd4bed67"},"schema_version":"1.0","source":{"id":"1210.6970","kind":"arxiv","version":2}},"canonical_sha256":"d689f8e4c0120eb4595a670ca5fdc7fa695775fd0da280ee904c09a763dcb2df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d689f8e4c0120eb4595a670ca5fdc7fa695775fd0da280ee904c09a763dcb2df","first_computed_at":"2026-05-18T01:33:07.104181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:07.104181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UOEH6NvkFkD8cShVCvSefH71yvIjWGL5qtrKoRY6Qb4IzSYL4mtAKVqFlBiPLM3ihxtDDDBZEZJUYZZ2ysDvCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:07.104721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.6970","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd6d76a2c1bbf9d8b2967bb6d344fbef4371b86f3d876ed6bf5ddc543a0b6787","sha256:4862f7de638931a9e8f2581fabe094f7a0903e12e638e3c759f70af81050aef0"],"state_sha256":"23bbc0b18542847548fcfcffeaad7a282ac74bd72852e4fbe82606e55b38c7bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XUxFocVbIg91JLwhikg7MuFL+HdpMYmZCVech3ZsXiJIq/8yrZp6HWnWjD7j6YprFWpSXIboE6vAzpN+xVKVBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:31:00.168791Z","bundle_sha256":"9ab202411f813d81350b33ed11781c1c0a28076507508c71b9c5d12a763b14f6"}}