{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TTASKXDZZNEQZ74CO6AQOM4PWT","short_pith_number":"pith:TTASKXDZ","schema_version":"1.0","canonical_sha256":"9cc1255c79cb490cff82778107338fb4faee5b0594d27a78de3a315af0d31ad9","source":{"kind":"arxiv","id":"1504.05349","version":1},"attestation_state":"computed","paper":{"title":"List and Probabilistic Unique Decoding of Folded Subspace Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hannes Bartz, Vladimir Sidorenko","submitted_at":"2015-04-21T09:23:30Z","abstract_excerpt":"A new class of folded subspace codes for noncoherent network coding is presented. The codes can correct insertions and deletions beyond the unique decoding radius for any code rate $R\\in[0,1]$. An efficient interpolation-based decoding algorithm for this code construction is given which allows to correct insertions and deletions up to the normalized radius $s(1-((1/h+h)/(h-s+1))R)$, where $h$ is the folding parameter and $s\\leq h$ is a decoding parameter. The algorithm serves as a list decoder or as a probabilistic unique decoder that outputs a unique solution with high probability. An upper b"},"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":"1504.05349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-21T09:23:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"59307244dac31db88841d12a1f08c2f8884f10688fd15d2bc7b2ef85574f22e3","abstract_canon_sha256":"4411da1b44ac0503011fde479ad084c06a69a8689bbd1818049620ada98c1358"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:14.479886Z","signature_b64":"P1rnud1UeJXpXKVgqoxc+Js6CsJsXuZcNRWVt4OUgZCWYeZuGHmL0dLIZ2zQbFD/51OxqpmDd8TxfyT+Y2POCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cc1255c79cb490cff82778107338fb4faee5b0594d27a78de3a315af0d31ad9","last_reissued_at":"2026-05-18T02:18:14.479387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:14.479387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List and Probabilistic Unique Decoding of Folded Subspace Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hannes Bartz, Vladimir Sidorenko","submitted_at":"2015-04-21T09:23:30Z","abstract_excerpt":"A new class of folded subspace codes for noncoherent network coding is presented. The codes can correct insertions and deletions beyond the unique decoding radius for any code rate $R\\in[0,1]$. An efficient interpolation-based decoding algorithm for this code construction is given which allows to correct insertions and deletions up to the normalized radius $s(1-((1/h+h)/(h-s+1))R)$, where $h$ is the folding parameter and $s\\leq h$ is a decoding parameter. The algorithm serves as a list decoder or as a probabilistic unique decoder that outputs a unique solution with high probability. An upper b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05349","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":""},"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":"1504.05349","created_at":"2026-05-18T02:18:14.479464+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05349v1","created_at":"2026-05-18T02:18:14.479464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05349","created_at":"2026-05-18T02:18:14.479464+00:00"},{"alias_kind":"pith_short_12","alias_value":"TTASKXDZZNEQ","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TTASKXDZZNEQZ74C","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TTASKXDZ","created_at":"2026-05-18T12:29:42.218222+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/TTASKXDZZNEQZ74CO6AQOM4PWT","json":"https://pith.science/pith/TTASKXDZZNEQZ74CO6AQOM4PWT.json","graph_json":"https://pith.science/api/pith-number/TTASKXDZZNEQZ74CO6AQOM4PWT/graph.json","events_json":"https://pith.science/api/pith-number/TTASKXDZZNEQZ74CO6AQOM4PWT/events.json","paper":"https://pith.science/paper/TTASKXDZ"},"agent_actions":{"view_html":"https://pith.science/pith/TTASKXDZZNEQZ74CO6AQOM4PWT","download_json":"https://pith.science/pith/TTASKXDZZNEQZ74CO6AQOM4PWT.json","view_paper":"https://pith.science/paper/TTASKXDZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05349&json=true","fetch_graph":"https://pith.science/api/pith-number/TTASKXDZZNEQZ74CO6AQOM4PWT/graph.json","fetch_events":"https://pith.science/api/pith-number/TTASKXDZZNEQZ74CO6AQOM4PWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TTASKXDZZNEQZ74CO6AQOM4PWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TTASKXDZZNEQZ74CO6AQOM4PWT/action/storage_attestation","attest_author":"https://pith.science/pith/TTASKXDZZNEQZ74CO6AQOM4PWT/action/author_attestation","sign_citation":"https://pith.science/pith/TTASKXDZZNEQZ74CO6AQOM4PWT/action/citation_signature","submit_replication":"https://pith.science/pith/TTASKXDZZNEQZ74CO6AQOM4PWT/action/replication_record"}},"created_at":"2026-05-18T02:18:14.479464+00:00","updated_at":"2026-05-18T02:18:14.479464+00:00"}