{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TTASKXDZZNEQZ74CO6AQOM4PWT","short_pith_number":"pith:TTASKXDZ","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"},"canonical_sha256":"9cc1255c79cb490cff82778107338fb4faee5b0594d27a78de3a315af0d31ad9","source":{"kind":"arxiv","id":"1504.05349","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05349","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05349v1","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05349","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"TTASKXDZZNEQ","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TTASKXDZZNEQZ74C","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TTASKXDZ","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TTASKXDZZNEQZ74CO6AQOM4PWT","target":"record","payload":{"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"},"canonical_sha256":"9cc1255c79cb490cff82778107338fb4faee5b0594d27a78de3a315af0d31ad9","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"},"source_kind":"arxiv","source_id":"1504.05349","source_version":1,"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-18T02:18:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z+7gL3YkgScUXQOCErOjV5mEK8Vhn/6e3KO1/NI+6MSNFitm8vm57bnB9DbUPDfO5BRoUzc5QFGdShR1Qgp6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:31:13.877215Z"},"content_sha256":"73f7e3477095546a9537b69f75dea1f80ff2c0a44e850597226bf536285f506e","schema_version":"1.0","event_id":"sha256:73f7e3477095546a9537b69f75dea1f80ff2c0a44e850597226bf536285f506e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TTASKXDZZNEQZ74CO6AQOM4PWT","target":"graph","payload":{"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"},"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-18T02:18:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J1BvmqZYhvHJ336g/B0jk3r5+9PCYRr2NfbDM2hcaU28om4e5JjXyFeAv3IbmSpSqZw5K4vRO1on1bvFfyPPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:31:13.877570Z"},"content_sha256":"14eaf62b839655e35f20f9a4ae52de100aa378a6dddcb1d0c74d37b8ff815878","schema_version":"1.0","event_id":"sha256:14eaf62b839655e35f20f9a4ae52de100aa378a6dddcb1d0c74d37b8ff815878"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TTASKXDZZNEQZ74CO6AQOM4PWT/bundle.json","state_url":"https://pith.science/pith/TTASKXDZZNEQZ74CO6AQOM4PWT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TTASKXDZZNEQZ74CO6AQOM4PWT/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-05-28T11:31:13Z","links":{"resolver":"https://pith.science/pith/TTASKXDZZNEQZ74CO6AQOM4PWT","bundle":"https://pith.science/pith/TTASKXDZZNEQZ74CO6AQOM4PWT/bundle.json","state":"https://pith.science/pith/TTASKXDZZNEQZ74CO6AQOM4PWT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TTASKXDZZNEQZ74CO6AQOM4PWT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TTASKXDZZNEQZ74CO6AQOM4PWT","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":"4411da1b44ac0503011fde479ad084c06a69a8689bbd1818049620ada98c1358","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-21T09:23:30Z","title_canon_sha256":"59307244dac31db88841d12a1f08c2f8884f10688fd15d2bc7b2ef85574f22e3"},"schema_version":"1.0","source":{"id":"1504.05349","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05349","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05349v1","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05349","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"TTASKXDZZNEQ","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TTASKXDZZNEQZ74C","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TTASKXDZ","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:14eaf62b839655e35f20f9a4ae52de100aa378a6dddcb1d0c74d37b8ff815878","target":"graph","created_at":"2026-05-18T02:18:14Z","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"},"paper":{"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","authors_text":"Hannes Bartz, Vladimir Sidorenko","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-21T09:23:30Z","title":"List and Probabilistic Unique Decoding of Folded Subspace Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05349","kind":"arxiv","version":1},"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:73f7e3477095546a9537b69f75dea1f80ff2c0a44e850597226bf536285f506e","target":"record","created_at":"2026-05-18T02:18:14Z","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":"4411da1b44ac0503011fde479ad084c06a69a8689bbd1818049620ada98c1358","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-21T09:23:30Z","title_canon_sha256":"59307244dac31db88841d12a1f08c2f8884f10688fd15d2bc7b2ef85574f22e3"},"schema_version":"1.0","source":{"id":"1504.05349","kind":"arxiv","version":1}},"canonical_sha256":"9cc1255c79cb490cff82778107338fb4faee5b0594d27a78de3a315af0d31ad9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cc1255c79cb490cff82778107338fb4faee5b0594d27a78de3a315af0d31ad9","first_computed_at":"2026-05-18T02:18:14.479387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:14.479387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P1rnud1UeJXpXKVgqoxc+Js6CsJsXuZcNRWVt4OUgZCWYeZuGHmL0dLIZ2zQbFD/51OxqpmDd8TxfyT+Y2POCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:14.479886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05349","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73f7e3477095546a9537b69f75dea1f80ff2c0a44e850597226bf536285f506e","sha256:14eaf62b839655e35f20f9a4ae52de100aa378a6dddcb1d0c74d37b8ff815878"],"state_sha256":"646d47efdccff911572f1e5ddc9c29572534358dc9c0e549e82bc2c6093aefee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PoZL7CGLFM9d37WdRGzFLA032YwED0fthY4KvQTlA614Tq7AVGx+RJHApff1geZtcfdCB+lCFbGnWZnP6Cl+Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:31:13.879470Z","bundle_sha256":"463d2f864b87c24fc7e7e1ef27ab8a842570f1a9f6a521cb8c6075ed58b35a83"}}