{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JTJDWD3CI4E2UICHADLELZDQQZ","short_pith_number":"pith:JTJDWD3C","canonical_record":{"source":{"id":"1202.2759","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-13T15:18:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"18262ea4b05d700b60ec96384d49137a4fc81100da56a3d52d120bd1c79212a8","abstract_canon_sha256":"8593b08b3973774faca782bb56872a0038c20dde8be19fa1b692288501f621e3"},"schema_version":"1.0"},"canonical_sha256":"4cd23b0f624709aa204700d645e470867a2e2b4f9203ddd83d23b1080c6d320f","source":{"kind":"arxiv","id":"1202.2759","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2759","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2759v4","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2759","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"JTJDWD3CI4E2","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JTJDWD3CI4E2UICH","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JTJDWD3C","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JTJDWD3CI4E2UICHADLELZDQQZ","target":"record","payload":{"canonical_record":{"source":{"id":"1202.2759","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-13T15:18:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"18262ea4b05d700b60ec96384d49137a4fc81100da56a3d52d120bd1c79212a8","abstract_canon_sha256":"8593b08b3973774faca782bb56872a0038c20dde8be19fa1b692288501f621e3"},"schema_version":"1.0"},"canonical_sha256":"4cd23b0f624709aa204700d645e470867a2e2b4f9203ddd83d23b1080c6d320f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:07.146839Z","signature_b64":"5GmhvtD+ejNdAHvwRegzBi0Rwe2bO1ToqmAE3FDiTg6ozjRT802O5zyvL0NAbkct/HE0BRWwG3ypfnoqGq2ODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cd23b0f624709aa204700d645e470867a2e2b4f9203ddd83d23b1080c6d320f","last_reissued_at":"2026-05-18T01:33:07.146417Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:07.146417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.2759","source_version":4,"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":"5VW67W84iKSwf5XR+ORLF14reBBHfbT4FBlD0jGkfyibq++UHCDUdllGwPUzge6Bat2cfpFxbLvoRIVOhuioBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T00:11:53.923025Z"},"content_sha256":"627de69eecda9c95d2f27c2b62d2d9554dbdc2a9cdfb9d220648404f838ecb8d","schema_version":"1.0","event_id":"sha256:627de69eecda9c95d2f27c2b62d2d9554dbdc2a9cdfb9d220648404f838ecb8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JTJDWD3CI4E2UICHADLELZDQQZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Reconstruction of Rank-One Matrices in Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alyson K. Fletcher, Sundeep Rangan","submitted_at":"2012-02-13T15:18:02Z","abstract_excerpt":"We consider the problem of estimating a rank-one matrix in Gaussian noise under a probabilistic model for the left and right factors of the matrix. The probabilistic model can impose constraints on the factors including sparsity and positivity that arise commonly in learning problems. We propose a family of algorithms that reduce the problem to a sequence of scalar estimation computations. These algorithms are similar to approximate message passing techniques based on Gaussian approximations of loopy belief propagation that have been used recently in compressed sensing. Leveraging analysis met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2759","kind":"arxiv","version":4},"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":"J+1gi7tV5eUNMKR0YDHIwU9rWmdMM7c1vhnlFyeYIvvx3mnOHjtMzP5FUXqH6G4K17H/RgK8TRgqLil9vdwgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T00:11:53.923381Z"},"content_sha256":"adf10dfbc89cc18d5b164d91f55d4ebe1c32bd5a777552ce4139818452da82b2","schema_version":"1.0","event_id":"sha256:adf10dfbc89cc18d5b164d91f55d4ebe1c32bd5a777552ce4139818452da82b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JTJDWD3CI4E2UICHADLELZDQQZ/bundle.json","state_url":"https://pith.science/pith/JTJDWD3CI4E2UICHADLELZDQQZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JTJDWD3CI4E2UICHADLELZDQQZ/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-20T00:11:53Z","links":{"resolver":"https://pith.science/pith/JTJDWD3CI4E2UICHADLELZDQQZ","bundle":"https://pith.science/pith/JTJDWD3CI4E2UICHADLELZDQQZ/bundle.json","state":"https://pith.science/pith/JTJDWD3CI4E2UICHADLELZDQQZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JTJDWD3CI4E2UICHADLELZDQQZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JTJDWD3CI4E2UICHADLELZDQQZ","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":"8593b08b3973774faca782bb56872a0038c20dde8be19fa1b692288501f621e3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-13T15:18:02Z","title_canon_sha256":"18262ea4b05d700b60ec96384d49137a4fc81100da56a3d52d120bd1c79212a8"},"schema_version":"1.0","source":{"id":"1202.2759","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2759","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2759v4","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2759","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"JTJDWD3CI4E2","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JTJDWD3CI4E2UICH","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JTJDWD3C","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:adf10dfbc89cc18d5b164d91f55d4ebe1c32bd5a777552ce4139818452da82b2","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":"We consider the problem of estimating a rank-one matrix in Gaussian noise under a probabilistic model for the left and right factors of the matrix. The probabilistic model can impose constraints on the factors including sparsity and positivity that arise commonly in learning problems. We propose a family of algorithms that reduce the problem to a sequence of scalar estimation computations. These algorithms are similar to approximate message passing techniques based on Gaussian approximations of loopy belief propagation that have been used recently in compressed sensing. Leveraging analysis met","authors_text":"Alyson K. Fletcher, Sundeep Rangan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-13T15:18:02Z","title":"Iterative Reconstruction of Rank-One Matrices in Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2759","kind":"arxiv","version":4},"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:627de69eecda9c95d2f27c2b62d2d9554dbdc2a9cdfb9d220648404f838ecb8d","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":"8593b08b3973774faca782bb56872a0038c20dde8be19fa1b692288501f621e3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-13T15:18:02Z","title_canon_sha256":"18262ea4b05d700b60ec96384d49137a4fc81100da56a3d52d120bd1c79212a8"},"schema_version":"1.0","source":{"id":"1202.2759","kind":"arxiv","version":4}},"canonical_sha256":"4cd23b0f624709aa204700d645e470867a2e2b4f9203ddd83d23b1080c6d320f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cd23b0f624709aa204700d645e470867a2e2b4f9203ddd83d23b1080c6d320f","first_computed_at":"2026-05-18T01:33:07.146417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:07.146417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5GmhvtD+ejNdAHvwRegzBi0Rwe2bO1ToqmAE3FDiTg6ozjRT802O5zyvL0NAbkct/HE0BRWwG3ypfnoqGq2ODA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:07.146839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.2759","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:627de69eecda9c95d2f27c2b62d2d9554dbdc2a9cdfb9d220648404f838ecb8d","sha256:adf10dfbc89cc18d5b164d91f55d4ebe1c32bd5a777552ce4139818452da82b2"],"state_sha256":"6ccc1c01b430b563d17bd14cf54c4d3aa4b937640d5ee22bd453cff48be4699e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p51HQlvusM4MpLFaArxX3bbRtHOUD72iQ4aMPwtcUCkglp9Q2VjD4MCgFTsumJmIa1GqLjnBLH2H5/XIg8xqCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T00:11:53.925304Z","bundle_sha256":"59daed7b6e752925761df9f786bd2ba3fe27b64ed1dca2633295f3792fb4c02c"}}