{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HJAXDBTNR5L4D572H4PEEWIFSP","short_pith_number":"pith:HJAXDBTN","canonical_record":{"source":{"id":"1305.2548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-12T00:31:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d98fb295100f7ee10fd00c6dfbece22fb96a29be4c7a34453813e08c66e37049","abstract_canon_sha256":"f8ff2b9580dc6e0d4cb82d52ab000054b896e15be1e46cc69f72c0889099a279"},"schema_version":"1.0"},"canonical_sha256":"3a4171866d8f57c1f7fa3f1e42590593fb8129f87854ccaf813b697de05b1f45","source":{"kind":"arxiv","id":"1305.2548","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2548","created_at":"2026-05-18T03:25:57Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2548v1","created_at":"2026-05-18T03:25:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2548","created_at":"2026-05-18T03:25:57Z"},{"alias_kind":"pith_short_12","alias_value":"HJAXDBTNR5L4","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HJAXDBTNR5L4D572","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HJAXDBTN","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HJAXDBTNR5L4D572H4PEEWIFSP","target":"record","payload":{"canonical_record":{"source":{"id":"1305.2548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-12T00:31:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d98fb295100f7ee10fd00c6dfbece22fb96a29be4c7a34453813e08c66e37049","abstract_canon_sha256":"f8ff2b9580dc6e0d4cb82d52ab000054b896e15be1e46cc69f72c0889099a279"},"schema_version":"1.0"},"canonical_sha256":"3a4171866d8f57c1f7fa3f1e42590593fb8129f87854ccaf813b697de05b1f45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:57.562668Z","signature_b64":"aslDFx1HlwZcMcq1uNOjPMcgVmeKrCfxiw5+JWoAKOusXf4D11qU/cRcDqsww1Ncc/Vyysm7K2v2jGzYCr3tAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a4171866d8f57c1f7fa3f1e42590593fb8129f87854ccaf813b697de05b1f45","last_reissued_at":"2026-05-18T03:25:57.562001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:57.562001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.2548","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:25:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m1JAB1HeIYfIserzWEztoUXDnMGS6c8Mrui2VI+CQCgprTwgk2cE5/XE2bgq6loENd6t3dcrb/yjleRKbwpLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T13:27:57.266840Z"},"content_sha256":"0481f362296f54b54e816d4c4e68272715e833e9c5b374cc1b9785a0cdff4761","schema_version":"1.0","event_id":"sha256:0481f362296f54b54e816d4c4e68272715e833e9c5b374cc1b9785a0cdff4761"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HJAXDBTNR5L4D572H4PEEWIFSP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Min-Cut Algorithms for Half-Duplex Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Salman Avestimehr, Farzad Parvaresh, Ilan Shomorony, Ra\\'ul Etkin","submitted_at":"2013-05-12T00:31:55Z","abstract_excerpt":"Computing the cut-set bound in half-duplex relay networks is a challenging optimization problem, since it requires finding the cut-set optimal half-duplex schedule. This subproblem in general involves an exponential number of variables, since the number of ways to assign each node to either transmitter or receiver mode is exponential in the number of nodes. We present a general technique that takes advantage of specific structures in the topology of a given network and allows us to reduce the complexity of computing the half-duplex schedule that maximizes the cut-set bound (with i.i.d. input d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2548","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:25:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CjLlEHBUoLLHnLmsXZwjeZo53v/3ujMlrJOhO8XpwB22PYZhkr5fnpX0ZxylZpx4n3/kilQDWJbZFVVfKsvYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T13:27:57.267239Z"},"content_sha256":"e248f386cc447f316029044200b2c6462eac709e3b7c6f342cf793d582cf5e14","schema_version":"1.0","event_id":"sha256:e248f386cc447f316029044200b2c6462eac709e3b7c6f342cf793d582cf5e14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJAXDBTNR5L4D572H4PEEWIFSP/bundle.json","state_url":"https://pith.science/pith/HJAXDBTNR5L4D572H4PEEWIFSP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJAXDBTNR5L4D572H4PEEWIFSP/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-24T13:27:57Z","links":{"resolver":"https://pith.science/pith/HJAXDBTNR5L4D572H4PEEWIFSP","bundle":"https://pith.science/pith/HJAXDBTNR5L4D572H4PEEWIFSP/bundle.json","state":"https://pith.science/pith/HJAXDBTNR5L4D572H4PEEWIFSP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJAXDBTNR5L4D572H4PEEWIFSP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HJAXDBTNR5L4D572H4PEEWIFSP","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":"f8ff2b9580dc6e0d4cb82d52ab000054b896e15be1e46cc69f72c0889099a279","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-12T00:31:55Z","title_canon_sha256":"d98fb295100f7ee10fd00c6dfbece22fb96a29be4c7a34453813e08c66e37049"},"schema_version":"1.0","source":{"id":"1305.2548","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2548","created_at":"2026-05-18T03:25:57Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2548v1","created_at":"2026-05-18T03:25:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2548","created_at":"2026-05-18T03:25:57Z"},{"alias_kind":"pith_short_12","alias_value":"HJAXDBTNR5L4","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HJAXDBTNR5L4D572","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HJAXDBTN","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:e248f386cc447f316029044200b2c6462eac709e3b7c6f342cf793d582cf5e14","target":"graph","created_at":"2026-05-18T03:25:57Z","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":"Computing the cut-set bound in half-duplex relay networks is a challenging optimization problem, since it requires finding the cut-set optimal half-duplex schedule. This subproblem in general involves an exponential number of variables, since the number of ways to assign each node to either transmitter or receiver mode is exponential in the number of nodes. We present a general technique that takes advantage of specific structures in the topology of a given network and allows us to reduce the complexity of computing the half-duplex schedule that maximizes the cut-set bound (with i.i.d. input d","authors_text":"A. Salman Avestimehr, Farzad Parvaresh, Ilan Shomorony, Ra\\'ul Etkin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-12T00:31:55Z","title":"On Min-Cut Algorithms for Half-Duplex Relay Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2548","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:0481f362296f54b54e816d4c4e68272715e833e9c5b374cc1b9785a0cdff4761","target":"record","created_at":"2026-05-18T03:25:57Z","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":"f8ff2b9580dc6e0d4cb82d52ab000054b896e15be1e46cc69f72c0889099a279","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-12T00:31:55Z","title_canon_sha256":"d98fb295100f7ee10fd00c6dfbece22fb96a29be4c7a34453813e08c66e37049"},"schema_version":"1.0","source":{"id":"1305.2548","kind":"arxiv","version":1}},"canonical_sha256":"3a4171866d8f57c1f7fa3f1e42590593fb8129f87854ccaf813b697de05b1f45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a4171866d8f57c1f7fa3f1e42590593fb8129f87854ccaf813b697de05b1f45","first_computed_at":"2026-05-18T03:25:57.562001Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:57.562001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aslDFx1HlwZcMcq1uNOjPMcgVmeKrCfxiw5+JWoAKOusXf4D11qU/cRcDqsww1Ncc/Vyysm7K2v2jGzYCr3tAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:57.562668Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.2548","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0481f362296f54b54e816d4c4e68272715e833e9c5b374cc1b9785a0cdff4761","sha256:e248f386cc447f316029044200b2c6462eac709e3b7c6f342cf793d582cf5e14"],"state_sha256":"7cbf4793f23ffd8b93039a23683a7b127079919d2bf8709821055efa2cd93c46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sQuMoSDOBuVxtqxFKeNUB8J0i+/gvfdGV6WAwj/EaleB3KSWbsGbhkvT8niozXsCLTGaoLrqx9ND5ScCvAXvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T13:27:57.270742Z","bundle_sha256":"6d7e449b55ff8adfbb4879ca4f86a2d6013330f57ed0e612e6caddce8b6a4af3"}}