{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2YV7D6NML55Y7QOHIEKVEPM6WD","short_pith_number":"pith:2YV7D6NM","schema_version":"1.0","canonical_sha256":"d62bf1f9ac5f7b8fc1c74115523d9eb0d6a4823383f7b2da208248a120b79afb","source":{"kind":"arxiv","id":"1103.3882","version":4},"attestation_state":"computed","paper":{"title":"A Transform Approach to Linear Network Coding for Acyclic Networks with Delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, G. Abhinav, K. Prasad, Teja Damodaram Bavirisetti","submitted_at":"2011-03-20T19:54:55Z","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"},"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":"1103.3882","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-20T19:54:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"adb07379d7d7232bfaeea9796693e5480588666eec73a678db9b7ab72848cd34","abstract_canon_sha256":"cb1496283862219e1120cbde6736827ce6e93f5819cf5b571813799ce080baa4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:17.978831Z","signature_b64":"pfNexAnD98y0t8shbAL1zvSh7dT8VL03ksTJ8vN4wc25qiuM4qPPEJluYe2aQzx4+I84QKxF6yfNmQnYVQ9aAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d62bf1f9ac5f7b8fc1c74115523d9eb0d6a4823383f7b2da208248a120b79afb","last_reissued_at":"2026-05-18T02:22:17.978145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:17.978145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Transform Approach to Linear Network Coding for Acyclic Networks with Delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, G. Abhinav, K. Prasad, Teja Damodaram Bavirisetti","submitted_at":"2011-03-20T19:54:55Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3882","kind":"arxiv","version":4},"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":"1103.3882","created_at":"2026-05-18T02:22:17.978287+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.3882v4","created_at":"2026-05-18T02:22:17.978287+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3882","created_at":"2026-05-18T02:22:17.978287+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YV7D6NML55Y","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YV7D6NML55Y7QOH","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YV7D6NM","created_at":"2026-05-18T12:26:18.847500+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/2YV7D6NML55Y7QOHIEKVEPM6WD","json":"https://pith.science/pith/2YV7D6NML55Y7QOHIEKVEPM6WD.json","graph_json":"https://pith.science/api/pith-number/2YV7D6NML55Y7QOHIEKVEPM6WD/graph.json","events_json":"https://pith.science/api/pith-number/2YV7D6NML55Y7QOHIEKVEPM6WD/events.json","paper":"https://pith.science/paper/2YV7D6NM"},"agent_actions":{"view_html":"https://pith.science/pith/2YV7D6NML55Y7QOHIEKVEPM6WD","download_json":"https://pith.science/pith/2YV7D6NML55Y7QOHIEKVEPM6WD.json","view_paper":"https://pith.science/paper/2YV7D6NM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.3882&json=true","fetch_graph":"https://pith.science/api/pith-number/2YV7D6NML55Y7QOHIEKVEPM6WD/graph.json","fetch_events":"https://pith.science/api/pith-number/2YV7D6NML55Y7QOHIEKVEPM6WD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YV7D6NML55Y7QOHIEKVEPM6WD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YV7D6NML55Y7QOHIEKVEPM6WD/action/storage_attestation","attest_author":"https://pith.science/pith/2YV7D6NML55Y7QOHIEKVEPM6WD/action/author_attestation","sign_citation":"https://pith.science/pith/2YV7D6NML55Y7QOHIEKVEPM6WD/action/citation_signature","submit_replication":"https://pith.science/pith/2YV7D6NML55Y7QOHIEKVEPM6WD/action/replication_record"}},"created_at":"2026-05-18T02:22:17.978287+00:00","updated_at":"2026-05-18T02:22:17.978287+00:00"}