{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:O2RQAOKYIFMAJFA5UJFBGMCRDU","short_pith_number":"pith:O2RQAOKY","canonical_record":{"source":{"id":"2504.00398","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-01T03:43:34Z","cross_cats_sorted":[],"title_canon_sha256":"1f5825f893165b0427d0c7e009f3c3579d9ab1b9be8bce44fbdefb47690e4289","abstract_canon_sha256":"ba4b116dbbdc4c1f5cd3183c37334d9fe63436afc10e5ed6d33a92d8c55388ef"},"schema_version":"1.0"},"canonical_sha256":"76a3003958415804941da24a1330511d125986c6a91b059c976a6d88d6cc5d01","source":{"kind":"arxiv","id":"2504.00398","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.00398","created_at":"2026-06-09T02:07:02Z"},{"alias_kind":"arxiv_version","alias_value":"2504.00398v2","created_at":"2026-06-09T02:07:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.00398","created_at":"2026-06-09T02:07:02Z"},{"alias_kind":"pith_short_12","alias_value":"O2RQAOKYIFMA","created_at":"2026-06-09T02:07:02Z"},{"alias_kind":"pith_short_16","alias_value":"O2RQAOKYIFMAJFA5","created_at":"2026-06-09T02:07:02Z"},{"alias_kind":"pith_short_8","alias_value":"O2RQAOKY","created_at":"2026-06-09T02:07:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:O2RQAOKYIFMAJFA5UJFBGMCRDU","target":"record","payload":{"canonical_record":{"source":{"id":"2504.00398","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-01T03:43:34Z","cross_cats_sorted":[],"title_canon_sha256":"1f5825f893165b0427d0c7e009f3c3579d9ab1b9be8bce44fbdefb47690e4289","abstract_canon_sha256":"ba4b116dbbdc4c1f5cd3183c37334d9fe63436afc10e5ed6d33a92d8c55388ef"},"schema_version":"1.0"},"canonical_sha256":"76a3003958415804941da24a1330511d125986c6a91b059c976a6d88d6cc5d01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:07:02.939638Z","signature_b64":"UAuW/HR61ht7n2Ls/L6nly9Fh047ah+BPJru+PI2VTCz0g0jIsJwSo7ya89x+xoTzliPZ1RLiJaZBwBUvchSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76a3003958415804941da24a1330511d125986c6a91b059c976a6d88d6cc5d01","last_reissued_at":"2026-06-09T02:07:02.938465Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:07:02.938465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.00398","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-09T02:07:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ANjCjwNjxTklubxMhmJI8IUYoNo8AothO6nTz65uXWx2DoPdNi7G/Hu50cB0h0XoDoPuor3GBFRDr10FX00AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:09:33.023448Z"},"content_sha256":"67b73ad59b39422cbe894f95b02d62caa348fe3c6ce5495d3e3143257279466a","schema_version":"1.0","event_id":"sha256:67b73ad59b39422cbe894f95b02d62caa348fe3c6ce5495d3e3143257279466a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:O2RQAOKYIFMAJFA5UJFBGMCRDU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Completion for Rank-1 Tensors with Noises","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiawang Nie, Jinling Zhou, Xindong Tang","submitted_at":"2025-04-01T03:43:34Z","abstract_excerpt":"This paper studies the rank-1 tensor completion problem for cubic tensors when there are noises for observed tensor entries. First, we propose a robust biquadratic optimization model for obtaining rank-1 completing tensors. When the observed tensor is sufficiently close to be rank-1, we show that this biquadratic optimization produces an accurate rank-$1$ tensor completion. Second, we give an efficient convex relaxation for solving the biquadratic optimization. When the optimizer matrix is separable, we show how to get optimizers for the biquadratic optimization and how to compute the rank-$1$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.00398","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/2504.00398/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-09T02:07:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5kEQ1/cNkRsgPE8VILPmsejUbr8B2R3ecb4xKx4Ld3r6RzVk1aq7YXDYn+ZFJwfU1yz58yQmbfO5yEfnRfkIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:09:33.024221Z"},"content_sha256":"9dc5721fb27bd2e108fe4b2151817a9065637c671500954fdba0c0934f454844","schema_version":"1.0","event_id":"sha256:9dc5721fb27bd2e108fe4b2151817a9065637c671500954fdba0c0934f454844"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2RQAOKYIFMAJFA5UJFBGMCRDU/bundle.json","state_url":"https://pith.science/pith/O2RQAOKYIFMAJFA5UJFBGMCRDU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2RQAOKYIFMAJFA5UJFBGMCRDU/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-10T10:09:33Z","links":{"resolver":"https://pith.science/pith/O2RQAOKYIFMAJFA5UJFBGMCRDU","bundle":"https://pith.science/pith/O2RQAOKYIFMAJFA5UJFBGMCRDU/bundle.json","state":"https://pith.science/pith/O2RQAOKYIFMAJFA5UJFBGMCRDU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2RQAOKYIFMAJFA5UJFBGMCRDU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:O2RQAOKYIFMAJFA5UJFBGMCRDU","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":"ba4b116dbbdc4c1f5cd3183c37334d9fe63436afc10e5ed6d33a92d8c55388ef","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-01T03:43:34Z","title_canon_sha256":"1f5825f893165b0427d0c7e009f3c3579d9ab1b9be8bce44fbdefb47690e4289"},"schema_version":"1.0","source":{"id":"2504.00398","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.00398","created_at":"2026-06-09T02:07:02Z"},{"alias_kind":"arxiv_version","alias_value":"2504.00398v2","created_at":"2026-06-09T02:07:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.00398","created_at":"2026-06-09T02:07:02Z"},{"alias_kind":"pith_short_12","alias_value":"O2RQAOKYIFMA","created_at":"2026-06-09T02:07:02Z"},{"alias_kind":"pith_short_16","alias_value":"O2RQAOKYIFMAJFA5","created_at":"2026-06-09T02:07:02Z"},{"alias_kind":"pith_short_8","alias_value":"O2RQAOKY","created_at":"2026-06-09T02:07:02Z"}],"graph_snapshots":[{"event_id":"sha256:9dc5721fb27bd2e108fe4b2151817a9065637c671500954fdba0c0934f454844","target":"graph","created_at":"2026-06-09T02:07: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/2504.00398/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies the rank-1 tensor completion problem for cubic tensors when there are noises for observed tensor entries. First, we propose a robust biquadratic optimization model for obtaining rank-1 completing tensors. When the observed tensor is sufficiently close to be rank-1, we show that this biquadratic optimization produces an accurate rank-$1$ tensor completion. Second, we give an efficient convex relaxation for solving the biquadratic optimization. When the optimizer matrix is separable, we show how to get optimizers for the biquadratic optimization and how to compute the rank-$1$","authors_text":"Jiawang Nie, Jinling Zhou, Xindong Tang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-01T03:43:34Z","title":"Robust Completion for Rank-1 Tensors with Noises"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.00398","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:67b73ad59b39422cbe894f95b02d62caa348fe3c6ce5495d3e3143257279466a","target":"record","created_at":"2026-06-09T02:07: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":"ba4b116dbbdc4c1f5cd3183c37334d9fe63436afc10e5ed6d33a92d8c55388ef","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-01T03:43:34Z","title_canon_sha256":"1f5825f893165b0427d0c7e009f3c3579d9ab1b9be8bce44fbdefb47690e4289"},"schema_version":"1.0","source":{"id":"2504.00398","kind":"arxiv","version":2}},"canonical_sha256":"76a3003958415804941da24a1330511d125986c6a91b059c976a6d88d6cc5d01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76a3003958415804941da24a1330511d125986c6a91b059c976a6d88d6cc5d01","first_computed_at":"2026-06-09T02:07:02.938465Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T02:07:02.938465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UAuW/HR61ht7n2Ls/L6nly9Fh047ah+BPJru+PI2VTCz0g0jIsJwSo7ya89x+xoTzliPZ1RLiJaZBwBUvchSAw==","signature_status":"signed_v1","signed_at":"2026-06-09T02:07:02.939638Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.00398","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67b73ad59b39422cbe894f95b02d62caa348fe3c6ce5495d3e3143257279466a","sha256:9dc5721fb27bd2e108fe4b2151817a9065637c671500954fdba0c0934f454844"],"state_sha256":"10011576a063fa51b3784c713611216613e70a795ca240214062c5aa7ccfb202"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UfelaDyRBicZj5tGz7OtnPh5O4PsA8x4mod2O76h9cu4uWetV3Q81gTlkjC69U/IdwojCIJDvbYbBhD+wtIaDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T10:09:33.028727Z","bundle_sha256":"3b6e48ce44571e48e7fac72b8177dcc5679935f2c6be17e2b979491d0635a314"}}