{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2YV7D6NML55Y7QOHIEKVEPM6WD","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":"cb1496283862219e1120cbde6736827ce6e93f5819cf5b571813799ce080baa4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-20T19:54:55Z","title_canon_sha256":"adb07379d7d7232bfaeea9796693e5480588666eec73a678db9b7ab72848cd34"},"schema_version":"1.0","source":{"id":"1103.3882","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3882","created_at":"2026-05-18T02:22:17Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3882v4","created_at":"2026-05-18T02:22:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3882","created_at":"2026-05-18T02:22:17Z"},{"alias_kind":"pith_short_12","alias_value":"2YV7D6NML55Y","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2YV7D6NML55Y7QOH","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2YV7D6NM","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:c3def4b2ea9e88dfb7fe7414f49f3a4c2fee30e6e4420cc285291f1404a73bca","target":"graph","created_at":"2026-05-18T02:22:17Z","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":"The algebraic formulation for linear network coding in acyclic networks with the links having integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes, at any given time instant, is a \\mathbb{F}_{q}$-linear combination of the input symbols across different generations, where $\\mathbb{F}_{q}$ denotes the field over which the network operates. We use finite-field discrete fourier transform (DFT) to convert the output symbols at the sink nodes, at any give","authors_text":"B. Sundar Rajan, G. Abhinav, K. Prasad, Teja Damodaram Bavirisetti","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-20T19:54:55Z","title":"A Transform Approach to Linear Network Coding for Acyclic Networks with Delay"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3882","kind":"arxiv","version":4},"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:78388fef527bf14830e6afde2f9dac2ec071bc2f07adf8ac31f11d2e9e6e4921","target":"record","created_at":"2026-05-18T02:22:17Z","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":"cb1496283862219e1120cbde6736827ce6e93f5819cf5b571813799ce080baa4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-20T19:54:55Z","title_canon_sha256":"adb07379d7d7232bfaeea9796693e5480588666eec73a678db9b7ab72848cd34"},"schema_version":"1.0","source":{"id":"1103.3882","kind":"arxiv","version":4}},"canonical_sha256":"d62bf1f9ac5f7b8fc1c74115523d9eb0d6a4823383f7b2da208248a120b79afb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d62bf1f9ac5f7b8fc1c74115523d9eb0d6a4823383f7b2da208248a120b79afb","first_computed_at":"2026-05-18T02:22:17.978145Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:17.978145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pfNexAnD98y0t8shbAL1zvSh7dT8VL03ksTJ8vN4wc25qiuM4qPPEJluYe2aQzx4+I84QKxF6yfNmQnYVQ9aAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:17.978831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.3882","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78388fef527bf14830e6afde2f9dac2ec071bc2f07adf8ac31f11d2e9e6e4921","sha256:c3def4b2ea9e88dfb7fe7414f49f3a4c2fee30e6e4420cc285291f1404a73bca"],"state_sha256":"93e6f5a4eaa749e9b426789b363d49727c7fbc633b98ef43c4f2cc029ad33afe"}