{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EABKKO6GMO7MZFRP7X4P7I5VDK","short_pith_number":"pith:EABKKO6G","schema_version":"1.0","canonical_sha256":"2002a53bc663becc962ffdf8ffa3b51a9c086a9d2414c75659bd85d3b5c74e98","source":{"kind":"arxiv","id":"2506.09959","version":1},"attestation_state":"computed","paper":{"title":"Almost-Optimal Local-Search Methods for Sparse Tensor PCA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Conor Sheehan, Ilias Zadik, Konstantinos Tsirkas, Max Lovig","submitted_at":"2025-06-11T17:33:25Z","abstract_excerpt":"Local-search methods are widely employed in statistical applications, yet interestingly, their theoretical foundations remain rather underexplored, compared to other classes of estimators such as low-degree polynomials and spectral methods. Of note, among the few existing results recent studies have revealed a significant \"local-computational\" gap in the context of a well-studied sparse tensor principal component analysis (PCA), where a broad class of local Markov chain methods exhibits a notable underperformance relative to other polynomial-time algorithms. In this work, we propose a series o"},"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":"2506.09959","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-06-11T17:33:25Z","cross_cats_sorted":["cs.DS","stat.ML","stat.TH"],"title_canon_sha256":"365f75c9bd066cd52aea324a70a8b84407912d74a0f2ca37191e1ab05aa36e49","abstract_canon_sha256":"8ca3e1acde65fd4f42ac351edee69db7def23b3c94ea8561babb3c1ede1f32d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:59.777446Z","signature_b64":"BQh8+kmaCCPvUE4A2q6ZemHai7NLKbCJZf/KiPE/9KU7gYs24E7OCRdV82rLznu7D4bl3kqpEI/jtdvB8mJqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2002a53bc663becc962ffdf8ffa3b51a9c086a9d2414c75659bd85d3b5c74e98","last_reissued_at":"2026-07-05T11:19:59.776967Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:59.776967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost-Optimal Local-Search Methods for Sparse Tensor PCA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Conor Sheehan, Ilias Zadik, Konstantinos Tsirkas, Max Lovig","submitted_at":"2025-06-11T17:33:25Z","abstract_excerpt":"Local-search methods are widely employed in statistical applications, yet interestingly, their theoretical foundations remain rather underexplored, compared to other classes of estimators such as low-degree polynomials and spectral methods. Of note, among the few existing results recent studies have revealed a significant \"local-computational\" gap in the context of a well-studied sparse tensor principal component analysis (PCA), where a broad class of local Markov chain methods exhibits a notable underperformance relative to other polynomial-time algorithms. In this work, we propose a series o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.09959","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/2506.09959/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":"2506.09959","created_at":"2026-07-05T11:19:59.777018+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.09959v1","created_at":"2026-07-05T11:19:59.777018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.09959","created_at":"2026-07-05T11:19:59.777018+00:00"},{"alias_kind":"pith_short_12","alias_value":"EABKKO6GMO7M","created_at":"2026-07-05T11:19:59.777018+00:00"},{"alias_kind":"pith_short_16","alias_value":"EABKKO6GMO7MZFRP","created_at":"2026-07-05T11:19:59.777018+00:00"},{"alias_kind":"pith_short_8","alias_value":"EABKKO6G","created_at":"2026-07-05T11:19:59.777018+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30113","citing_title":"Low-degree estimation thresholds in planted hypergraphs and tensor PCA","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EABKKO6GMO7MZFRP7X4P7I5VDK","json":"https://pith.science/pith/EABKKO6GMO7MZFRP7X4P7I5VDK.json","graph_json":"https://pith.science/api/pith-number/EABKKO6GMO7MZFRP7X4P7I5VDK/graph.json","events_json":"https://pith.science/api/pith-number/EABKKO6GMO7MZFRP7X4P7I5VDK/events.json","paper":"https://pith.science/paper/EABKKO6G"},"agent_actions":{"view_html":"https://pith.science/pith/EABKKO6GMO7MZFRP7X4P7I5VDK","download_json":"https://pith.science/pith/EABKKO6GMO7MZFRP7X4P7I5VDK.json","view_paper":"https://pith.science/paper/EABKKO6G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.09959&json=true","fetch_graph":"https://pith.science/api/pith-number/EABKKO6GMO7MZFRP7X4P7I5VDK/graph.json","fetch_events":"https://pith.science/api/pith-number/EABKKO6GMO7MZFRP7X4P7I5VDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EABKKO6GMO7MZFRP7X4P7I5VDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EABKKO6GMO7MZFRP7X4P7I5VDK/action/storage_attestation","attest_author":"https://pith.science/pith/EABKKO6GMO7MZFRP7X4P7I5VDK/action/author_attestation","sign_citation":"https://pith.science/pith/EABKKO6GMO7MZFRP7X4P7I5VDK/action/citation_signature","submit_replication":"https://pith.science/pith/EABKKO6GMO7MZFRP7X4P7I5VDK/action/replication_record"}},"created_at":"2026-07-05T11:19:59.777018+00:00","updated_at":"2026-07-05T11:19:59.777018+00:00"}