{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HLUX6TSAI7NRE4LTGTG3UUVRNI","short_pith_number":"pith:HLUX6TSA","schema_version":"1.0","canonical_sha256":"3ae97f4e4047db12717334cdba52b16a026ddc33a931a3806070eb6a59cee2b7","source":{"kind":"arxiv","id":"2504.09388","version":2},"attestation_state":"computed","paper":{"title":"The Rate-Immediacy Barrier in Explicit Tree Code Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Gil Cohen, Leonard J. Schulman, Piyush Srivastava","submitted_at":"2025-04-13T00:47:48Z","abstract_excerpt":"Since the introduction of tree codes by Schulman (STOC 1993), explicit construction of asymptotically good tree codes has remained a notorious challenge. A work by Cohen, Haeupler and Schulman (STOC 2018), as well as the state-of-the-art construction by Ben Yaacov, Cohen, and Yankovitz (STOC 2022) have achieved codes with rate $\\Omega(1/\\log\\log n)$, exponentially improving upon the original rate $\\Omega(1/\\log n)$ construction of Evans, Klugerman and Schulman from 1994. All of these constructions rely, at least in part, on increasingly sophisticated methods of combining (block) error-correcti"},"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":"2504.09388","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-04-13T00:47:48Z","cross_cats_sorted":["cs.CC","cs.DM","math.IT"],"title_canon_sha256":"385d596a1cdc5c6efbccf687f698ddbf9868bdc78889dcda44df617b39169b7d","abstract_canon_sha256":"58c87ad3444dfab76b6fbdffbc93e0497755051e85c013da7de61303bd5c8039"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:03.324478Z","signature_b64":"8ypmryf8iZRwcXmWQbKVAX/92p4B69VZNu38Ww7MTH566tIIcI6QFpH03NJGI/apsiyL1SQBL/wilAnOhjXGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ae97f4e4047db12717334cdba52b16a026ddc33a931a3806070eb6a59cee2b7","last_reissued_at":"2026-05-25T02:01:03.323783Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:03.323783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Rate-Immediacy Barrier in Explicit Tree Code Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Gil Cohen, Leonard J. Schulman, Piyush Srivastava","submitted_at":"2025-04-13T00:47:48Z","abstract_excerpt":"Since the introduction of tree codes by Schulman (STOC 1993), explicit construction of asymptotically good tree codes has remained a notorious challenge. A work by Cohen, Haeupler and Schulman (STOC 2018), as well as the state-of-the-art construction by Ben Yaacov, Cohen, and Yankovitz (STOC 2022) have achieved codes with rate $\\Omega(1/\\log\\log n)$, exponentially improving upon the original rate $\\Omega(1/\\log n)$ construction of Evans, Klugerman and Schulman from 1994. All of these constructions rely, at least in part, on increasingly sophisticated methods of combining (block) error-correcti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.09388","kind":"arxiv","version":2},"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/2504.09388/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":"2504.09388","created_at":"2026-05-25T02:01:03.323879+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.09388v2","created_at":"2026-05-25T02:01:03.323879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.09388","created_at":"2026-05-25T02:01:03.323879+00:00"},{"alias_kind":"pith_short_12","alias_value":"HLUX6TSAI7NR","created_at":"2026-05-25T02:01:03.323879+00:00"},{"alias_kind":"pith_short_16","alias_value":"HLUX6TSAI7NRE4LT","created_at":"2026-05-25T02:01:03.323879+00:00"},{"alias_kind":"pith_short_8","alias_value":"HLUX6TSA","created_at":"2026-05-25T02:01:03.323879+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/HLUX6TSAI7NRE4LTGTG3UUVRNI","json":"https://pith.science/pith/HLUX6TSAI7NRE4LTGTG3UUVRNI.json","graph_json":"https://pith.science/api/pith-number/HLUX6TSAI7NRE4LTGTG3UUVRNI/graph.json","events_json":"https://pith.science/api/pith-number/HLUX6TSAI7NRE4LTGTG3UUVRNI/events.json","paper":"https://pith.science/paper/HLUX6TSA"},"agent_actions":{"view_html":"https://pith.science/pith/HLUX6TSAI7NRE4LTGTG3UUVRNI","download_json":"https://pith.science/pith/HLUX6TSAI7NRE4LTGTG3UUVRNI.json","view_paper":"https://pith.science/paper/HLUX6TSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.09388&json=true","fetch_graph":"https://pith.science/api/pith-number/HLUX6TSAI7NRE4LTGTG3UUVRNI/graph.json","fetch_events":"https://pith.science/api/pith-number/HLUX6TSAI7NRE4LTGTG3UUVRNI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HLUX6TSAI7NRE4LTGTG3UUVRNI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HLUX6TSAI7NRE4LTGTG3UUVRNI/action/storage_attestation","attest_author":"https://pith.science/pith/HLUX6TSAI7NRE4LTGTG3UUVRNI/action/author_attestation","sign_citation":"https://pith.science/pith/HLUX6TSAI7NRE4LTGTG3UUVRNI/action/citation_signature","submit_replication":"https://pith.science/pith/HLUX6TSAI7NRE4LTGTG3UUVRNI/action/replication_record"}},"created_at":"2026-05-25T02:01:03.323879+00:00","updated_at":"2026-05-25T02:01:03.323879+00:00"}