{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YDTI7VSMXF2ODPLRDEU5YKGX67","short_pith_number":"pith:YDTI7VSM","schema_version":"1.0","canonical_sha256":"c0e68fd64cb974e1bd711929dc28d7f7fc4700102010625327c86e1d46a9952a","source":{"kind":"arxiv","id":"2502.05134","version":1},"attestation_state":"computed","paper":{"title":"Information-Theoretic Guarantees for Recovering Low-Rank Tensors from Symmetric Rank-One Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Eren C. K{\\i}z{\\i}lda\\u{g}","submitted_at":"2025-02-07T18:12:32Z","abstract_excerpt":"In this paper, we investigate the sample complexity of recovering tensors with low symmetric rank from symmetric rank-one measurements. This setting is particularly motivated by the study of higher-order interactions and the analysis of two-layer neural networks with polynomial activations (polynomial networks). Using a covering numbers argument, we analyze the performance of the symmetric rank minimization program and establish near-optimal sample complexity bounds when the underlying distribution is log-concave. Our measurement model involves random symmetric rank-one tensors, which lead to "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2502.05134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-02-07T18:12:32Z","cross_cats_sorted":["cs.IT","math.IT","math.PR","stat.ML","stat.TH"],"title_canon_sha256":"b4a22e99779fa5897f57b1780f0fce470b33a33614afbf6765309e4db518ca74","abstract_canon_sha256":"6048af47988692ad2ccc8320683f0a094921736b349b9938ae7a46de0a4b1cc5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:09.774639Z","signature_b64":"647dJIuULL7dqd2jj0tyvEZ98sXjj42udPlLtTRTpT7akrXNKNSc8i7YqhIVhkA5in3GEgkL+hZLCtP+KrMRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0e68fd64cb974e1bd711929dc28d7f7fc4700102010625327c86e1d46a9952a","last_reissued_at":"2026-07-05T10:11:09.774016Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:09.774016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information-Theoretic Guarantees for Recovering Low-Rank Tensors from Symmetric Rank-One Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Eren C. K{\\i}z{\\i}lda\\u{g}","submitted_at":"2025-02-07T18:12:32Z","abstract_excerpt":"In this paper, we investigate the sample complexity of recovering tensors with low symmetric rank from symmetric rank-one measurements. This setting is particularly motivated by the study of higher-order interactions and the analysis of two-layer neural networks with polynomial activations (polynomial networks). Using a covering numbers argument, we analyze the performance of the symmetric rank minimization program and establish near-optimal sample complexity bounds when the underlying distribution is log-concave. Our measurement model involves random symmetric rank-one tensors, which lead to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05134","kind":"arxiv","version":1},"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/2502.05134/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.05134","created_at":"2026-07-05T10:11:09.774083+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.05134v1","created_at":"2026-07-05T10:11:09.774083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05134","created_at":"2026-07-05T10:11:09.774083+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDTI7VSMXF2O","created_at":"2026-07-05T10:11:09.774083+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDTI7VSMXF2ODPLR","created_at":"2026-07-05T10:11:09.774083+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDTI7VSM","created_at":"2026-07-05T10:11:09.774083+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YDTI7VSMXF2ODPLRDEU5YKGX67","json":"https://pith.science/pith/YDTI7VSMXF2ODPLRDEU5YKGX67.json","graph_json":"https://pith.science/api/pith-number/YDTI7VSMXF2ODPLRDEU5YKGX67/graph.json","events_json":"https://pith.science/api/pith-number/YDTI7VSMXF2ODPLRDEU5YKGX67/events.json","paper":"https://pith.science/paper/YDTI7VSM"},"agent_actions":{"view_html":"https://pith.science/pith/YDTI7VSMXF2ODPLRDEU5YKGX67","download_json":"https://pith.science/pith/YDTI7VSMXF2ODPLRDEU5YKGX67.json","view_paper":"https://pith.science/paper/YDTI7VSM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.05134&json=true","fetch_graph":"https://pith.science/api/pith-number/YDTI7VSMXF2ODPLRDEU5YKGX67/graph.json","fetch_events":"https://pith.science/api/pith-number/YDTI7VSMXF2ODPLRDEU5YKGX67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDTI7VSMXF2ODPLRDEU5YKGX67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDTI7VSMXF2ODPLRDEU5YKGX67/action/storage_attestation","attest_author":"https://pith.science/pith/YDTI7VSMXF2ODPLRDEU5YKGX67/action/author_attestation","sign_citation":"https://pith.science/pith/YDTI7VSMXF2ODPLRDEU5YKGX67/action/citation_signature","submit_replication":"https://pith.science/pith/YDTI7VSMXF2ODPLRDEU5YKGX67/action/replication_record"}},"created_at":"2026-07-05T10:11:09.774083+00:00","updated_at":"2026-07-05T10:11:09.774083+00:00"}