{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OTVR7ZBSEFZN3HIGZS4CWVEBAY","short_pith_number":"pith:OTVR7ZBS","canonical_record":{"source":{"id":"1203.5915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-27T10:13:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f320b561ff75eb9c1c3d24a455fc31dc08fd7e948d2bdf820f797e19cc015c1a","abstract_canon_sha256":"c6c28268f29bf21b3b0c1c74471dc5d3a8346de9c02d7c91966edec2feb091bc"},"schema_version":"1.0"},"canonical_sha256":"74eb1fe4322172dd9d06ccb82b548106240f7dfe4e7f78b378ab42acdfc1e759","source":{"kind":"arxiv","id":"1203.5915","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5915","created_at":"2026-05-18T03:59:13Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5915v1","created_at":"2026-05-18T03:59:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5915","created_at":"2026-05-18T03:59:13Z"},{"alias_kind":"pith_short_12","alias_value":"OTVR7ZBSEFZN","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OTVR7ZBSEFZN3HIG","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OTVR7ZBS","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OTVR7ZBSEFZN3HIGZS4CWVEBAY","target":"record","payload":{"canonical_record":{"source":{"id":"1203.5915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-27T10:13:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f320b561ff75eb9c1c3d24a455fc31dc08fd7e948d2bdf820f797e19cc015c1a","abstract_canon_sha256":"c6c28268f29bf21b3b0c1c74471dc5d3a8346de9c02d7c91966edec2feb091bc"},"schema_version":"1.0"},"canonical_sha256":"74eb1fe4322172dd9d06ccb82b548106240f7dfe4e7f78b378ab42acdfc1e759","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:13.070242Z","signature_b64":"RDvVQkFqA4CUauHv3ir6nAnBaitEAYrYKrQOaa98xSmjXayzry/RvrvhTfDy9mBfYZREII9MluxjRrEIbuYNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74eb1fe4322172dd9d06ccb82b548106240f7dfe4e7f78b378ab42acdfc1e759","last_reissued_at":"2026-05-18T03:59:13.069735Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:13.069735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.5915","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-18T03:59:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qkkzD291LvredHQWzXEA/YowQDAI/XSNczKJOX7/JYgnbVdbT68g+ibWMuGuhF4QMm8vaU3fRXXtCHok/vlRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:12:46.631110Z"},"content_sha256":"67c27781ca8afec456f94e44af91cb0a9d65cf315cad5791bb83015f4b4842af","schema_version":"1.0","event_id":"sha256:67c27781ca8afec456f94e44af91cb0a9d65cf315cad5791bb83015f4b4842af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OTVR7ZBSEFZN3HIGZS4CWVEBAY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Feasibility of Network Alignment for Three-Source Three-Destination Multiple Unicast Networks with Delays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abhinav Ganesan, B. Sundar Rajan, Teja Damodaram Bavirisetti","submitted_at":"2012-03-27T10:13:36Z","abstract_excerpt":"A transform approach to network coding was introduced by Bavirisetti et al. (arXiv:1103.3882v3 [cs.IT]) as a tool to view wireline networks with delays as $k$-instantaneous networks (for some large $k$). When the local encoding kernels (LEKs) of the network are varied with every time block of length $k > 1$, the network is said to use block time varying LEKs. In this work, we propose a Precoding Based Network Alignment (PBNA) scheme based on transform approach and block time varying LEKs for three-source three-destination multiple unicast network with delays (3-S 3-D MUN-D). In a recent work, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5915","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-18T03:59:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uKMDA0JQn/Td7AISfGzhy2lTT6exWA75mNZwpkbzAw8seHCBOwuALDkQ6tVk4S8WyD4p25wFAL5enmhWN5XWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:12:46.631575Z"},"content_sha256":"742acec2f37816adfb6383b83b452ac368fb03e6c9f47c14948ea61a9833b39f","schema_version":"1.0","event_id":"sha256:742acec2f37816adfb6383b83b452ac368fb03e6c9f47c14948ea61a9833b39f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTVR7ZBSEFZN3HIGZS4CWVEBAY/bundle.json","state_url":"https://pith.science/pith/OTVR7ZBSEFZN3HIGZS4CWVEBAY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTVR7ZBSEFZN3HIGZS4CWVEBAY/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-28T19:12:46Z","links":{"resolver":"https://pith.science/pith/OTVR7ZBSEFZN3HIGZS4CWVEBAY","bundle":"https://pith.science/pith/OTVR7ZBSEFZN3HIGZS4CWVEBAY/bundle.json","state":"https://pith.science/pith/OTVR7ZBSEFZN3HIGZS4CWVEBAY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTVR7ZBSEFZN3HIGZS4CWVEBAY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OTVR7ZBSEFZN3HIGZS4CWVEBAY","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":"c6c28268f29bf21b3b0c1c74471dc5d3a8346de9c02d7c91966edec2feb091bc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-27T10:13:36Z","title_canon_sha256":"f320b561ff75eb9c1c3d24a455fc31dc08fd7e948d2bdf820f797e19cc015c1a"},"schema_version":"1.0","source":{"id":"1203.5915","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5915","created_at":"2026-05-18T03:59:13Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5915v1","created_at":"2026-05-18T03:59:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5915","created_at":"2026-05-18T03:59:13Z"},{"alias_kind":"pith_short_12","alias_value":"OTVR7ZBSEFZN","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OTVR7ZBSEFZN3HIG","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OTVR7ZBS","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:742acec2f37816adfb6383b83b452ac368fb03e6c9f47c14948ea61a9833b39f","target":"graph","created_at":"2026-05-18T03:59:13Z","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 transform approach to network coding was introduced by Bavirisetti et al. (arXiv:1103.3882v3 [cs.IT]) as a tool to view wireline networks with delays as $k$-instantaneous networks (for some large $k$). When the local encoding kernels (LEKs) of the network are varied with every time block of length $k > 1$, the network is said to use block time varying LEKs. In this work, we propose a Precoding Based Network Alignment (PBNA) scheme based on transform approach and block time varying LEKs for three-source three-destination multiple unicast network with delays (3-S 3-D MUN-D). In a recent work, ","authors_text":"Abhinav Ganesan, B. Sundar Rajan, Teja Damodaram Bavirisetti","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-27T10:13:36Z","title":"On the Feasibility of Network Alignment for Three-Source Three-Destination Multiple Unicast Networks with Delays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5915","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:67c27781ca8afec456f94e44af91cb0a9d65cf315cad5791bb83015f4b4842af","target":"record","created_at":"2026-05-18T03:59:13Z","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":"c6c28268f29bf21b3b0c1c74471dc5d3a8346de9c02d7c91966edec2feb091bc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-27T10:13:36Z","title_canon_sha256":"f320b561ff75eb9c1c3d24a455fc31dc08fd7e948d2bdf820f797e19cc015c1a"},"schema_version":"1.0","source":{"id":"1203.5915","kind":"arxiv","version":1}},"canonical_sha256":"74eb1fe4322172dd9d06ccb82b548106240f7dfe4e7f78b378ab42acdfc1e759","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74eb1fe4322172dd9d06ccb82b548106240f7dfe4e7f78b378ab42acdfc1e759","first_computed_at":"2026-05-18T03:59:13.069735Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:13.069735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RDvVQkFqA4CUauHv3ir6nAnBaitEAYrYKrQOaa98xSmjXayzry/RvrvhTfDy9mBfYZREII9MluxjRrEIbuYNCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:13.070242Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.5915","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67c27781ca8afec456f94e44af91cb0a9d65cf315cad5791bb83015f4b4842af","sha256:742acec2f37816adfb6383b83b452ac368fb03e6c9f47c14948ea61a9833b39f"],"state_sha256":"d4b7006f7a7c611ce4ba68529b78a59170b136013ce574a6b93fb8303b664381"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KjvQK/+zAAvdAcCigdzfgRGQ7ay4D+N5RKLm0umyXJ5E1viIrxyGJzDwHJHKBdyStELjWH5g6Nvhn7/sCs8+DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:12:46.634107Z","bundle_sha256":"82295e45ba9e6742dee8e65a4b5f7280149cf7559dfd4b1b2b61c953ac40b178"}}