{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GM5QPKW36HPCH4YHLVKQ3K2QAA","short_pith_number":"pith:GM5QPKW3","schema_version":"1.0","canonical_sha256":"333b07aadbf1de23f3075d550dab50003c589ec27dffb6b4a4f42b5bf04126c6","source":{"kind":"arxiv","id":"1102.1782","version":3},"attestation_state":"computed","paper":{"title":"On network coding for acyclic networks with delays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, K. Prasad","submitted_at":"2011-02-09T05:07:11Z","abstract_excerpt":"Problems related to network coding for acyclic, instantaneous networks (where the edges of the acyclic graph representing the network are assumed to have zero-delay) have been extensively dealt with in the recent past. The most prominent of these problems include (a) the existence of network codes that achieve maximum rate of transmission, (b) efficient network code constructions, and (c) field size issues. In practice, however, networks have transmission delays. In network coding theory, such networks with transmission delays are generally abstracted by assuming that their edges have integer "},"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":"1102.1782","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-09T05:07:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d25a5ee4c1230500df9e687ac4bc00e58ca3e1cdf73996ff769013102f31ce8f","abstract_canon_sha256":"ecbddbaf4b548e6bf1dba4fa38b6328e4b880736df987ef575bd6163a78b0873"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:11.976469Z","signature_b64":"/jqTzw8G8G8kJUyMrk+UcolyBEbuB5pw+bZItbZ29l5uO7DF32tGBlyeDqMHyyrXzSULQ95KB2GrUpWbrZqbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"333b07aadbf1de23f3075d550dab50003c589ec27dffb6b4a4f42b5bf04126c6","last_reissued_at":"2026-05-18T03:19:11.975951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:11.975951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On network coding for acyclic networks with delays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, K. Prasad","submitted_at":"2011-02-09T05:07:11Z","abstract_excerpt":"Problems related to network coding for acyclic, instantaneous networks (where the edges of the acyclic graph representing the network are assumed to have zero-delay) have been extensively dealt with in the recent past. The most prominent of these problems include (a) the existence of network codes that achieve maximum rate of transmission, (b) efficient network code constructions, and (c) field size issues. In practice, however, networks have transmission delays. In network coding theory, such networks with transmission delays are generally abstracted by assuming that their edges have integer "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1782","kind":"arxiv","version":3},"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":"1102.1782","created_at":"2026-05-18T03:19:11.976037+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1782v3","created_at":"2026-05-18T03:19:11.976037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1782","created_at":"2026-05-18T03:19:11.976037+00:00"},{"alias_kind":"pith_short_12","alias_value":"GM5QPKW36HPC","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"GM5QPKW36HPCH4YH","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"GM5QPKW3","created_at":"2026-05-18T12:26:30.835961+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/GM5QPKW36HPCH4YHLVKQ3K2QAA","json":"https://pith.science/pith/GM5QPKW36HPCH4YHLVKQ3K2QAA.json","graph_json":"https://pith.science/api/pith-number/GM5QPKW36HPCH4YHLVKQ3K2QAA/graph.json","events_json":"https://pith.science/api/pith-number/GM5QPKW36HPCH4YHLVKQ3K2QAA/events.json","paper":"https://pith.science/paper/GM5QPKW3"},"agent_actions":{"view_html":"https://pith.science/pith/GM5QPKW36HPCH4YHLVKQ3K2QAA","download_json":"https://pith.science/pith/GM5QPKW36HPCH4YHLVKQ3K2QAA.json","view_paper":"https://pith.science/paper/GM5QPKW3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1782&json=true","fetch_graph":"https://pith.science/api/pith-number/GM5QPKW36HPCH4YHLVKQ3K2QAA/graph.json","fetch_events":"https://pith.science/api/pith-number/GM5QPKW36HPCH4YHLVKQ3K2QAA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GM5QPKW36HPCH4YHLVKQ3K2QAA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GM5QPKW36HPCH4YHLVKQ3K2QAA/action/storage_attestation","attest_author":"https://pith.science/pith/GM5QPKW36HPCH4YHLVKQ3K2QAA/action/author_attestation","sign_citation":"https://pith.science/pith/GM5QPKW36HPCH4YHLVKQ3K2QAA/action/citation_signature","submit_replication":"https://pith.science/pith/GM5QPKW36HPCH4YHLVKQ3K2QAA/action/replication_record"}},"created_at":"2026-05-18T03:19:11.976037+00:00","updated_at":"2026-05-18T03:19:11.976037+00:00"}