{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:X2TZOQC3OTCCVU2M7PAZ5JJT7G","short_pith_number":"pith:X2TZOQC3","canonical_record":{"source":{"id":"1211.4116","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-17T12:23:36Z","cross_cats_sorted":["cs.NA","math.AG","math.CO","stat.ML"],"title_canon_sha256":"600f95d679213bde894f5d647d834de9a11a9a5eb6e829ec501e69a140925b5c","abstract_canon_sha256":"44716b5c5fcd6255347ebef4d48dc0d3061b9530552819908068a5f3467964b6"},"schema_version":"1.0"},"canonical_sha256":"bea797405b74c42ad34cfbc19ea533f9926f6a35b4ccf9e6df51495691b16268","source":{"kind":"arxiv","id":"1211.4116","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4116","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4116v4","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4116","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"pith_short_12","alias_value":"X2TZOQC3OTCC","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"X2TZOQC3OTCCVU2M","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"X2TZOQC3","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:X2TZOQC3OTCCVU2M7PAZ5JJT7G","target":"record","payload":{"canonical_record":{"source":{"id":"1211.4116","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-17T12:23:36Z","cross_cats_sorted":["cs.NA","math.AG","math.CO","stat.ML"],"title_canon_sha256":"600f95d679213bde894f5d647d834de9a11a9a5eb6e829ec501e69a140925b5c","abstract_canon_sha256":"44716b5c5fcd6255347ebef4d48dc0d3061b9530552819908068a5f3467964b6"},"schema_version":"1.0"},"canonical_sha256":"bea797405b74c42ad34cfbc19ea533f9926f6a35b4ccf9e6df51495691b16268","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:57.032016Z","signature_b64":"wmMxytJY++at59E3NTEbBwltr7STx204Usp8Sc2L7QxykQEvvUBDcTxpPOwPx/j6yxsMA8rO+BEatKpHelBaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bea797405b74c42ad34cfbc19ea533f9926f6a35b4ccf9e6df51495691b16268","last_reissued_at":"2026-05-18T02:44:57.031432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:57.031432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.4116","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-18T02:44:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qICfkIWA7uFVREpsyKefBOf+LjTdjDbQYdUdbjcli7EQB3vD5Zg92jTb/RE9hbzZNeLeRCmA3D/nIwmn0GwwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:47:00.851303Z"},"content_sha256":"255f0731e9355419a1c08ec33621c17ada929ec962fd0e1a26e58aca34225338","schema_version":"1.0","event_id":"sha256:255f0731e9355419a1c08ec33621c17ada929ec962fd0e1a26e58aca34225338"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:X2TZOQC3OTCCVU2M7PAZ5JJT7G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Algebraic Combinatorial Approach for Low-Rank Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.AG","math.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Franz J. Kir\\'aly, Louis Theran, Ryota Tomioka","submitted_at":"2012-11-17T12:23:36Z","abstract_excerpt":"We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the treatment of single entries in a closed theoretical and practical framework. More specifically, apart from introducing an algebraic combinatorial theory of low-rank matrix completion, we present probability-one algorithms to decide whether a particular entry of the matrix can be completed. We also describe methods to complete that entry from a few others, and t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4116","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-18T02:44:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lzi0CMPrf6UvsfoM9l+4PyOMMWR3VMddmN3qEjEeyDznteyVAC04heVRlfZqP8egMauGyV26oXunj9R1ES2WCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:47:00.851990Z"},"content_sha256":"6d7b227c38e2bec0e89bbdea1588dd9b1a41f88b5c93697a99ced998c1ff52e3","schema_version":"1.0","event_id":"sha256:6d7b227c38e2bec0e89bbdea1588dd9b1a41f88b5c93697a99ced998c1ff52e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X2TZOQC3OTCCVU2M7PAZ5JJT7G/bundle.json","state_url":"https://pith.science/pith/X2TZOQC3OTCCVU2M7PAZ5JJT7G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X2TZOQC3OTCCVU2M7PAZ5JJT7G/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-11T03:47:00Z","links":{"resolver":"https://pith.science/pith/X2TZOQC3OTCCVU2M7PAZ5JJT7G","bundle":"https://pith.science/pith/X2TZOQC3OTCCVU2M7PAZ5JJT7G/bundle.json","state":"https://pith.science/pith/X2TZOQC3OTCCVU2M7PAZ5JJT7G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X2TZOQC3OTCCVU2M7PAZ5JJT7G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:X2TZOQC3OTCCVU2M7PAZ5JJT7G","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":"44716b5c5fcd6255347ebef4d48dc0d3061b9530552819908068a5f3467964b6","cross_cats_sorted":["cs.NA","math.AG","math.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-17T12:23:36Z","title_canon_sha256":"600f95d679213bde894f5d647d834de9a11a9a5eb6e829ec501e69a140925b5c"},"schema_version":"1.0","source":{"id":"1211.4116","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4116","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4116v4","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4116","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"pith_short_12","alias_value":"X2TZOQC3OTCC","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"X2TZOQC3OTCCVU2M","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"X2TZOQC3","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:6d7b227c38e2bec0e89bbdea1588dd9b1a41f88b5c93697a99ced998c1ff52e3","target":"graph","created_at":"2026-05-18T02:44:57Z","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 present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the treatment of single entries in a closed theoretical and practical framework. More specifically, apart from introducing an algebraic combinatorial theory of low-rank matrix completion, we present probability-one algorithms to decide whether a particular entry of the matrix can be completed. We also describe methods to complete that entry from a few others, and t","authors_text":"Franz J. Kir\\'aly, Louis Theran, Ryota Tomioka","cross_cats":["cs.NA","math.AG","math.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-17T12:23:36Z","title":"The Algebraic Combinatorial Approach for Low-Rank Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4116","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:255f0731e9355419a1c08ec33621c17ada929ec962fd0e1a26e58aca34225338","target":"record","created_at":"2026-05-18T02:44:57Z","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":"44716b5c5fcd6255347ebef4d48dc0d3061b9530552819908068a5f3467964b6","cross_cats_sorted":["cs.NA","math.AG","math.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-17T12:23:36Z","title_canon_sha256":"600f95d679213bde894f5d647d834de9a11a9a5eb6e829ec501e69a140925b5c"},"schema_version":"1.0","source":{"id":"1211.4116","kind":"arxiv","version":4}},"canonical_sha256":"bea797405b74c42ad34cfbc19ea533f9926f6a35b4ccf9e6df51495691b16268","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bea797405b74c42ad34cfbc19ea533f9926f6a35b4ccf9e6df51495691b16268","first_computed_at":"2026-05-18T02:44:57.031432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:57.031432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wmMxytJY++at59E3NTEbBwltr7STx204Usp8Sc2L7QxykQEvvUBDcTxpPOwPx/j6yxsMA8rO+BEatKpHelBaAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:57.032016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.4116","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:255f0731e9355419a1c08ec33621c17ada929ec962fd0e1a26e58aca34225338","sha256:6d7b227c38e2bec0e89bbdea1588dd9b1a41f88b5c93697a99ced998c1ff52e3"],"state_sha256":"43c91448b643070ec6c25ace7cad6abb666ad6189c225d118f02f47df0826366"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"defBxpNu/73IOiMsFskvWr9AVugsmYT0DVgsyndtAsOCu3KaudU4vdN+kfgRvpUpUugch134FSNFLZ1gDfWfAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T03:47:00.855886Z","bundle_sha256":"b7b8585a229e75c9444dd627c67a68443056ac5cb3d88d1bf882ec56e098515b"}}