{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:DYSWEBHLL3YTPGS6CWZTDVVBXF","short_pith_number":"pith:DYSWEBHL","canonical_record":{"source":{"id":"1001.2464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-14T13:55:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"36b90fc1b67c9ccbc10bc283f158551f6038dbe299c81d9f8860872b73edb9b9","abstract_canon_sha256":"abf88318753766279e9a3230ae24b343d3b2ddd952a4e2e15b418296f23fe146"},"schema_version":"1.0"},"canonical_sha256":"1e256204eb5ef1379a5e15b331d6a1b97d97b1a3d12ac44d8d748955a968d011","source":{"kind":"arxiv","id":"1001.2464","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.2464","created_at":"2026-05-18T01:04:59Z"},{"alias_kind":"arxiv_version","alias_value":"1001.2464v1","created_at":"2026-05-18T01:04:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.2464","created_at":"2026-05-18T01:04:59Z"},{"alias_kind":"pith_short_12","alias_value":"DYSWEBHLL3YT","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DYSWEBHLL3YTPGS6","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DYSWEBHL","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:DYSWEBHLL3YTPGS6CWZTDVVBXF","target":"record","payload":{"canonical_record":{"source":{"id":"1001.2464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-14T13:55:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"36b90fc1b67c9ccbc10bc283f158551f6038dbe299c81d9f8860872b73edb9b9","abstract_canon_sha256":"abf88318753766279e9a3230ae24b343d3b2ddd952a4e2e15b418296f23fe146"},"schema_version":"1.0"},"canonical_sha256":"1e256204eb5ef1379a5e15b331d6a1b97d97b1a3d12ac44d8d748955a968d011","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:59.110617Z","signature_b64":"CETvCvFKI4FbUFZuIqNZT8RXDNq5gSJcQozGTmjLFR1SsneyCxD3wn4WIIucbRFJjpfhlstIyphMC0rDN9fxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e256204eb5ef1379a5e15b331d6a1b97d97b1a3d12ac44d8d748955a968d011","last_reissued_at":"2026-05-18T01:04:59.110078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:59.110078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.2464","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tWDxu+9bVkrZAVu47D7tamxWw/tDd/Fgl/SQb1h9rzyxX+oMgxFAAj08n9Abn2FRilGNBnwLNLlg3MgnWTUFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:49:13.471565Z"},"content_sha256":"df9d2fa5fda2727e9b2e8ba4d94242b5f2b71de06b4d9ae2cab683e8903669cb","schema_version":"1.0","event_id":"sha256:df9d2fa5fda2727e9b2e8ba4d94242b5f2b71de06b4d9ae2cab683e8903669cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:DYSWEBHLL3YTPGS6CWZTDVVBXF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Finite-Field Deterministic Networks With Many Sources and One Destination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, M. Majid Butt, Ralf R. M\\\"uller","submitted_at":"2010-01-14T13:55:38Z","abstract_excerpt":"We find the capacity region of linear finite-field deterministic networks with many sources and one destination. Nodes in the network are subject to interference and broadcast constraints, specified by the linear finite-field deterministic model. Each node can inject its own information as well as relay other nodes' information. We show that the capacity region coincides with the cut-set region. Also, for a specific case of correlated sources we provide necessary and sufficient conditions for the sources transmissibility. Given the \"deterministic model\" approximation for the corresponding Gaus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.2464","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NqUX7VkKkil+d272e/nqfaumdEdrkzvApnQMoKgn5GbhAHIr9HhUydYaeIhtnocb7bW5bLPcJsiYVKkBsfs2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:49:13.471911Z"},"content_sha256":"52bc0ca1abdc3940887e867fcc933476ea3942d8443357a2448417b5de649357","schema_version":"1.0","event_id":"sha256:52bc0ca1abdc3940887e867fcc933476ea3942d8443357a2448417b5de649357"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DYSWEBHLL3YTPGS6CWZTDVVBXF/bundle.json","state_url":"https://pith.science/pith/DYSWEBHLL3YTPGS6CWZTDVVBXF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DYSWEBHLL3YTPGS6CWZTDVVBXF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T07:49:13Z","links":{"resolver":"https://pith.science/pith/DYSWEBHLL3YTPGS6CWZTDVVBXF","bundle":"https://pith.science/pith/DYSWEBHLL3YTPGS6CWZTDVVBXF/bundle.json","state":"https://pith.science/pith/DYSWEBHLL3YTPGS6CWZTDVVBXF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DYSWEBHLL3YTPGS6CWZTDVVBXF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:DYSWEBHLL3YTPGS6CWZTDVVBXF","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":"abf88318753766279e9a3230ae24b343d3b2ddd952a4e2e15b418296f23fe146","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-14T13:55:38Z","title_canon_sha256":"36b90fc1b67c9ccbc10bc283f158551f6038dbe299c81d9f8860872b73edb9b9"},"schema_version":"1.0","source":{"id":"1001.2464","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.2464","created_at":"2026-05-18T01:04:59Z"},{"alias_kind":"arxiv_version","alias_value":"1001.2464v1","created_at":"2026-05-18T01:04:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.2464","created_at":"2026-05-18T01:04:59Z"},{"alias_kind":"pith_short_12","alias_value":"DYSWEBHLL3YT","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DYSWEBHLL3YTPGS6","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DYSWEBHL","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:52bc0ca1abdc3940887e867fcc933476ea3942d8443357a2448417b5de649357","target":"graph","created_at":"2026-05-18T01:04:59Z","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":"We find the capacity region of linear finite-field deterministic networks with many sources and one destination. Nodes in the network are subject to interference and broadcast constraints, specified by the linear finite-field deterministic model. Each node can inject its own information as well as relay other nodes' information. We show that the capacity region coincides with the cut-set region. Also, for a specific case of correlated sources we provide necessary and sufficient conditions for the sources transmissibility. Given the \"deterministic model\" approximation for the corresponding Gaus","authors_text":"Giuseppe Caire, M. Majid Butt, Ralf R. M\\\"uller","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-14T13:55:38Z","title":"Linear Finite-Field Deterministic Networks With Many Sources and One Destination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.2464","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:df9d2fa5fda2727e9b2e8ba4d94242b5f2b71de06b4d9ae2cab683e8903669cb","target":"record","created_at":"2026-05-18T01:04:59Z","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":"abf88318753766279e9a3230ae24b343d3b2ddd952a4e2e15b418296f23fe146","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-14T13:55:38Z","title_canon_sha256":"36b90fc1b67c9ccbc10bc283f158551f6038dbe299c81d9f8860872b73edb9b9"},"schema_version":"1.0","source":{"id":"1001.2464","kind":"arxiv","version":1}},"canonical_sha256":"1e256204eb5ef1379a5e15b331d6a1b97d97b1a3d12ac44d8d748955a968d011","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e256204eb5ef1379a5e15b331d6a1b97d97b1a3d12ac44d8d748955a968d011","first_computed_at":"2026-05-18T01:04:59.110078Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:59.110078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CETvCvFKI4FbUFZuIqNZT8RXDNq5gSJcQozGTmjLFR1SsneyCxD3wn4WIIucbRFJjpfhlstIyphMC0rDN9fxDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:59.110617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.2464","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df9d2fa5fda2727e9b2e8ba4d94242b5f2b71de06b4d9ae2cab683e8903669cb","sha256:52bc0ca1abdc3940887e867fcc933476ea3942d8443357a2448417b5de649357"],"state_sha256":"0b9f84139b30bef907e7f8cde791c73a3cdc0e7f5b511781c0766e67e65c0ce9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TMOS9K+bDE3HSVrMQrYQnAmFUVTEOmXvQGv1seWRMvbrebqObO1q/zEUwyIF7ktHj4SgNuJoSo3LOUqRcYFmCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:49:13.473984Z","bundle_sha256":"3ac2609d59be861832972f64c9bf8afcdd0bfec650182436dc579cc8f773e168"}}