{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NXK274ZP67BOUSZA5T7IS3TLKC","short_pith_number":"pith:NXK274ZP","schema_version":"1.0","canonical_sha256":"6dd5aff32ff7c2ea4b20ecfe896e6b50b903e515becb2dda3b4fbc26665f6e4e","source":{"kind":"arxiv","id":"2506.19276","version":1},"attestation_state":"computed","paper":{"title":"Rare dense solutions clusters in asymmetric binary perceptrons -- local entropy via fully lifted RDT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Mihailo Stojnic","submitted_at":"2025-06-24T03:12:39Z","abstract_excerpt":"We study classical asymmetric binary perceptron (ABP) and associated \\emph{local entropy} (LE) as potential source of its algorithmic hardness. Isolation of \\emph{typical} ABP solutions in SAT phase seemingly suggests a universal algorithmic hardness. Paradoxically, efficient algorithms do exist even for constraint densities $\\alpha$ fairly close but at a finite distance (\\emph{computational gap}) from the capacity. In recent years, existence of rare large dense clusters and magical ability of fast algorithms to find them have been posited as the conceptual resolution of this paradox. Monotoni"},"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.19276","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-06-24T03:12:39Z","cross_cats_sorted":["cond-mat.dis-nn","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"8fdd6d0f9be7508b00f4192c81ece18e2dfb00974a2e3732e4a1038dfa1ef303","abstract_canon_sha256":"d25439d2d4eb0190bbee52daadd241d1c6aa8fa30cd0d9f3bea5efe4a185455a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:26:12.536741Z","signature_b64":"vemDY1pFUAbbrdAljliSQHRYITKjm81gdqZcwYqklAjJV5jD0Hltw2TO25mhvBXC4e5+XoaR/G7r435Kp3uDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dd5aff32ff7c2ea4b20ecfe896e6b50b903e515becb2dda3b4fbc26665f6e4e","last_reissued_at":"2026-07-05T11:26:12.536322Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:26:12.536322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rare dense solutions clusters in asymmetric binary perceptrons -- local entropy via fully lifted RDT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Mihailo Stojnic","submitted_at":"2025-06-24T03:12:39Z","abstract_excerpt":"We study classical asymmetric binary perceptron (ABP) and associated \\emph{local entropy} (LE) as potential source of its algorithmic hardness. Isolation of \\emph{typical} ABP solutions in SAT phase seemingly suggests a universal algorithmic hardness. Paradoxically, efficient algorithms do exist even for constraint densities $\\alpha$ fairly close but at a finite distance (\\emph{computational gap}) from the capacity. In recent years, existence of rare large dense clusters and magical ability of fast algorithms to find them have been posited as the conceptual resolution of this paradox. Monotoni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.19276","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.19276/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.19276","created_at":"2026-07-05T11:26:12.536379+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.19276v1","created_at":"2026-07-05T11:26:12.536379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.19276","created_at":"2026-07-05T11:26:12.536379+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXK274ZP67BO","created_at":"2026-07-05T11:26:12.536379+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXK274ZP67BOUSZA","created_at":"2026-07-05T11:26:12.536379+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXK274ZP","created_at":"2026-07-05T11:26:12.536379+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.19712","citing_title":"Ultrametric OGP - parametric RDT \\emph{symmetric} binary perceptron connection","ref_index":99,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NXK274ZP67BOUSZA5T7IS3TLKC","json":"https://pith.science/pith/NXK274ZP67BOUSZA5T7IS3TLKC.json","graph_json":"https://pith.science/api/pith-number/NXK274ZP67BOUSZA5T7IS3TLKC/graph.json","events_json":"https://pith.science/api/pith-number/NXK274ZP67BOUSZA5T7IS3TLKC/events.json","paper":"https://pith.science/paper/NXK274ZP"},"agent_actions":{"view_html":"https://pith.science/pith/NXK274ZP67BOUSZA5T7IS3TLKC","download_json":"https://pith.science/pith/NXK274ZP67BOUSZA5T7IS3TLKC.json","view_paper":"https://pith.science/paper/NXK274ZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.19276&json=true","fetch_graph":"https://pith.science/api/pith-number/NXK274ZP67BOUSZA5T7IS3TLKC/graph.json","fetch_events":"https://pith.science/api/pith-number/NXK274ZP67BOUSZA5T7IS3TLKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXK274ZP67BOUSZA5T7IS3TLKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXK274ZP67BOUSZA5T7IS3TLKC/action/storage_attestation","attest_author":"https://pith.science/pith/NXK274ZP67BOUSZA5T7IS3TLKC/action/author_attestation","sign_citation":"https://pith.science/pith/NXK274ZP67BOUSZA5T7IS3TLKC/action/citation_signature","submit_replication":"https://pith.science/pith/NXK274ZP67BOUSZA5T7IS3TLKC/action/replication_record"}},"created_at":"2026-07-05T11:26:12.536379+00:00","updated_at":"2026-07-05T11:26:12.536379+00:00"}