{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:LBFBY36LZKO6NVVXA3JMD52VEP","short_pith_number":"pith:LBFBY36L","canonical_record":{"source":{"id":"0708.4149","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.NA","submitted_at":"2007-08-30T13:01:33Z","cross_cats_sorted":["cs.IR","cs.NA"],"title_canon_sha256":"6f4c31103ad805f09db76ade430dc6b6f090ea7897052e1c7d9d443d076fb388","abstract_canon_sha256":"bde9bd3ad2319ca4f9b0266065c62550b18e5e869b8da2f32bc63972463e1096"},"schema_version":"1.0"},"canonical_sha256":"584a1c6fcbca9de6d6b706d2c1f75523eb8cbc2f87653b71d9a61e9002654846","source":{"kind":"arxiv","id":"0708.4149","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0708.4149","created_at":"2026-06-03T22:06:02Z"},{"alias_kind":"arxiv_version","alias_value":"0708.4149v2","created_at":"2026-06-03T22:06:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0708.4149","created_at":"2026-06-03T22:06:02Z"},{"alias_kind":"pith_short_12","alias_value":"LBFBY36LZKO6","created_at":"2026-06-03T22:06:02Z"},{"alias_kind":"pith_short_16","alias_value":"LBFBY36LZKO6NVVX","created_at":"2026-06-03T22:06:02Z"},{"alias_kind":"pith_short_8","alias_value":"LBFBY36L","created_at":"2026-06-03T22:06:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:LBFBY36LZKO6NVVXA3JMD52VEP","target":"record","payload":{"canonical_record":{"source":{"id":"0708.4149","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.NA","submitted_at":"2007-08-30T13:01:33Z","cross_cats_sorted":["cs.IR","cs.NA"],"title_canon_sha256":"6f4c31103ad805f09db76ade430dc6b6f090ea7897052e1c7d9d443d076fb388","abstract_canon_sha256":"bde9bd3ad2319ca4f9b0266065c62550b18e5e869b8da2f32bc63972463e1096"},"schema_version":"1.0"},"canonical_sha256":"584a1c6fcbca9de6d6b706d2c1f75523eb8cbc2f87653b71d9a61e9002654846","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:02.095729Z","signature_b64":"euor5QewjFB91Wt3lbdfoELsKZASPZIseVnbib84+2ZGPiTsm/d8a8qx6GA/9CA8OzpAcnK8OL7osF+3DrOhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"584a1c6fcbca9de6d6b706d2c1f75523eb8cbc2f87653b71d9a61e9002654846","last_reissued_at":"2026-06-03T22:06:02.095170Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:02.095170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0708.4149","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-06-03T22:06:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sGeDOwJn7MjcXqEIbLZ3Uc+UCFRgmIfbz6w2OuSGnR8e5qlLkzpLWVg6kesGsKkB4E2Zpp07Q+3NmD4rMMjhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T00:34:44.037996Z"},"content_sha256":"b447da551ac864e0a7fbe05e97a6312acadfadcfe0afdd2a80747606d0386f87","schema_version":"1.0","event_id":"sha256:b447da551ac864e0a7fbe05e97a6312acadfadcfe0afdd2a80747606d0386f87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:LBFBY36LZKO6NVVXA3JMD52VEP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the complexity of nonnegative matrix factorization","license":"","headline":"","cross_cats":["cs.IR","cs.NA"],"primary_cat":"cs.NA","authors_text":"Stephen A. Vavasis","submitted_at":"2007-08-30T13:01:33Z","abstract_excerpt":"Nonnegative matrix factorization (NMF) has become a prominent technique for the analysis of image databases, text databases and other information retrieval and clustering applications. In this report, we define an exact version of NMF. Then we establish several results about exact NMF: (1) that it is equivalent to a problem in polyhedral combinatorics; (2) that it is NP-hard; and (3) that a polynomial-time local search heuristic exists."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0708.4149","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0708.4149/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-03T22:06:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EWySXpQe1b8/ObLqEUPO+GZ+/TIuDe3PzOP8A/7mLml1GIBBlB4b20lf4OqQPMHTFl/OkDcWecH4LtJlETIMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T00:34:44.038543Z"},"content_sha256":"443d2f2aff494e740aadc1456a30927c1be8a8d2f666bdd49321b84ec864d8ba","schema_version":"1.0","event_id":"sha256:443d2f2aff494e740aadc1456a30927c1be8a8d2f666bdd49321b84ec864d8ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LBFBY36LZKO6NVVXA3JMD52VEP/bundle.json","state_url":"https://pith.science/pith/LBFBY36LZKO6NVVXA3JMD52VEP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LBFBY36LZKO6NVVXA3JMD52VEP/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-08-10T00:34:44Z","links":{"resolver":"https://pith.science/pith/LBFBY36LZKO6NVVXA3JMD52VEP","bundle":"https://pith.science/pith/LBFBY36LZKO6NVVXA3JMD52VEP/bundle.json","state":"https://pith.science/pith/LBFBY36LZKO6NVVXA3JMD52VEP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LBFBY36LZKO6NVVXA3JMD52VEP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:LBFBY36LZKO6NVVXA3JMD52VEP","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":"bde9bd3ad2319ca4f9b0266065c62550b18e5e869b8da2f32bc63972463e1096","cross_cats_sorted":["cs.IR","cs.NA"],"license":"","primary_cat":"cs.NA","submitted_at":"2007-08-30T13:01:33Z","title_canon_sha256":"6f4c31103ad805f09db76ade430dc6b6f090ea7897052e1c7d9d443d076fb388"},"schema_version":"1.0","source":{"id":"0708.4149","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0708.4149","created_at":"2026-06-03T22:06:02Z"},{"alias_kind":"arxiv_version","alias_value":"0708.4149v2","created_at":"2026-06-03T22:06:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0708.4149","created_at":"2026-06-03T22:06:02Z"},{"alias_kind":"pith_short_12","alias_value":"LBFBY36LZKO6","created_at":"2026-06-03T22:06:02Z"},{"alias_kind":"pith_short_16","alias_value":"LBFBY36LZKO6NVVX","created_at":"2026-06-03T22:06:02Z"},{"alias_kind":"pith_short_8","alias_value":"LBFBY36L","created_at":"2026-06-03T22:06:02Z"}],"graph_snapshots":[{"event_id":"sha256:443d2f2aff494e740aadc1456a30927c1be8a8d2f666bdd49321b84ec864d8ba","target":"graph","created_at":"2026-06-03T22:06:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0708.4149/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Nonnegative matrix factorization (NMF) has become a prominent technique for the analysis of image databases, text databases and other information retrieval and clustering applications. In this report, we define an exact version of NMF. Then we establish several results about exact NMF: (1) that it is equivalent to a problem in polyhedral combinatorics; (2) that it is NP-hard; and (3) that a polynomial-time local search heuristic exists.","authors_text":"Stephen A. Vavasis","cross_cats":["cs.IR","cs.NA"],"headline":"","license":"","primary_cat":"cs.NA","submitted_at":"2007-08-30T13:01:33Z","title":"On the complexity of nonnegative matrix factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0708.4149","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:b447da551ac864e0a7fbe05e97a6312acadfadcfe0afdd2a80747606d0386f87","target":"record","created_at":"2026-06-03T22:06:02Z","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":"bde9bd3ad2319ca4f9b0266065c62550b18e5e869b8da2f32bc63972463e1096","cross_cats_sorted":["cs.IR","cs.NA"],"license":"","primary_cat":"cs.NA","submitted_at":"2007-08-30T13:01:33Z","title_canon_sha256":"6f4c31103ad805f09db76ade430dc6b6f090ea7897052e1c7d9d443d076fb388"},"schema_version":"1.0","source":{"id":"0708.4149","kind":"arxiv","version":2}},"canonical_sha256":"584a1c6fcbca9de6d6b706d2c1f75523eb8cbc2f87653b71d9a61e9002654846","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"584a1c6fcbca9de6d6b706d2c1f75523eb8cbc2f87653b71d9a61e9002654846","first_computed_at":"2026-06-03T22:06:02.095170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T22:06:02.095170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"euor5QewjFB91Wt3lbdfoELsKZASPZIseVnbib84+2ZGPiTsm/d8a8qx6GA/9CA8OzpAcnK8OL7osF+3DrOhBA==","signature_status":"signed_v1","signed_at":"2026-06-03T22:06:02.095729Z","signed_message":"canonical_sha256_bytes"},"source_id":"0708.4149","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b447da551ac864e0a7fbe05e97a6312acadfadcfe0afdd2a80747606d0386f87","sha256:443d2f2aff494e740aadc1456a30927c1be8a8d2f666bdd49321b84ec864d8ba"],"state_sha256":"119a133b8abc6f398dccd841b962b2055365b0b219e488bb3a83345f760839dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GTSdfBzTb1maxKYptihzCa9eY4hpa4TNh7wmElEBaJyNLVYzOOeATf14VQljx0lFs1zpawm1kDnIqPh3hkOXDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T00:34:44.043722Z","bundle_sha256":"5027c87074a00aeacbac8db40dd0e1c82d3828e8f304a91791c92ecfef5aa4e4"}}