{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NBD5KZVFES46KP6VO64Y7ES7FJ","short_pith_number":"pith:NBD5KZVF","schema_version":"1.0","canonical_sha256":"6847d566a524b9e53fd577b98f925f2a7edd0b72c97c662d6c3bfa77f59685bd","source":{"kind":"arxiv","id":"1103.0999","version":2},"attestation_state":"computed","paper":{"title":"Deterministic Network Model Revisited: An Algebraic Network Coding Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Edmund M. Yeh, Elona Erez, MinJi Kim, Muriel Medard","submitted_at":"2011-03-05T02:27:19Z","abstract_excerpt":"The capacity of multiuser networks has been a long-standing problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to approximate multiuser wireless networks. This model, known as the ADT network model, takes into account the broadcast nature of wireless medium and interference.\n  We show that the ADT network model can be described within the algebraic network coding framework introduced by Koetter and Medard. We prove that the ADT network problem can be captured by a single matrix, and show that the min-cut of an ADT network is the rank of this "},"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.0999","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-05T02:27:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"833e2776766d7d5e69084cc5b2e1c2ba52f796ae95730bf3c127696b453fb54f","abstract_canon_sha256":"c9e702dfefbc2ab975feeddf99048ee4ce76e51e42e6dc9c96b337fe1bb10047"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:41.112731Z","signature_b64":"BqVl9BpvwbjqP6Wp953G9qrb7jO4TmJ59/EkgVhtY38VLdAfB4PVPGfn+Ybklzwkg6DYAD74YbzYmCNnVFQcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6847d566a524b9e53fd577b98f925f2a7edd0b72c97c662d6c3bfa77f59685bd","last_reissued_at":"2026-05-18T04:22:41.112120Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:41.112120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Network Model Revisited: An Algebraic Network Coding Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Edmund M. Yeh, Elona Erez, MinJi Kim, Muriel Medard","submitted_at":"2011-03-05T02:27:19Z","abstract_excerpt":"The capacity of multiuser networks has been a long-standing problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to approximate multiuser wireless networks. This model, known as the ADT network model, takes into account the broadcast nature of wireless medium and interference.\n  We show that the ADT network model can be described within the algebraic network coding framework introduced by Koetter and Medard. We prove that the ADT network problem can be captured by a single matrix, and show that the min-cut of an ADT network is the rank of this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0999","kind":"arxiv","version":2},"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.0999","created_at":"2026-05-18T04:22:41.112211+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.0999v2","created_at":"2026-05-18T04:22:41.112211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0999","created_at":"2026-05-18T04:22:41.112211+00:00"},{"alias_kind":"pith_short_12","alias_value":"NBD5KZVFES46","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NBD5KZVFES46KP6V","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NBD5KZVF","created_at":"2026-05-18T12:26:37.096874+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/NBD5KZVFES46KP6VO64Y7ES7FJ","json":"https://pith.science/pith/NBD5KZVFES46KP6VO64Y7ES7FJ.json","graph_json":"https://pith.science/api/pith-number/NBD5KZVFES46KP6VO64Y7ES7FJ/graph.json","events_json":"https://pith.science/api/pith-number/NBD5KZVFES46KP6VO64Y7ES7FJ/events.json","paper":"https://pith.science/paper/NBD5KZVF"},"agent_actions":{"view_html":"https://pith.science/pith/NBD5KZVFES46KP6VO64Y7ES7FJ","download_json":"https://pith.science/pith/NBD5KZVFES46KP6VO64Y7ES7FJ.json","view_paper":"https://pith.science/paper/NBD5KZVF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.0999&json=true","fetch_graph":"https://pith.science/api/pith-number/NBD5KZVFES46KP6VO64Y7ES7FJ/graph.json","fetch_events":"https://pith.science/api/pith-number/NBD5KZVFES46KP6VO64Y7ES7FJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NBD5KZVFES46KP6VO64Y7ES7FJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NBD5KZVFES46KP6VO64Y7ES7FJ/action/storage_attestation","attest_author":"https://pith.science/pith/NBD5KZVFES46KP6VO64Y7ES7FJ/action/author_attestation","sign_citation":"https://pith.science/pith/NBD5KZVFES46KP6VO64Y7ES7FJ/action/citation_signature","submit_replication":"https://pith.science/pith/NBD5KZVFES46KP6VO64Y7ES7FJ/action/replication_record"}},"created_at":"2026-05-18T04:22:41.112211+00:00","updated_at":"2026-05-18T04:22:41.112211+00:00"}