{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YVNFSFDE5DS6ISSQJASEZCIUSF","short_pith_number":"pith:YVNFSFDE","schema_version":"1.0","canonical_sha256":"c55a591464e8e5e44a5048244c89149151facdc841f23deacb6135e3727110d1","source":{"kind":"arxiv","id":"1704.02262","version":2},"attestation_state":"computed","paper":{"title":"A Converse Bound on Wyner-Ahlswede-K\\\"orner Network via Gray-Wyner Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shun Watanabe","submitted_at":"2017-04-07T15:26:38Z","abstract_excerpt":"We show a reduction method to construct a code for the Gray-Wyner (GW) network from a given code for the Wyner-Ahlswede-K\\\"orner (WAK) network. By combining this reduction with a converse bound on the GW network, we derive a converse bound on the WAK network. The derived bound gives an alternative proof of the strong converse theorem for the WAK network."},"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":"1704.02262","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-07T15:26:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"16b0f0534394763527834335a90c3c506cf5725b118761a12c22c31f6a2b0242","abstract_canon_sha256":"9530e8512d95e3eb6a5b49abb8769509ef04e63c69a6d281f833f9c0ada0d646"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:08.770256Z","signature_b64":"6osdQhxlIpSrAD9HJCPZ3AlI/EuxxHDdGMBZJfap/vFgpYOw5A0aNZDmkNSL8OxEahmTgzmOr6AWLp+Y34b2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c55a591464e8e5e44a5048244c89149151facdc841f23deacb6135e3727110d1","last_reissued_at":"2026-05-18T00:38:08.769561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:08.769561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Converse Bound on Wyner-Ahlswede-K\\\"orner Network via Gray-Wyner Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shun Watanabe","submitted_at":"2017-04-07T15:26:38Z","abstract_excerpt":"We show a reduction method to construct a code for the Gray-Wyner (GW) network from a given code for the Wyner-Ahlswede-K\\\"orner (WAK) network. By combining this reduction with a converse bound on the GW network, we derive a converse bound on the WAK network. The derived bound gives an alternative proof of the strong converse theorem for the WAK network."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02262","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":"1704.02262","created_at":"2026-05-18T00:38:08.769649+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02262v2","created_at":"2026-05-18T00:38:08.769649+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02262","created_at":"2026-05-18T00:38:08.769649+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVNFSFDE5DS6","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVNFSFDE5DS6ISSQ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVNFSFDE","created_at":"2026-05-18T12:31:56.362134+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/YVNFSFDE5DS6ISSQJASEZCIUSF","json":"https://pith.science/pith/YVNFSFDE5DS6ISSQJASEZCIUSF.json","graph_json":"https://pith.science/api/pith-number/YVNFSFDE5DS6ISSQJASEZCIUSF/graph.json","events_json":"https://pith.science/api/pith-number/YVNFSFDE5DS6ISSQJASEZCIUSF/events.json","paper":"https://pith.science/paper/YVNFSFDE"},"agent_actions":{"view_html":"https://pith.science/pith/YVNFSFDE5DS6ISSQJASEZCIUSF","download_json":"https://pith.science/pith/YVNFSFDE5DS6ISSQJASEZCIUSF.json","view_paper":"https://pith.science/paper/YVNFSFDE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02262&json=true","fetch_graph":"https://pith.science/api/pith-number/YVNFSFDE5DS6ISSQJASEZCIUSF/graph.json","fetch_events":"https://pith.science/api/pith-number/YVNFSFDE5DS6ISSQJASEZCIUSF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVNFSFDE5DS6ISSQJASEZCIUSF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVNFSFDE5DS6ISSQJASEZCIUSF/action/storage_attestation","attest_author":"https://pith.science/pith/YVNFSFDE5DS6ISSQJASEZCIUSF/action/author_attestation","sign_citation":"https://pith.science/pith/YVNFSFDE5DS6ISSQJASEZCIUSF/action/citation_signature","submit_replication":"https://pith.science/pith/YVNFSFDE5DS6ISSQJASEZCIUSF/action/replication_record"}},"created_at":"2026-05-18T00:38:08.769649+00:00","updated_at":"2026-05-18T00:38:08.769649+00:00"}