{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NR2UDU4Z6CNEXQKYCPVX5BX6OD","short_pith_number":"pith:NR2UDU4Z","canonical_record":{"source":{"id":"1401.6670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-26T17:25:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fc7c93dd9883b37ff7c1bf3d565d032652fcc2cb975a0c342a5a83330ce3ede9","abstract_canon_sha256":"c9bd9f6f3c024103755d8bc92887b65a2e79e95888093b61b1b7e08722a21e5d"},"schema_version":"1.0"},"canonical_sha256":"6c7541d399f09a4bc15813eb7e86fe70fe1e5e6636e21eaba92f2cc6f4c0f355","source":{"kind":"arxiv","id":"1401.6670","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6670","created_at":"2026-05-18T02:43:00Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6670v1","created_at":"2026-05-18T02:43:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6670","created_at":"2026-05-18T02:43:00Z"},{"alias_kind":"pith_short_12","alias_value":"NR2UDU4Z6CNE","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NR2UDU4Z6CNEXQKY","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NR2UDU4Z","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NR2UDU4Z6CNEXQKYCPVX5BX6OD","target":"record","payload":{"canonical_record":{"source":{"id":"1401.6670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-26T17:25:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fc7c93dd9883b37ff7c1bf3d565d032652fcc2cb975a0c342a5a83330ce3ede9","abstract_canon_sha256":"c9bd9f6f3c024103755d8bc92887b65a2e79e95888093b61b1b7e08722a21e5d"},"schema_version":"1.0"},"canonical_sha256":"6c7541d399f09a4bc15813eb7e86fe70fe1e5e6636e21eaba92f2cc6f4c0f355","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:00.638960Z","signature_b64":"FIDPXJGz3i6BEibLBptPOJ9SUE3S0wGsikDpstISnRPid6rumLq3ALv+FM4Z+uVCGqOKFV0ghTbb+zLNS+MaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c7541d399f09a4bc15813eb7e86fe70fe1e5e6636e21eaba92f2cc6f4c0f355","last_reissued_at":"2026-05-18T02:43:00.638397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:00.638397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.6670","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:43:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7EbbpqXzgadPN2RaJG9zspApTrYfMzo6Cr4mrfTFMrDN3e3BuC02qJY5f7tKMzBzu+Il+NzfepSQm2vQQtlWBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:53:38.272864Z"},"content_sha256":"b2eda82cebc214a61d71dc44ad56f45419c89fce3bd61c46dcbb0a252fe76f08","schema_version":"1.0","event_id":"sha256:b2eda82cebc214a61d71dc44ad56f45419c89fce3bd61c46dcbb0a252fe76f08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NR2UDU4Z6CNEXQKYCPVX5BX6OD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resilient Flow Decomposition of Unicast Connections with Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Janos Tapolcai, Lajos Ronyai, Muriel Medard, Peter Babarczi","submitted_at":"2014-01-26T17:25:16Z","abstract_excerpt":"In this paper we close the gap between end-to-end diversity coding and intra-session network coding for unicast connections resilient against single link failures. In particular, we show that coding operations are sufficient to perform at the source and receiver if the user data can be split into at most two parts over the filed GF(2). Our proof is purely combinatorial and based on standard graph and network flow techniques. It is a linear time construction that defines the route of subflows A, B and A+B between the source and destination nodes. The proposed resilient flow decomposition method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6670","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:43:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sRNgMvPLNWBcvklI9lVOwayyF/LtCdv7pme4HOuD3MjEnP0ipWwJI83cXVs78a+eboGTxdTCnVFzejLChOTkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:53:38.273207Z"},"content_sha256":"0492a7f3d961c95745d1e073203993f80e86b67eb4389ef04a4049c3fe60dc3a","schema_version":"1.0","event_id":"sha256:0492a7f3d961c95745d1e073203993f80e86b67eb4389ef04a4049c3fe60dc3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NR2UDU4Z6CNEXQKYCPVX5BX6OD/bundle.json","state_url":"https://pith.science/pith/NR2UDU4Z6CNEXQKYCPVX5BX6OD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NR2UDU4Z6CNEXQKYCPVX5BX6OD/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-08T23:53:38Z","links":{"resolver":"https://pith.science/pith/NR2UDU4Z6CNEXQKYCPVX5BX6OD","bundle":"https://pith.science/pith/NR2UDU4Z6CNEXQKYCPVX5BX6OD/bundle.json","state":"https://pith.science/pith/NR2UDU4Z6CNEXQKYCPVX5BX6OD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NR2UDU4Z6CNEXQKYCPVX5BX6OD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NR2UDU4Z6CNEXQKYCPVX5BX6OD","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":"c9bd9f6f3c024103755d8bc92887b65a2e79e95888093b61b1b7e08722a21e5d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-26T17:25:16Z","title_canon_sha256":"fc7c93dd9883b37ff7c1bf3d565d032652fcc2cb975a0c342a5a83330ce3ede9"},"schema_version":"1.0","source":{"id":"1401.6670","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6670","created_at":"2026-05-18T02:43:00Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6670v1","created_at":"2026-05-18T02:43:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6670","created_at":"2026-05-18T02:43:00Z"},{"alias_kind":"pith_short_12","alias_value":"NR2UDU4Z6CNE","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NR2UDU4Z6CNEXQKY","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NR2UDU4Z","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:0492a7f3d961c95745d1e073203993f80e86b67eb4389ef04a4049c3fe60dc3a","target":"graph","created_at":"2026-05-18T02:43:00Z","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":"In this paper we close the gap between end-to-end diversity coding and intra-session network coding for unicast connections resilient against single link failures. In particular, we show that coding operations are sufficient to perform at the source and receiver if the user data can be split into at most two parts over the filed GF(2). Our proof is purely combinatorial and based on standard graph and network flow techniques. It is a linear time construction that defines the route of subflows A, B and A+B between the source and destination nodes. The proposed resilient flow decomposition method","authors_text":"Janos Tapolcai, Lajos Ronyai, Muriel Medard, Peter Babarczi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-26T17:25:16Z","title":"Resilient Flow Decomposition of Unicast Connections with Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6670","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:b2eda82cebc214a61d71dc44ad56f45419c89fce3bd61c46dcbb0a252fe76f08","target":"record","created_at":"2026-05-18T02:43:00Z","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":"c9bd9f6f3c024103755d8bc92887b65a2e79e95888093b61b1b7e08722a21e5d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-26T17:25:16Z","title_canon_sha256":"fc7c93dd9883b37ff7c1bf3d565d032652fcc2cb975a0c342a5a83330ce3ede9"},"schema_version":"1.0","source":{"id":"1401.6670","kind":"arxiv","version":1}},"canonical_sha256":"6c7541d399f09a4bc15813eb7e86fe70fe1e5e6636e21eaba92f2cc6f4c0f355","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c7541d399f09a4bc15813eb7e86fe70fe1e5e6636e21eaba92f2cc6f4c0f355","first_computed_at":"2026-05-18T02:43:00.638397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:00.638397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FIDPXJGz3i6BEibLBptPOJ9SUE3S0wGsikDpstISnRPid6rumLq3ALv+FM4Z+uVCGqOKFV0ghTbb+zLNS+MaBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:00.638960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6670","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2eda82cebc214a61d71dc44ad56f45419c89fce3bd61c46dcbb0a252fe76f08","sha256:0492a7f3d961c95745d1e073203993f80e86b67eb4389ef04a4049c3fe60dc3a"],"state_sha256":"df6c9cedb2587fe78eebcafb36b82447902457522d0465577b057f26f29fbf1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mBh/gW3AXlYdhYxgKd92qLd0d8lI+vNhBeTW/sFRCbXOFo6/SvxOAJyxKXg4JRn/B8ZxaiSAtlrAOPYTzFviAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:53:38.275238Z","bundle_sha256":"5edbe6594d4cfa2acf4c2efe585c5152b24db564c91d2238e1a2edb82d1975e5"}}