{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AQ4SU74JL2IP4KLQ67JNAMX2ZP","short_pith_number":"pith:AQ4SU74J","canonical_record":{"source":{"id":"1512.00824","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-02T19:56:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b54cacb0f4a40f145dcb2edb096d4b573c4b517dca364431eb4fb4fbc1fdb208","abstract_canon_sha256":"1322782f4a9f487397b3c5d6c4cd7017f0b1cfea39b690b7dffb23e5292c6201"},"schema_version":"1.0"},"canonical_sha256":"04392a7f895e90fe2970f7d2d032facbf9323eb6f5f68f31f480e5c4f9801fa4","source":{"kind":"arxiv","id":"1512.00824","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00824","created_at":"2026-05-18T01:23:07Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00824v2","created_at":"2026-05-18T01:23:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00824","created_at":"2026-05-18T01:23:07Z"},{"alias_kind":"pith_short_12","alias_value":"AQ4SU74JL2IP","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AQ4SU74JL2IP4KLQ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AQ4SU74J","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AQ4SU74JL2IP4KLQ67JNAMX2ZP","target":"record","payload":{"canonical_record":{"source":{"id":"1512.00824","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-02T19:56:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b54cacb0f4a40f145dcb2edb096d4b573c4b517dca364431eb4fb4fbc1fdb208","abstract_canon_sha256":"1322782f4a9f487397b3c5d6c4cd7017f0b1cfea39b690b7dffb23e5292c6201"},"schema_version":"1.0"},"canonical_sha256":"04392a7f895e90fe2970f7d2d032facbf9323eb6f5f68f31f480e5c4f9801fa4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:07.752457Z","signature_b64":"DjA0HxM132NwZOL0iz5yaCdEOgIfRaryMf66K5FmK7CHhn4rDFhUW7HyqCuIqRUfToKsPCo77mKBgsZWGSB2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04392a7f895e90fe2970f7d2d032facbf9323eb6f5f68f31f480e5c4f9801fa4","last_reissued_at":"2026-05-18T01:23:07.751810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:07.751810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.00824","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-05-18T01:23:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zxyUsR86G//TUCV78bozsA/abh3NKBeN5jHZ15KB4my4j9aS0JdzKnS3IKMvvBNkTmdfoBDG3VMwy6nAveuaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T20:29:25.160638Z"},"content_sha256":"f171a5e40c9d3dd78df12e835f47480906c2931333d01f837e1d0e9981520c07","schema_version":"1.0","event_id":"sha256:f171a5e40c9d3dd78df12e835f47480906c2931333d01f837e1d0e9981520c07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AQ4SU74JL2IP4KLQ67JNAMX2ZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equal-image-size source partitioning: Creating strong Fano's inequalities for multi-terminal discrete memoryless channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eric Graves, Tan F. Wong","submitted_at":"2015-12-02T19:56:18Z","abstract_excerpt":"This paper introduces equal-image-size source partitioning, a new tool for analyzing channel and joint source-channel coding in a multi-terminal discrete memoryless channel environment. Equal-image-size source partitioning divides the source (combination of messages and codewords) into a sub-exponential number of subsets. Over each of these subsets, the exponential orders of the minimum image sizes of most messages are roughly equal to the same entropy term. This property gives us the strength of minimum image sizes and the flexibility of entropy terms. Using the method of equal-image-size sou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00824","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"},"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:23:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DrkmVlShH2hAGJYAuastXEdHuE4YKJ+d5uMoAYVKEL21e1Ip5PbCCgv+T1Sa90mDVRRn8LNoHUEUoUlVZpXHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T20:29:25.160979Z"},"content_sha256":"0620bf30c0f1ba12c5fee52c97f2ec35c2e158458968cdd18c6243f097b387f2","schema_version":"1.0","event_id":"sha256:0620bf30c0f1ba12c5fee52c97f2ec35c2e158458968cdd18c6243f097b387f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AQ4SU74JL2IP4KLQ67JNAMX2ZP/bundle.json","state_url":"https://pith.science/pith/AQ4SU74JL2IP4KLQ67JNAMX2ZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AQ4SU74JL2IP4KLQ67JNAMX2ZP/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-20T20:29:25Z","links":{"resolver":"https://pith.science/pith/AQ4SU74JL2IP4KLQ67JNAMX2ZP","bundle":"https://pith.science/pith/AQ4SU74JL2IP4KLQ67JNAMX2ZP/bundle.json","state":"https://pith.science/pith/AQ4SU74JL2IP4KLQ67JNAMX2ZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AQ4SU74JL2IP4KLQ67JNAMX2ZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AQ4SU74JL2IP4KLQ67JNAMX2ZP","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":"1322782f4a9f487397b3c5d6c4cd7017f0b1cfea39b690b7dffb23e5292c6201","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-02T19:56:18Z","title_canon_sha256":"b54cacb0f4a40f145dcb2edb096d4b573c4b517dca364431eb4fb4fbc1fdb208"},"schema_version":"1.0","source":{"id":"1512.00824","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00824","created_at":"2026-05-18T01:23:07Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00824v2","created_at":"2026-05-18T01:23:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00824","created_at":"2026-05-18T01:23:07Z"},{"alias_kind":"pith_short_12","alias_value":"AQ4SU74JL2IP","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AQ4SU74JL2IP4KLQ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AQ4SU74J","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:0620bf30c0f1ba12c5fee52c97f2ec35c2e158458968cdd18c6243f097b387f2","target":"graph","created_at":"2026-05-18T01:23:07Z","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":"This paper introduces equal-image-size source partitioning, a new tool for analyzing channel and joint source-channel coding in a multi-terminal discrete memoryless channel environment. Equal-image-size source partitioning divides the source (combination of messages and codewords) into a sub-exponential number of subsets. Over each of these subsets, the exponential orders of the minimum image sizes of most messages are roughly equal to the same entropy term. This property gives us the strength of minimum image sizes and the flexibility of entropy terms. Using the method of equal-image-size sou","authors_text":"Eric Graves, Tan F. Wong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-02T19:56:18Z","title":"Equal-image-size source partitioning: Creating strong Fano's inequalities for multi-terminal discrete memoryless channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00824","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:f171a5e40c9d3dd78df12e835f47480906c2931333d01f837e1d0e9981520c07","target":"record","created_at":"2026-05-18T01:23:07Z","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":"1322782f4a9f487397b3c5d6c4cd7017f0b1cfea39b690b7dffb23e5292c6201","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-02T19:56:18Z","title_canon_sha256":"b54cacb0f4a40f145dcb2edb096d4b573c4b517dca364431eb4fb4fbc1fdb208"},"schema_version":"1.0","source":{"id":"1512.00824","kind":"arxiv","version":2}},"canonical_sha256":"04392a7f895e90fe2970f7d2d032facbf9323eb6f5f68f31f480e5c4f9801fa4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04392a7f895e90fe2970f7d2d032facbf9323eb6f5f68f31f480e5c4f9801fa4","first_computed_at":"2026-05-18T01:23:07.751810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:07.751810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DjA0HxM132NwZOL0iz5yaCdEOgIfRaryMf66K5FmK7CHhn4rDFhUW7HyqCuIqRUfToKsPCo77mKBgsZWGSB2BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:07.752457Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.00824","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f171a5e40c9d3dd78df12e835f47480906c2931333d01f837e1d0e9981520c07","sha256:0620bf30c0f1ba12c5fee52c97f2ec35c2e158458968cdd18c6243f097b387f2"],"state_sha256":"8b14afee04c30cb0c53bf6ec97939942bcb40efc3738e39a74e07f0d134bc88e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TFjH8ew7LNe3qOhoWzRIwGNg7srCJpSAALeIqhwhHyDnAouwP1Wr3YScTSAqK2zF1E5DT5U6O/js890rr/8SDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T20:29:25.162879Z","bundle_sha256":"dfd6ad319a16b837d59dd55921b3283a976818008c3ddf09ede4f83fb54d212c"}}