{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CTYHOHBWFZKSGXOZEWUWP2SIUK","short_pith_number":"pith:CTYHOHBW","canonical_record":{"source":{"id":"1305.0503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-02T16:40:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"916e460f6ad60bd475bef541d797ee52d079bc9311c37b672445601f73c3c395","abstract_canon_sha256":"95fa081719353d8d0a076376b8cf1f4ebec069300c35912206635d5a0ae57956"},"schema_version":"1.0"},"canonical_sha256":"14f0771c362e55235dd925a967ea48a284fe398b0cbe33fd7d9f6b0c3d545261","source":{"kind":"arxiv","id":"1305.0503","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0503","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0503v1","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0503","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"CTYHOHBWFZKS","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CTYHOHBWFZKSGXOZ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CTYHOHBW","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CTYHOHBWFZKSGXOZEWUWP2SIUK","target":"record","payload":{"canonical_record":{"source":{"id":"1305.0503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-02T16:40:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"916e460f6ad60bd475bef541d797ee52d079bc9311c37b672445601f73c3c395","abstract_canon_sha256":"95fa081719353d8d0a076376b8cf1f4ebec069300c35912206635d5a0ae57956"},"schema_version":"1.0"},"canonical_sha256":"14f0771c362e55235dd925a967ea48a284fe398b0cbe33fd7d9f6b0c3d545261","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:40.048457Z","signature_b64":"E9TNjwZ7BnutMEAj3YP2tsQLU1+wg/VuDqU0pTHJaLaq90QUBM2pAtwHMN/uwcfcWhKHAnqXayO9alp6fY9fBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14f0771c362e55235dd925a967ea48a284fe398b0cbe33fd7d9f6b0c3d545261","last_reissued_at":"2026-05-18T03:26:40.047813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:40.047813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.0503","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-18T03:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f9G+jPU4LI789MMbHAbB//arvLCar2/TYFG2FFU37n2F8ypVcVY2Y2UJg9UcFUgIImEHGy9vfM60qjiS3yCBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T15:28:16.594664Z"},"content_sha256":"64649ddb8ecacb4ed98babb1f4b3bd440993a116527b6398ff20548fce4e0570","schema_version":"1.0","event_id":"sha256:64649ddb8ecacb4ed98babb1f4b3bd440993a116527b6398ff20548fce4e0570"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CTYHOHBWFZKSGXOZEWUWP2SIUK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph-Theoretic Characterization of The Feasibility of The Precoding-Based 3-Unicast Interference Alignment Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chih-Chun Wang, Jaemin Han, Ness B. Shroff","submitted_at":"2013-05-02T16:40:27Z","abstract_excerpt":"A new precoding-based intersession network coding (NC) scheme has recently been proposed, which applies the interference alignment technique, originally devised for wireless interference channels, to the 3-unicast problem of directed acyclic networks. The main result of this work is a graph-theoretic characterization of the feasibility of the 3-unicast interference alignment scheme. To that end, we first investigate several key relationships between the point-to-point network channel gains and the underlying graph structure. Such relationships turn out to be critical when characterizing graph-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0503","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-18T03:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AaWlP2QpQILqpuP415AqBDEMK+JClL6gSwZGWCbV/n83RpQJOdqggd/LL2meQTzCSx0ZqcG+IWA4yZDcpG0pDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T15:28:16.595124Z"},"content_sha256":"a2a9a50e212a7f08cee21862861c479ad279f1d067e5d73a8faa30926ac7348a","schema_version":"1.0","event_id":"sha256:a2a9a50e212a7f08cee21862861c479ad279f1d067e5d73a8faa30926ac7348a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CTYHOHBWFZKSGXOZEWUWP2SIUK/bundle.json","state_url":"https://pith.science/pith/CTYHOHBWFZKSGXOZEWUWP2SIUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CTYHOHBWFZKSGXOZEWUWP2SIUK/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-23T15:28:16Z","links":{"resolver":"https://pith.science/pith/CTYHOHBWFZKSGXOZEWUWP2SIUK","bundle":"https://pith.science/pith/CTYHOHBWFZKSGXOZEWUWP2SIUK/bundle.json","state":"https://pith.science/pith/CTYHOHBWFZKSGXOZEWUWP2SIUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CTYHOHBWFZKSGXOZEWUWP2SIUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CTYHOHBWFZKSGXOZEWUWP2SIUK","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":"95fa081719353d8d0a076376b8cf1f4ebec069300c35912206635d5a0ae57956","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-02T16:40:27Z","title_canon_sha256":"916e460f6ad60bd475bef541d797ee52d079bc9311c37b672445601f73c3c395"},"schema_version":"1.0","source":{"id":"1305.0503","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0503","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0503v1","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0503","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"CTYHOHBWFZKS","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CTYHOHBWFZKSGXOZ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CTYHOHBW","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:a2a9a50e212a7f08cee21862861c479ad279f1d067e5d73a8faa30926ac7348a","target":"graph","created_at":"2026-05-18T03:26:40Z","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":"A new precoding-based intersession network coding (NC) scheme has recently been proposed, which applies the interference alignment technique, originally devised for wireless interference channels, to the 3-unicast problem of directed acyclic networks. The main result of this work is a graph-theoretic characterization of the feasibility of the 3-unicast interference alignment scheme. To that end, we first investigate several key relationships between the point-to-point network channel gains and the underlying graph structure. Such relationships turn out to be critical when characterizing graph-","authors_text":"Chih-Chun Wang, Jaemin Han, Ness B. Shroff","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-02T16:40:27Z","title":"Graph-Theoretic Characterization of The Feasibility of The Precoding-Based 3-Unicast Interference Alignment Scheme"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0503","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:64649ddb8ecacb4ed98babb1f4b3bd440993a116527b6398ff20548fce4e0570","target":"record","created_at":"2026-05-18T03:26:40Z","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":"95fa081719353d8d0a076376b8cf1f4ebec069300c35912206635d5a0ae57956","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-02T16:40:27Z","title_canon_sha256":"916e460f6ad60bd475bef541d797ee52d079bc9311c37b672445601f73c3c395"},"schema_version":"1.0","source":{"id":"1305.0503","kind":"arxiv","version":1}},"canonical_sha256":"14f0771c362e55235dd925a967ea48a284fe398b0cbe33fd7d9f6b0c3d545261","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14f0771c362e55235dd925a967ea48a284fe398b0cbe33fd7d9f6b0c3d545261","first_computed_at":"2026-05-18T03:26:40.047813Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:40.047813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E9TNjwZ7BnutMEAj3YP2tsQLU1+wg/VuDqU0pTHJaLaq90QUBM2pAtwHMN/uwcfcWhKHAnqXayO9alp6fY9fBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:40.048457Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0503","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64649ddb8ecacb4ed98babb1f4b3bd440993a116527b6398ff20548fce4e0570","sha256:a2a9a50e212a7f08cee21862861c479ad279f1d067e5d73a8faa30926ac7348a"],"state_sha256":"e8c6ef22e83bef9dc9776133083c365c1409374777786d88e116fa875352511e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dnAyZ9eBvdKeW5nqP8G87K8a7HWhwxHwqYxLfJVRzNuVamah2tbF8hbFm6YwGgkv/O93JGGz8mcWZtQTmvtBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T15:28:16.601640Z","bundle_sha256":"07aa8a08303a563e183a0b22a8b8f1ef31f22000144d15e7b7f2ae26c363a233"}}