{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:HERJ3CIIJ2ILTMMLN7KQAYYLW2","short_pith_number":"pith:HERJ3CII","canonical_record":{"source":{"id":"1001.4431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-25T14:00:16Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"1a481206f915e66eedf5e35ff6d5658bf0ed586eb7632e5cf051f9b6e57277b4","abstract_canon_sha256":"2f8659d1c11c1ea505fcb7bc1b03312675957c6c8f2b56077a4717074f5515f5"},"schema_version":"1.0"},"canonical_sha256":"39229d89084e90b9b18b6fd500630bb69e3c446560581e864864e5a9b0062fcf","source":{"kind":"arxiv","id":"1001.4431","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.4431","created_at":"2026-07-04T17:30:29Z"},{"alias_kind":"arxiv_version","alias_value":"1001.4431v2","created_at":"2026-07-04T17:30:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.4431","created_at":"2026-07-04T17:30:29Z"},{"alias_kind":"pith_short_12","alias_value":"HERJ3CIIJ2IL","created_at":"2026-07-04T17:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"HERJ3CIIJ2ILTMML","created_at":"2026-07-04T17:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"HERJ3CII","created_at":"2026-07-04T17:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:HERJ3CIIJ2ILTMMLN7KQAYYLW2","target":"record","payload":{"canonical_record":{"source":{"id":"1001.4431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-25T14:00:16Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"1a481206f915e66eedf5e35ff6d5658bf0ed586eb7632e5cf051f9b6e57277b4","abstract_canon_sha256":"2f8659d1c11c1ea505fcb7bc1b03312675957c6c8f2b56077a4717074f5515f5"},"schema_version":"1.0"},"canonical_sha256":"39229d89084e90b9b18b6fd500630bb69e3c446560581e864864e5a9b0062fcf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:30:29.239049Z","signature_b64":"qKzNbrbfcizcLCZfJHzuLlNXty2gdXxjbDB8fQ4bYUcQtqrqFM7PQaM+yarMBzFvdTyC9uZWQbZ6WVIjdVRSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39229d89084e90b9b18b6fd500630bb69e3c446560581e864864e5a9b0062fcf","last_reissued_at":"2026-07-04T17:30:29.238609Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:30:29.238609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.4431","source_version":2,"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-07-04T17:30:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uPQpSvoUJWFMs4KX1y9l1yDSW7s6JE6j2JkpeoD3EViUR/vVppTg9cG8EYMAnpQ1OlSgnI6GbJ3X6IhyZCQmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:32:22.624509Z"},"content_sha256":"dde83238bcf3f89d6f02c66bbdf8b4528a43f4cf2be12b5f20f819a47a2bf49d","schema_version":"1.0","event_id":"sha256:dde83238bcf3f89d6f02c66bbdf8b4528a43f4cf2be12b5f20f819a47a2bf49d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:HERJ3CIIJ2ILTMMLN7KQAYYLW2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algebraic Network Coding Approach to Deterministic Wireless Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"MinJi Kim, Muriel Medard","submitted_at":"2010-01-25T14:00:16Z","abstract_excerpt":"The deterministic wireless relay network model, introduced by Avestimehr et al., has been proposed for approximating Gaussian relay networks. This model, known as the ADT network model, takes into account the broadcast nature of wireless medium and interference. Avestimehr et al. showed that the Min-cut Max-flow theorem holds in the ADT network.\n  In this paper, 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, called the \"system matrix\". W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.4431","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1001.4431/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T17:30:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ni9T8LyqOsIhAw6rdv9/omgu1smhRNKjukishYJBwNg9yrcTdFeaP7UkDHYw99hONsn8RPb3iClprHOEQb6rAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:32:22.625005Z"},"content_sha256":"ff4cfe3eec039dad4c5d594b80825207152ac4d6fcd2e75e0ef1223f050a64aa","schema_version":"1.0","event_id":"sha256:ff4cfe3eec039dad4c5d594b80825207152ac4d6fcd2e75e0ef1223f050a64aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HERJ3CIIJ2ILTMMLN7KQAYYLW2/bundle.json","state_url":"https://pith.science/pith/HERJ3CIIJ2ILTMMLN7KQAYYLW2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HERJ3CIIJ2ILTMMLN7KQAYYLW2/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-08-05T23:32:22Z","links":{"resolver":"https://pith.science/pith/HERJ3CIIJ2ILTMMLN7KQAYYLW2","bundle":"https://pith.science/pith/HERJ3CIIJ2ILTMMLN7KQAYYLW2/bundle.json","state":"https://pith.science/pith/HERJ3CIIJ2ILTMMLN7KQAYYLW2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HERJ3CIIJ2ILTMMLN7KQAYYLW2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:HERJ3CIIJ2ILTMMLN7KQAYYLW2","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":"2f8659d1c11c1ea505fcb7bc1b03312675957c6c8f2b56077a4717074f5515f5","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-25T14:00:16Z","title_canon_sha256":"1a481206f915e66eedf5e35ff6d5658bf0ed586eb7632e5cf051f9b6e57277b4"},"schema_version":"1.0","source":{"id":"1001.4431","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.4431","created_at":"2026-07-04T17:30:29Z"},{"alias_kind":"arxiv_version","alias_value":"1001.4431v2","created_at":"2026-07-04T17:30:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.4431","created_at":"2026-07-04T17:30:29Z"},{"alias_kind":"pith_short_12","alias_value":"HERJ3CIIJ2IL","created_at":"2026-07-04T17:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"HERJ3CIIJ2ILTMML","created_at":"2026-07-04T17:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"HERJ3CII","created_at":"2026-07-04T17:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:ff4cfe3eec039dad4c5d594b80825207152ac4d6fcd2e75e0ef1223f050a64aa","target":"graph","created_at":"2026-07-04T17:30:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1001.4431/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The deterministic wireless relay network model, introduced by Avestimehr et al., has been proposed for approximating Gaussian relay networks. This model, known as the ADT network model, takes into account the broadcast nature of wireless medium and interference. Avestimehr et al. showed that the Min-cut Max-flow theorem holds in the ADT network.\n  In this paper, 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, called the \"system matrix\". W","authors_text":"MinJi Kim, Muriel Medard","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-25T14:00:16Z","title":"Algebraic Network Coding Approach to Deterministic Wireless Relay Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.4431","kind":"arxiv","version":2},"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:dde83238bcf3f89d6f02c66bbdf8b4528a43f4cf2be12b5f20f819a47a2bf49d","target":"record","created_at":"2026-07-04T17:30:29Z","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":"2f8659d1c11c1ea505fcb7bc1b03312675957c6c8f2b56077a4717074f5515f5","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-25T14:00:16Z","title_canon_sha256":"1a481206f915e66eedf5e35ff6d5658bf0ed586eb7632e5cf051f9b6e57277b4"},"schema_version":"1.0","source":{"id":"1001.4431","kind":"arxiv","version":2}},"canonical_sha256":"39229d89084e90b9b18b6fd500630bb69e3c446560581e864864e5a9b0062fcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39229d89084e90b9b18b6fd500630bb69e3c446560581e864864e5a9b0062fcf","first_computed_at":"2026-07-04T17:30:29.238609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T17:30:29.238609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qKzNbrbfcizcLCZfJHzuLlNXty2gdXxjbDB8fQ4bYUcQtqrqFM7PQaM+yarMBzFvdTyC9uZWQbZ6WVIjdVRSBQ==","signature_status":"signed_v1","signed_at":"2026-07-04T17:30:29.239049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.4431","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dde83238bcf3f89d6f02c66bbdf8b4528a43f4cf2be12b5f20f819a47a2bf49d","sha256:ff4cfe3eec039dad4c5d594b80825207152ac4d6fcd2e75e0ef1223f050a64aa"],"state_sha256":"67ec6a5266a6745fe891d0863869c348e53356513c7da35176e3c991efa9d425"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uSiIbt9dRiQNbQqiLHYtSL0DOCbP0Cx0fH8RH8lTe3pzRo2l0ULLlkc337cDl01pEkU82LTCWKtjCFsCE/3wDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T23:32:22.628489Z","bundle_sha256":"2b8bfcf1af7d568c111ba302a2b0137f40a5484ba2bba8be75c7fbc5e348071c"}}