{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SD7AL4QRQRRWQ4IUNPIH5RPD6Q","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":"29679434859ca2e85325b2106f97969329f3cd89454c4f1a5c24693948f09c47","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-10T13:28:46Z","title_canon_sha256":"93f16c717367d5ab7a152e9955af92318355ae73c24e31d47bea9524d24ab718"},"schema_version":"1.0","source":{"id":"1310.2809","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2809","created_at":"2026-05-18T03:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2809v1","created_at":"2026-05-18T03:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2809","created_at":"2026-05-18T03:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"SD7AL4QRQRRW","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SD7AL4QRQRRWQ4IU","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SD7AL4QR","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:3afdd70a22193cb2d12385e307027656326a68ed21b016289ad1d218640d2861","target":"graph","created_at":"2026-05-18T03:10:46Z","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}_{p^m}$-linear combination of the input symbols across different generations where, $\\mathbb{F}_{p^m}$ denotes the field over which the network operates ($p$ is prime and $m$ is a positive integer). We use finite-field discrete fourier transform (DFT) to convert","authors_text":"Abhinav Ganesan, B. Sundar Rajan, 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":"2013-10-10T13:28:46Z","title":"Precoding Based Network Alignment using Transform Approach for Acyclic Networks with Delay"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2809","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:6fd93ba871aa3e1ef29275beca0d6e11e46b0d115ac28a66b56c756f6ea0a8e8","target":"record","created_at":"2026-05-18T03:10:46Z","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":"29679434859ca2e85325b2106f97969329f3cd89454c4f1a5c24693948f09c47","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-10T13:28:46Z","title_canon_sha256":"93f16c717367d5ab7a152e9955af92318355ae73c24e31d47bea9524d24ab718"},"schema_version":"1.0","source":{"id":"1310.2809","kind":"arxiv","version":1}},"canonical_sha256":"90fe05f21184636871146bd07ec5e3f43656424cb07bb62550c609f4b3cab685","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90fe05f21184636871146bd07ec5e3f43656424cb07bb62550c609f4b3cab685","first_computed_at":"2026-05-18T03:10:46.651342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:46.651342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NFDBt9NJCWcTtl3lIcBbST3RP24EEj6sbdeQLxsFxLvDE7+MSl51hbrZv1FgSV3tBdlE/quBPyq//2nNpDQMAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:46.652227Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2809","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fd93ba871aa3e1ef29275beca0d6e11e46b0d115ac28a66b56c756f6ea0a8e8","sha256:3afdd70a22193cb2d12385e307027656326a68ed21b016289ad1d218640d2861"],"state_sha256":"4bfb2df0ae1b65d9bc47d19eddb5e4f22116e0bc8b0906a59d7e878e83b44209"}