{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HLUX6TSAI7NRE4LTGTG3UUVRNI","short_pith_number":"pith:HLUX6TSA","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"},"canonical_sha256":"3ae97f4e4047db12717334cdba52b16a026ddc33a931a3806070eb6a59cee2b7","source":{"kind":"arxiv","id":"2504.09388","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.09388","created_at":"2026-05-25T02:01:03Z"},{"alias_kind":"arxiv_version","alias_value":"2504.09388v2","created_at":"2026-05-25T02:01:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.09388","created_at":"2026-05-25T02:01:03Z"},{"alias_kind":"pith_short_12","alias_value":"HLUX6TSAI7NR","created_at":"2026-05-25T02:01:03Z"},{"alias_kind":"pith_short_16","alias_value":"HLUX6TSAI7NRE4LT","created_at":"2026-05-25T02:01:03Z"},{"alias_kind":"pith_short_8","alias_value":"HLUX6TSA","created_at":"2026-05-25T02:01:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HLUX6TSAI7NRE4LTGTG3UUVRNI","target":"record","payload":{"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"},"canonical_sha256":"3ae97f4e4047db12717334cdba52b16a026ddc33a931a3806070eb6a59cee2b7","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"},"source_kind":"arxiv","source_id":"2504.09388","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T02:01:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WZPhLXwzdDcVbv7EZn36B5ukFD+VBr8dpa2MjypX39xTwWzfizKgtgQl1WAerM2ucdpjbBD3PWcoaEOl/XDVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:18:27.419559Z"},"content_sha256":"75a5141fb13f117049b4fed7d710cd346488940b3c723c9c60b54492cebf8818","schema_version":"1.0","event_id":"sha256:75a5141fb13f117049b4fed7d710cd346488940b3c723c9c60b54492cebf8818"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HLUX6TSAI7NRE4LTGTG3UUVRNI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T02:01:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rAWnFkJ0HXgxiNlUV9YwqvsmjRxnShBzhCBFM/9pZIOjiGCnsMTpkzRj5SkmvVRozGNtYUBuJvueE4ZaSBhkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:18:27.419934Z"},"content_sha256":"d4e80adf837ae7fa0497f25800271e781ce413fb885d54dd4989e5d682031b7d","schema_version":"1.0","event_id":"sha256:d4e80adf837ae7fa0497f25800271e781ce413fb885d54dd4989e5d682031b7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HLUX6TSAI7NRE4LTGTG3UUVRNI/bundle.json","state_url":"https://pith.science/pith/HLUX6TSAI7NRE4LTGTG3UUVRNI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HLUX6TSAI7NRE4LTGTG3UUVRNI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T18:18:27Z","links":{"resolver":"https://pith.science/pith/HLUX6TSAI7NRE4LTGTG3UUVRNI","bundle":"https://pith.science/pith/HLUX6TSAI7NRE4LTGTG3UUVRNI/bundle.json","state":"https://pith.science/pith/HLUX6TSAI7NRE4LTGTG3UUVRNI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HLUX6TSAI7NRE4LTGTG3UUVRNI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HLUX6TSAI7NRE4LTGTG3UUVRNI","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":"58c87ad3444dfab76b6fbdffbc93e0497755051e85c013da7de61303bd5c8039","cross_cats_sorted":["cs.CC","cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-04-13T00:47:48Z","title_canon_sha256":"385d596a1cdc5c6efbccf687f698ddbf9868bdc78889dcda44df617b39169b7d"},"schema_version":"1.0","source":{"id":"2504.09388","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.09388","created_at":"2026-05-25T02:01:03Z"},{"alias_kind":"arxiv_version","alias_value":"2504.09388v2","created_at":"2026-05-25T02:01:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.09388","created_at":"2026-05-25T02:01:03Z"},{"alias_kind":"pith_short_12","alias_value":"HLUX6TSAI7NR","created_at":"2026-05-25T02:01:03Z"},{"alias_kind":"pith_short_16","alias_value":"HLUX6TSAI7NRE4LT","created_at":"2026-05-25T02:01:03Z"},{"alias_kind":"pith_short_8","alias_value":"HLUX6TSA","created_at":"2026-05-25T02:01:03Z"}],"graph_snapshots":[{"event_id":"sha256:d4e80adf837ae7fa0497f25800271e781ce413fb885d54dd4989e5d682031b7d","target":"graph","created_at":"2026-05-25T02:01:03Z","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/2504.09388/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Gil Cohen, Leonard J. Schulman, Piyush Srivastava","cross_cats":["cs.CC","cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-04-13T00:47:48Z","title":"The Rate-Immediacy Barrier in Explicit Tree Code Constructions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.09388","kind":"arxiv","version":2},"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:75a5141fb13f117049b4fed7d710cd346488940b3c723c9c60b54492cebf8818","target":"record","created_at":"2026-05-25T02:01:03Z","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":"58c87ad3444dfab76b6fbdffbc93e0497755051e85c013da7de61303bd5c8039","cross_cats_sorted":["cs.CC","cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-04-13T00:47:48Z","title_canon_sha256":"385d596a1cdc5c6efbccf687f698ddbf9868bdc78889dcda44df617b39169b7d"},"schema_version":"1.0","source":{"id":"2504.09388","kind":"arxiv","version":2}},"canonical_sha256":"3ae97f4e4047db12717334cdba52b16a026ddc33a931a3806070eb6a59cee2b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ae97f4e4047db12717334cdba52b16a026ddc33a931a3806070eb6a59cee2b7","first_computed_at":"2026-05-25T02:01:03.323783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:03.323783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8ypmryf8iZRwcXmWQbKVAX/92p4B69VZNu38Ww7MTH566tIIcI6QFpH03NJGI/apsiyL1SQBL/wilAnOhjXGDg==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:03.324478Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.09388","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75a5141fb13f117049b4fed7d710cd346488940b3c723c9c60b54492cebf8818","sha256:d4e80adf837ae7fa0497f25800271e781ce413fb885d54dd4989e5d682031b7d"],"state_sha256":"a68e946d795b4bbd832f882aa0d471bc39b3b67cf2d5aecb5baa3f358e22548d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6byQaN7taEiZmej1h0tLrPgmLlNbxZOreW3Y+6CsXgwgN5gFDXnpSa11BB1lJQuqocdlUV1E2w7o56cKgzwvBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:18:27.421944Z","bundle_sha256":"a964cf66c391bb8b731d5cde13f6cd14bc27e7460c287df51d5e3ffada8d6feb"}}