{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SD7AL4QRQRRWQ4IUNPIH5RPD6Q","short_pith_number":"pith:SD7AL4QR","schema_version":"1.0","canonical_sha256":"90fe05f21184636871146bd07ec5e3f43656424cb07bb62550c609f4b3cab685","source":{"kind":"arxiv","id":"1310.2809","version":1},"attestation_state":"computed","paper":{"title":"Precoding Based Network Alignment using Transform Approach 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":"Abhinav Ganesan, B. Sundar Rajan, K. Prasad, Teja Damodaram Bavirisetti","submitted_at":"2013-10-10T13:28:46Z","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"},"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":"1310.2809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-10T13:28:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"93f16c717367d5ab7a152e9955af92318355ae73c24e31d47bea9524d24ab718","abstract_canon_sha256":"29679434859ca2e85325b2106f97969329f3cd89454c4f1a5c24693948f09c47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:46.652227Z","signature_b64":"NFDBt9NJCWcTtl3lIcBbST3RP24EEj6sbdeQLxsFxLvDE7+MSl51hbrZv1FgSV3tBdlE/quBPyq//2nNpDQMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90fe05f21184636871146bd07ec5e3f43656424cb07bb62550c609f4b3cab685","last_reissued_at":"2026-05-18T03:10:46.651342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:46.651342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Precoding Based Network Alignment using Transform Approach 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":"Abhinav Ganesan, B. Sundar Rajan, K. Prasad, Teja Damodaram Bavirisetti","submitted_at":"2013-10-10T13:28:46Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2809","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.2809","created_at":"2026-05-18T03:10:46.651500+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2809v1","created_at":"2026-05-18T03:10:46.651500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2809","created_at":"2026-05-18T03:10:46.651500+00:00"},{"alias_kind":"pith_short_12","alias_value":"SD7AL4QRQRRW","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SD7AL4QRQRRWQ4IU","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SD7AL4QR","created_at":"2026-05-18T12:27:59.945178+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/SD7AL4QRQRRWQ4IUNPIH5RPD6Q","json":"https://pith.science/pith/SD7AL4QRQRRWQ4IUNPIH5RPD6Q.json","graph_json":"https://pith.science/api/pith-number/SD7AL4QRQRRWQ4IUNPIH5RPD6Q/graph.json","events_json":"https://pith.science/api/pith-number/SD7AL4QRQRRWQ4IUNPIH5RPD6Q/events.json","paper":"https://pith.science/paper/SD7AL4QR"},"agent_actions":{"view_html":"https://pith.science/pith/SD7AL4QRQRRWQ4IUNPIH5RPD6Q","download_json":"https://pith.science/pith/SD7AL4QRQRRWQ4IUNPIH5RPD6Q.json","view_paper":"https://pith.science/paper/SD7AL4QR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2809&json=true","fetch_graph":"https://pith.science/api/pith-number/SD7AL4QRQRRWQ4IUNPIH5RPD6Q/graph.json","fetch_events":"https://pith.science/api/pith-number/SD7AL4QRQRRWQ4IUNPIH5RPD6Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SD7AL4QRQRRWQ4IUNPIH5RPD6Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SD7AL4QRQRRWQ4IUNPIH5RPD6Q/action/storage_attestation","attest_author":"https://pith.science/pith/SD7AL4QRQRRWQ4IUNPIH5RPD6Q/action/author_attestation","sign_citation":"https://pith.science/pith/SD7AL4QRQRRWQ4IUNPIH5RPD6Q/action/citation_signature","submit_replication":"https://pith.science/pith/SD7AL4QRQRRWQ4IUNPIH5RPD6Q/action/replication_record"}},"created_at":"2026-05-18T03:10:46.651500+00:00","updated_at":"2026-05-18T03:10:46.651500+00:00"}