{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:N6NSC2AISHP7LK7UHH7A5H4KRF","short_pith_number":"pith:N6NSC2AI","canonical_record":{"source":{"id":"2404.14390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-04-22T17:51:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b0ca882f878a9616ce33896a27dd9753e431f608617b55a77696b55aa10823bb","abstract_canon_sha256":"e028464ed5544c1317cd5a000019ee67c9e1c4d3b2db5f37176dce6e14eb1801"},"schema_version":"1.0"},"canonical_sha256":"6f9b21680891dff5abf439fe0e9f8a89502c6e951e152a92dca95448c7e6acbf","source":{"kind":"arxiv","id":"2404.14390","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.14390","created_at":"2026-07-05T08:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"2404.14390v1","created_at":"2026-07-05T08:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.14390","created_at":"2026-07-05T08:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"N6NSC2AISHP7","created_at":"2026-07-05T08:10:46Z"},{"alias_kind":"pith_short_16","alias_value":"N6NSC2AISHP7LK7U","created_at":"2026-07-05T08:10:46Z"},{"alias_kind":"pith_short_8","alias_value":"N6NSC2AI","created_at":"2026-07-05T08:10:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:N6NSC2AISHP7LK7UHH7A5H4KRF","target":"record","payload":{"canonical_record":{"source":{"id":"2404.14390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-04-22T17:51:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b0ca882f878a9616ce33896a27dd9753e431f608617b55a77696b55aa10823bb","abstract_canon_sha256":"e028464ed5544c1317cd5a000019ee67c9e1c4d3b2db5f37176dce6e14eb1801"},"schema_version":"1.0"},"canonical_sha256":"6f9b21680891dff5abf439fe0e9f8a89502c6e951e152a92dca95448c7e6acbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:10:46.778522Z","signature_b64":"bfteMZTv8Okf5miWWwMM3xlFMJd7iMwEMYKNKzYAen9M4JpFFXV5RqxlIHvzESokvIdTNdlD43LS9RrPD3u5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f9b21680891dff5abf439fe0e9f8a89502c6e951e152a92dca95448c7e6acbf","last_reissued_at":"2026-07-05T08:10:46.778039Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:10:46.778039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.14390","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-05T08:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kCJWcm+9x1FBJaY5eiq+0tByrbGOpEWaAdnBQj1Zeuu2VpVEBXgn97PYORvNXjsyTeLmjvT91Gke4KgdO2OYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T11:21:27.115850Z"},"content_sha256":"50ef54537d8952b88fe4ce67914d4de5014cd37b623ba38da83acbe6966b2e1f","schema_version":"1.0","event_id":"sha256:50ef54537d8952b88fe4ce67914d4de5014cd37b623ba38da83acbe6966b2e1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:N6NSC2AISHP7LK7UHH7A5H4KRF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Function Computation and Identification over Locally Homomorphic Multiple-Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Deppe, Holger Boche, Johannes Rosenberger, Juan A. Cabrera","submitted_at":"2024-04-22T17:51:32Z","abstract_excerpt":"We develop the notion of a locally homomorphic channel and prove an approximate equivalence between those and codes for computing functions. Further, we derive decomposition properties of locally homomorphic channels which we use to analyze and construct codes where two messages must be encoded independently. This leads to new results for identification and K-identification when all messages are sent over multiple-access channels, which yield surprising rate improvements compared to naive code constructions. In particular, we demonstrate that for the example of identification with deterministi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.14390","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/2404.14390/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-05T08:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OodsNnDa7cbz0mE7iQ4oNhSQBDijwc9aENsdFcQ/5tyCcMBujV/V3e4Czn5wX67Le9yaM6ASUMxlTqCmbo5wDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T11:21:27.116659Z"},"content_sha256":"b688135fe25a856b68e16777a4d3ad091ce1ccdc461a478cfb8ee1ed24aec806","schema_version":"1.0","event_id":"sha256:b688135fe25a856b68e16777a4d3ad091ce1ccdc461a478cfb8ee1ed24aec806"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N6NSC2AISHP7LK7UHH7A5H4KRF/bundle.json","state_url":"https://pith.science/pith/N6NSC2AISHP7LK7UHH7A5H4KRF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N6NSC2AISHP7LK7UHH7A5H4KRF/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-05T11:21:27Z","links":{"resolver":"https://pith.science/pith/N6NSC2AISHP7LK7UHH7A5H4KRF","bundle":"https://pith.science/pith/N6NSC2AISHP7LK7UHH7A5H4KRF/bundle.json","state":"https://pith.science/pith/N6NSC2AISHP7LK7UHH7A5H4KRF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N6NSC2AISHP7LK7UHH7A5H4KRF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:N6NSC2AISHP7LK7UHH7A5H4KRF","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":"e028464ed5544c1317cd5a000019ee67c9e1c4d3b2db5f37176dce6e14eb1801","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-04-22T17:51:32Z","title_canon_sha256":"b0ca882f878a9616ce33896a27dd9753e431f608617b55a77696b55aa10823bb"},"schema_version":"1.0","source":{"id":"2404.14390","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.14390","created_at":"2026-07-05T08:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"2404.14390v1","created_at":"2026-07-05T08:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.14390","created_at":"2026-07-05T08:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"N6NSC2AISHP7","created_at":"2026-07-05T08:10:46Z"},{"alias_kind":"pith_short_16","alias_value":"N6NSC2AISHP7LK7U","created_at":"2026-07-05T08:10:46Z"},{"alias_kind":"pith_short_8","alias_value":"N6NSC2AI","created_at":"2026-07-05T08:10:46Z"}],"graph_snapshots":[{"event_id":"sha256:b688135fe25a856b68e16777a4d3ad091ce1ccdc461a478cfb8ee1ed24aec806","target":"graph","created_at":"2026-07-05T08:10:46Z","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/2404.14390/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop the notion of a locally homomorphic channel and prove an approximate equivalence between those and codes for computing functions. Further, we derive decomposition properties of locally homomorphic channels which we use to analyze and construct codes where two messages must be encoded independently. This leads to new results for identification and K-identification when all messages are sent over multiple-access channels, which yield surprising rate improvements compared to naive code constructions. In particular, we demonstrate that for the example of identification with deterministi","authors_text":"Christian Deppe, Holger Boche, Johannes Rosenberger, Juan A. Cabrera","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-04-22T17:51:32Z","title":"Function Computation and Identification over Locally Homomorphic Multiple-Access Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.14390","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:50ef54537d8952b88fe4ce67914d4de5014cd37b623ba38da83acbe6966b2e1f","target":"record","created_at":"2026-07-05T08:10:46Z","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":"e028464ed5544c1317cd5a000019ee67c9e1c4d3b2db5f37176dce6e14eb1801","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-04-22T17:51:32Z","title_canon_sha256":"b0ca882f878a9616ce33896a27dd9753e431f608617b55a77696b55aa10823bb"},"schema_version":"1.0","source":{"id":"2404.14390","kind":"arxiv","version":1}},"canonical_sha256":"6f9b21680891dff5abf439fe0e9f8a89502c6e951e152a92dca95448c7e6acbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f9b21680891dff5abf439fe0e9f8a89502c6e951e152a92dca95448c7e6acbf","first_computed_at":"2026-07-05T08:10:46.778039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:10:46.778039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bfteMZTv8Okf5miWWwMM3xlFMJd7iMwEMYKNKzYAen9M4JpFFXV5RqxlIHvzESokvIdTNdlD43LS9RrPD3u5AA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:10:46.778522Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.14390","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50ef54537d8952b88fe4ce67914d4de5014cd37b623ba38da83acbe6966b2e1f","sha256:b688135fe25a856b68e16777a4d3ad091ce1ccdc461a478cfb8ee1ed24aec806"],"state_sha256":"77b313f99866784f7b465afc4053ce678fbe0860b393b2be9f7f0769fb7df419"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R0MyUiTbGL8bufMPmNpzp8S22qoZpj1ZLBoiy+X6F0wJ6Q1f9zXGBMu90vp9hiGRE+5VKn7yta8C/PLxHd6yCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T11:21:27.126416Z","bundle_sha256":"b45ff05a60a122dd33323541ba2881532abe48f74813b9f1f153ed2921b1a334"}}