{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:7EOQUUMSTWDTHUVVPZIYZLDC25","short_pith_number":"pith:7EOQUUMS","canonical_record":{"source":{"id":"2306.11705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-06-20T17:34:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3cf1000b35ada41146b45ce9d6aed341fe24db8e6cc488391cc48274c20daab5","abstract_canon_sha256":"8a818299d030ff11d313fb77480bf4c3b2913bea59bb45d0c393653e82b78ca6"},"schema_version":"1.0"},"canonical_sha256":"f91d0a51929d8733d2b57e518cac62d7634208013da331d0c27578b6d2c08584","source":{"kind":"arxiv","id":"2306.11705","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.11705","created_at":"2026-07-05T06:22:22Z"},{"alias_kind":"arxiv_version","alias_value":"2306.11705v1","created_at":"2026-07-05T06:22:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.11705","created_at":"2026-07-05T06:22:22Z"},{"alias_kind":"pith_short_12","alias_value":"7EOQUUMSTWDT","created_at":"2026-07-05T06:22:22Z"},{"alias_kind":"pith_short_16","alias_value":"7EOQUUMSTWDTHUVV","created_at":"2026-07-05T06:22:22Z"},{"alias_kind":"pith_short_8","alias_value":"7EOQUUMS","created_at":"2026-07-05T06:22:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:7EOQUUMSTWDTHUVVPZIYZLDC25","target":"record","payload":{"canonical_record":{"source":{"id":"2306.11705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-06-20T17:34:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3cf1000b35ada41146b45ce9d6aed341fe24db8e6cc488391cc48274c20daab5","abstract_canon_sha256":"8a818299d030ff11d313fb77480bf4c3b2913bea59bb45d0c393653e82b78ca6"},"schema_version":"1.0"},"canonical_sha256":"f91d0a51929d8733d2b57e518cac62d7634208013da331d0c27578b6d2c08584","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:22:22.646015Z","signature_b64":"V+qFfIKjYc9R26QdTCprgVbmq52ow0fqbwTDIC8mLS2rCqTtbL8OQdVB5K+V9K2v0xy9ACklufzlfewrBNhzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f91d0a51929d8733d2b57e518cac62d7634208013da331d0c27578b6d2c08584","last_reissued_at":"2026-07-05T06:22:22.645554Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:22:22.645554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.11705","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-05T06:22:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9cniKmHA0rLnbhM1EeOY+sGuw6yXOlJ6iBwA8efJSeHdduXfMl3Cy2NgvrDMFxTVklqKt06CsaBbJOGBGdyfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T08:29:23.617957Z"},"content_sha256":"7b4dd267faf4c8767ade5af49aab2d8fd407da0528bbe1d31975e8c5a466bdff","schema_version":"1.0","event_id":"sha256:7b4dd267faf4c8767ade5af49aab2d8fd407da0528bbe1d31975e8c5a466bdff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:7EOQUUMSTWDTHUVVPZIYZLDC25","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Identification Over Multiple-Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abdalla Ibrahim, Christian Deppe, Johannes Rosenberger, Roberto Ferrara","submitted_at":"2023-06-20T17:34:42Z","abstract_excerpt":"Deterministic identification over K-input multiple-access channels with average input cost constraints is considered. The capacity region for deterministic identification is determined for an average-error criterion, where arbitrarily large codes are achievable. For a maximal-error criterion, upper and lower bounds on the capacity region are derived. The bounds coincide if all average partial point-to-point channels are injective under the input constraint, i.e. all inputs at one terminal are mapped to distinct output distributions, if averaged over the inputs at all other terminals. The achie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.11705","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/2306.11705/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-05T06:22:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fq9nSy3LK+CuYfMyeSi6MtlxSWkfPq9ju+GRdd6ErRoOa25E1txtlVMRi5HOjheTKzsxyzocwAL/Fg//gW1YDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T08:29:23.618332Z"},"content_sha256":"30c51ed496903978a0a33f1604dcc4fb334315ad86524bacf6d2d86bdcd140da","schema_version":"1.0","event_id":"sha256:30c51ed496903978a0a33f1604dcc4fb334315ad86524bacf6d2d86bdcd140da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7EOQUUMSTWDTHUVVPZIYZLDC25/bundle.json","state_url":"https://pith.science/pith/7EOQUUMSTWDTHUVVPZIYZLDC25/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7EOQUUMSTWDTHUVVPZIYZLDC25/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-07-12T08:29:23Z","links":{"resolver":"https://pith.science/pith/7EOQUUMSTWDTHUVVPZIYZLDC25","bundle":"https://pith.science/pith/7EOQUUMSTWDTHUVVPZIYZLDC25/bundle.json","state":"https://pith.science/pith/7EOQUUMSTWDTHUVVPZIYZLDC25/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7EOQUUMSTWDTHUVVPZIYZLDC25/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:7EOQUUMSTWDTHUVVPZIYZLDC25","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":"8a818299d030ff11d313fb77480bf4c3b2913bea59bb45d0c393653e82b78ca6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-06-20T17:34:42Z","title_canon_sha256":"3cf1000b35ada41146b45ce9d6aed341fe24db8e6cc488391cc48274c20daab5"},"schema_version":"1.0","source":{"id":"2306.11705","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.11705","created_at":"2026-07-05T06:22:22Z"},{"alias_kind":"arxiv_version","alias_value":"2306.11705v1","created_at":"2026-07-05T06:22:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.11705","created_at":"2026-07-05T06:22:22Z"},{"alias_kind":"pith_short_12","alias_value":"7EOQUUMSTWDT","created_at":"2026-07-05T06:22:22Z"},{"alias_kind":"pith_short_16","alias_value":"7EOQUUMSTWDTHUVV","created_at":"2026-07-05T06:22:22Z"},{"alias_kind":"pith_short_8","alias_value":"7EOQUUMS","created_at":"2026-07-05T06:22:22Z"}],"graph_snapshots":[{"event_id":"sha256:30c51ed496903978a0a33f1604dcc4fb334315ad86524bacf6d2d86bdcd140da","target":"graph","created_at":"2026-07-05T06:22:22Z","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/2306.11705/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Deterministic identification over K-input multiple-access channels with average input cost constraints is considered. The capacity region for deterministic identification is determined for an average-error criterion, where arbitrarily large codes are achievable. For a maximal-error criterion, upper and lower bounds on the capacity region are derived. The bounds coincide if all average partial point-to-point channels are injective under the input constraint, i.e. all inputs at one terminal are mapped to distinct output distributions, if averaged over the inputs at all other terminals. The achie","authors_text":"Abdalla Ibrahim, Christian Deppe, Johannes Rosenberger, Roberto Ferrara","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-06-20T17:34:42Z","title":"Deterministic Identification Over Multiple-Access Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.11705","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:7b4dd267faf4c8767ade5af49aab2d8fd407da0528bbe1d31975e8c5a466bdff","target":"record","created_at":"2026-07-05T06:22:22Z","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":"8a818299d030ff11d313fb77480bf4c3b2913bea59bb45d0c393653e82b78ca6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-06-20T17:34:42Z","title_canon_sha256":"3cf1000b35ada41146b45ce9d6aed341fe24db8e6cc488391cc48274c20daab5"},"schema_version":"1.0","source":{"id":"2306.11705","kind":"arxiv","version":1}},"canonical_sha256":"f91d0a51929d8733d2b57e518cac62d7634208013da331d0c27578b6d2c08584","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f91d0a51929d8733d2b57e518cac62d7634208013da331d0c27578b6d2c08584","first_computed_at":"2026-07-05T06:22:22.645554Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:22:22.645554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V+qFfIKjYc9R26QdTCprgVbmq52ow0fqbwTDIC8mLS2rCqTtbL8OQdVB5K+V9K2v0xy9ACklufzlfewrBNhzCg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:22:22.646015Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.11705","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b4dd267faf4c8767ade5af49aab2d8fd407da0528bbe1d31975e8c5a466bdff","sha256:30c51ed496903978a0a33f1604dcc4fb334315ad86524bacf6d2d86bdcd140da"],"state_sha256":"871e043f6c05ecd58114b1bb2e1eb9da0cfa87383e146829b87467b22f059d87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zq9w1G2XtijjBTPVtk0w7zuNRoorgWAuEtt22KjhtcFEl16b+79IMpw1VEM7nR8uB+IoP+UbWuX1DLgl1FeaDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T08:29:23.620406Z","bundle_sha256":"34c8964a39208568a237a0160077718de6c0af62f3465384fc0c02d8ab9a0952"}}