{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:B7CUS2JA7I56MZUSZUXJK6K2BX","short_pith_number":"pith:B7CUS2JA","schema_version":"1.0","canonical_sha256":"0fc5496920fa3be66692cd2e95795a0dd0c111318045d58c2b18e97c7aec88b6","source":{"kind":"arxiv","id":"2606.17604","version":1},"attestation_state":"computed","paper":{"title":"Spectral recovery of a planted triangle-dense subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Benjamin McKenna, Cheng Mao, Sam van der Poel","submitted_at":"2026-06-16T07:10:57Z","abstract_excerpt":"Given a simple graph on $n$ vertices and a parameter $k$, the triangle-densest-$k$-subgraph problem is known to be computationally hard in the worst case. To circumvent the computational hardness, we study an average-case model where a triangle-dense subgraph on $k$ vertices is planted in an Erd\\H{o}s-R\\'enyi random graph on $n$ vertices. For the recovery of the planted subgraph, we propose a simple spectral algorithm and a semidefinite program, both of which use a graph matrix whose entries are local signed triangle counts. Theoretical guarantees for these algorithms are established through s"},"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":"2606.17604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-16T07:10:57Z","cross_cats_sorted":["math.PR","math.ST","stat.TH"],"title_canon_sha256":"acb400eeb8c1540360983cc748637dfd2f130b2863af36c6b752e6180f0075ef","abstract_canon_sha256":"63fae5e461efb177eb2018f37d42701cb5a16c0d64e5fc6a3e3376088ef9191c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:17.098523Z","signature_b64":"ZdHBfs5qygT2v/cIpdofCnlLEHbTmv4AsvDLd5zZ6AXfSg4WCdyJzYA+WsnocPgljFhFmmyJKLo2sMWaQywSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fc5496920fa3be66692cd2e95795a0dd0c111318045d58c2b18e97c7aec88b6","last_reissued_at":"2026-06-19T16:10:17.098187Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:17.098187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral recovery of a planted triangle-dense subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Benjamin McKenna, Cheng Mao, Sam van der Poel","submitted_at":"2026-06-16T07:10:57Z","abstract_excerpt":"Given a simple graph on $n$ vertices and a parameter $k$, the triangle-densest-$k$-subgraph problem is known to be computationally hard in the worst case. To circumvent the computational hardness, we study an average-case model where a triangle-dense subgraph on $k$ vertices is planted in an Erd\\H{o}s-R\\'enyi random graph on $n$ vertices. For the recovery of the planted subgraph, we propose a simple spectral algorithm and a semidefinite program, both of which use a graph matrix whose entries are local signed triangle counts. Theoretical guarantees for these algorithms are established through s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.17604","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/2606.17604/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":"2606.17604","created_at":"2026-06-19T16:10:17.098245+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.17604v1","created_at":"2026-06-19T16:10:17.098245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17604","created_at":"2026-06-19T16:10:17.098245+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7CUS2JA7I56","created_at":"2026-06-19T16:10:17.098245+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7CUS2JA7I56MZUS","created_at":"2026-06-19T16:10:17.098245+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7CUS2JA","created_at":"2026-06-19T16:10:17.098245+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/B7CUS2JA7I56MZUSZUXJK6K2BX","json":"https://pith.science/pith/B7CUS2JA7I56MZUSZUXJK6K2BX.json","graph_json":"https://pith.science/api/pith-number/B7CUS2JA7I56MZUSZUXJK6K2BX/graph.json","events_json":"https://pith.science/api/pith-number/B7CUS2JA7I56MZUSZUXJK6K2BX/events.json","paper":"https://pith.science/paper/B7CUS2JA"},"agent_actions":{"view_html":"https://pith.science/pith/B7CUS2JA7I56MZUSZUXJK6K2BX","download_json":"https://pith.science/pith/B7CUS2JA7I56MZUSZUXJK6K2BX.json","view_paper":"https://pith.science/paper/B7CUS2JA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.17604&json=true","fetch_graph":"https://pith.science/api/pith-number/B7CUS2JA7I56MZUSZUXJK6K2BX/graph.json","fetch_events":"https://pith.science/api/pith-number/B7CUS2JA7I56MZUSZUXJK6K2BX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7CUS2JA7I56MZUSZUXJK6K2BX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7CUS2JA7I56MZUSZUXJK6K2BX/action/storage_attestation","attest_author":"https://pith.science/pith/B7CUS2JA7I56MZUSZUXJK6K2BX/action/author_attestation","sign_citation":"https://pith.science/pith/B7CUS2JA7I56MZUSZUXJK6K2BX/action/citation_signature","submit_replication":"https://pith.science/pith/B7CUS2JA7I56MZUSZUXJK6K2BX/action/replication_record"}},"created_at":"2026-06-19T16:10:17.098245+00:00","updated_at":"2026-06-19T16:10:17.098245+00:00"}