{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QDCWS7ZGKHG4RKUHANZPD3XURV","short_pith_number":"pith:QDCWS7ZG","canonical_record":{"source":{"id":"2607.28162","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-30T13:03:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fe76aa5f90ef883ef2254c48b98f6b43c75c4ad1e6eab53098a4e7bcdd9b52c7","abstract_canon_sha256":"c975a29222dcc5358a7f4d912fdb0a1830dfea67c3e9e9643218d8f62dd3ac05"},"schema_version":"1.0"},"canonical_sha256":"80c5697f2651cdc8aa870372f1eef48d579752091c2cd03cf6fb1cfc2c2b7533","source":{"kind":"arxiv","id":"2607.28162","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28162","created_at":"2026-07-31T01:36:05Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28162v1","created_at":"2026-07-31T01:36:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28162","created_at":"2026-07-31T01:36:05Z"},{"alias_kind":"pith_short_12","alias_value":"QDCWS7ZGKHG4","created_at":"2026-07-31T01:36:05Z"},{"alias_kind":"pith_short_16","alias_value":"QDCWS7ZGKHG4RKUH","created_at":"2026-07-31T01:36:05Z"},{"alias_kind":"pith_short_8","alias_value":"QDCWS7ZG","created_at":"2026-07-31T01:36:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QDCWS7ZGKHG4RKUHANZPD3XURV","target":"record","payload":{"canonical_record":{"source":{"id":"2607.28162","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-30T13:03:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fe76aa5f90ef883ef2254c48b98f6b43c75c4ad1e6eab53098a4e7bcdd9b52c7","abstract_canon_sha256":"c975a29222dcc5358a7f4d912fdb0a1830dfea67c3e9e9643218d8f62dd3ac05"},"schema_version":"1.0"},"canonical_sha256":"80c5697f2651cdc8aa870372f1eef48d579752091c2cd03cf6fb1cfc2c2b7533","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80c5697f2651cdc8aa870372f1eef48d579752091c2cd03cf6fb1cfc2c2b7533","last_reissued_at":"2026-07-31T01:36:05.672914Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:36:05.672914Z"},"source_kind":"arxiv","source_id":"2607.28162","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-07-31T01:36:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o6Psv3zq9jE8rP8QYwNjCpfngkSlWF4nQ6uG+ObVNvbKLGY7EfuBdci+QdBTllV6BfEgEhEQCsBluL6bI9W8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T03:34:49.812768Z"},"content_sha256":"9e70eb112b598791c1f229e9b7f02ae3a6db147b504ddc4b70ed0b77a5cbdb9d","schema_version":"1.0","event_id":"sha256:9e70eb112b598791c1f229e9b7f02ae3a6db147b504ddc4b70ed0b77a5cbdb9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QDCWS7ZGKHG4RKUHANZPD3XURV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On The Most Discriminative Boolean Functions for Correlated Sources","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Chen, Lei Yu, Shun Watanabe","submitted_at":"2026-07-30T13:03:16Z","abstract_excerpt":"Motivated by a conjecture of Amari and Kobayashi, we study the problem of identifying pairs of Boolean functions that maximize the Kullback-Leibler divergence between two distributions obtained by separately compressing two correlated sources. When the reference distribution corresponds to independent sources, this problem reduces to the problem of maximizing mutual information, for which the optimality of dictator functions has been proved by Pichler, Piantanida, and Matz. For the problem of maximizing Fisher information, which can be viewed as a local version of the problem studied in this p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28162","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.28162/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-31T01:36:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9lRQ18cmRzMSfPOM0yr6k319vA1BO52+/UDPRaQDxF+OFJNghgLxazknZjEmRGGjPUE/sU12tfcCGB/N56yJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T03:34:49.813555Z"},"content_sha256":"4b52472ac06e5b1e383e4a522332396b833603a90815f852df90a9891dda0eb6","schema_version":"1.0","event_id":"sha256:4b52472ac06e5b1e383e4a522332396b833603a90815f852df90a9891dda0eb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QDCWS7ZGKHG4RKUHANZPD3XURV/bundle.json","state_url":"https://pith.science/pith/QDCWS7ZGKHG4RKUHANZPD3XURV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QDCWS7ZGKHG4RKUHANZPD3XURV/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-04T03:34:49Z","links":{"resolver":"https://pith.science/pith/QDCWS7ZGKHG4RKUHANZPD3XURV","bundle":"https://pith.science/pith/QDCWS7ZGKHG4RKUHANZPD3XURV/bundle.json","state":"https://pith.science/pith/QDCWS7ZGKHG4RKUHANZPD3XURV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QDCWS7ZGKHG4RKUHANZPD3XURV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QDCWS7ZGKHG4RKUHANZPD3XURV","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":"c975a29222dcc5358a7f4d912fdb0a1830dfea67c3e9e9643218d8f62dd3ac05","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-30T13:03:16Z","title_canon_sha256":"fe76aa5f90ef883ef2254c48b98f6b43c75c4ad1e6eab53098a4e7bcdd9b52c7"},"schema_version":"1.0","source":{"id":"2607.28162","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28162","created_at":"2026-07-31T01:36:05Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28162v1","created_at":"2026-07-31T01:36:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28162","created_at":"2026-07-31T01:36:05Z"},{"alias_kind":"pith_short_12","alias_value":"QDCWS7ZGKHG4","created_at":"2026-07-31T01:36:05Z"},{"alias_kind":"pith_short_16","alias_value":"QDCWS7ZGKHG4RKUH","created_at":"2026-07-31T01:36:05Z"},{"alias_kind":"pith_short_8","alias_value":"QDCWS7ZG","created_at":"2026-07-31T01:36:05Z"}],"graph_snapshots":[{"event_id":"sha256:4b52472ac06e5b1e383e4a522332396b833603a90815f852df90a9891dda0eb6","target":"graph","created_at":"2026-07-31T01:36:05Z","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/2607.28162/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motivated by a conjecture of Amari and Kobayashi, we study the problem of identifying pairs of Boolean functions that maximize the Kullback-Leibler divergence between two distributions obtained by separately compressing two correlated sources. When the reference distribution corresponds to independent sources, this problem reduces to the problem of maximizing mutual information, for which the optimality of dictator functions has been proved by Pichler, Piantanida, and Matz. For the problem of maximizing Fisher information, which can be viewed as a local version of the problem studied in this p","authors_text":"Jun Chen, Lei Yu, Shun Watanabe","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-30T13:03:16Z","title":"On The Most Discriminative Boolean Functions for Correlated Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28162","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:9e70eb112b598791c1f229e9b7f02ae3a6db147b504ddc4b70ed0b77a5cbdb9d","target":"record","created_at":"2026-07-31T01:36:05Z","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":"c975a29222dcc5358a7f4d912fdb0a1830dfea67c3e9e9643218d8f62dd3ac05","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-30T13:03:16Z","title_canon_sha256":"fe76aa5f90ef883ef2254c48b98f6b43c75c4ad1e6eab53098a4e7bcdd9b52c7"},"schema_version":"1.0","source":{"id":"2607.28162","kind":"arxiv","version":1}},"canonical_sha256":"80c5697f2651cdc8aa870372f1eef48d579752091c2cd03cf6fb1cfc2c2b7533","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80c5697f2651cdc8aa870372f1eef48d579752091c2cd03cf6fb1cfc2c2b7533","first_computed_at":"2026-07-31T01:36:05.672914Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:36:05.672914Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.28162","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e70eb112b598791c1f229e9b7f02ae3a6db147b504ddc4b70ed0b77a5cbdb9d","sha256:4b52472ac06e5b1e383e4a522332396b833603a90815f852df90a9891dda0eb6"],"state_sha256":"3b266cb6dce9ab23e85a12d2854c56cd6188202db9e190e2c5a0ce59fb335894"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qL26bsMsO+0lnUchBWIJHhksgDz8WjR81bpQpBN98e5UOuCbtMJ8bunP2fuBS9KxFJl1jefiue0WUpp70C9NCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T03:34:49.818134Z","bundle_sha256":"63668f3de21969b63099cfa8938f2032b8c827135e2b182d7ebd04fababeb8ca"}}