{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YDTI7VSMXF2ODPLRDEU5YKGX67","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":"6048af47988692ad2ccc8320683f0a094921736b349b9938ae7a46de0a4b1cc5","cross_cats_sorted":["cs.IT","math.IT","math.PR","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-02-07T18:12:32Z","title_canon_sha256":"b4a22e99779fa5897f57b1780f0fce470b33a33614afbf6765309e4db518ca74"},"schema_version":"1.0","source":{"id":"2502.05134","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.05134","created_at":"2026-07-05T10:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"2502.05134v1","created_at":"2026-07-05T10:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05134","created_at":"2026-07-05T10:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"YDTI7VSMXF2O","created_at":"2026-07-05T10:11:09Z"},{"alias_kind":"pith_short_16","alias_value":"YDTI7VSMXF2ODPLR","created_at":"2026-07-05T10:11:09Z"},{"alias_kind":"pith_short_8","alias_value":"YDTI7VSM","created_at":"2026-07-05T10:11:09Z"}],"graph_snapshots":[{"event_id":"sha256:494be65f075316be8bc9e40076eccb45a914547ed617463765f9f0d29a30f8a4","target":"graph","created_at":"2026-07-05T10:11:09Z","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/2502.05134/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Eren C. K{\\i}z{\\i}lda\\u{g}","cross_cats":["cs.IT","math.IT","math.PR","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-02-07T18:12:32Z","title":"Information-Theoretic Guarantees for Recovering Low-Rank Tensors from Symmetric Rank-One Measurements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05134","kind":"arxiv","version":1},"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:6938de40b86f09f325f524887b1780b7cc578a0b6450acd1934940f29109e0a3","target":"record","created_at":"2026-07-05T10:11:09Z","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":"6048af47988692ad2ccc8320683f0a094921736b349b9938ae7a46de0a4b1cc5","cross_cats_sorted":["cs.IT","math.IT","math.PR","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-02-07T18:12:32Z","title_canon_sha256":"b4a22e99779fa5897f57b1780f0fce470b33a33614afbf6765309e4db518ca74"},"schema_version":"1.0","source":{"id":"2502.05134","kind":"arxiv","version":1}},"canonical_sha256":"c0e68fd64cb974e1bd711929dc28d7f7fc4700102010625327c86e1d46a9952a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0e68fd64cb974e1bd711929dc28d7f7fc4700102010625327c86e1d46a9952a","first_computed_at":"2026-07-05T10:11:09.774016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:11:09.774016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"647dJIuULL7dqd2jj0tyvEZ98sXjj42udPlLtTRTpT7akrXNKNSc8i7YqhIVhkA5in3GEgkL+hZLCtP+KrMRAg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:11:09.774639Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.05134","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6938de40b86f09f325f524887b1780b7cc578a0b6450acd1934940f29109e0a3","sha256:494be65f075316be8bc9e40076eccb45a914547ed617463765f9f0d29a30f8a4"],"state_sha256":"8149e16f871d5d6e7ca8ef923f70321ace75c4442d49eaf6652f34b84386091b"}