{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CMRWPXFF5TNKK6BFV4HMFCZWQB","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":"e9fd8fa8c372061e6aae0473af186aeeb4c5e824d7c0f1f24c761ff14c730804","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-22T00:01:16Z","title_canon_sha256":"f39d030900ff542cd630428dd60b3ac45009fdea216e9e962940c14586ecb8e0"},"schema_version":"1.0","source":{"id":"2501.12548","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.12548","created_at":"2026-07-05T10:03:54Z"},{"alias_kind":"arxiv_version","alias_value":"2501.12548v1","created_at":"2026-07-05T10:03:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12548","created_at":"2026-07-05T10:03:54Z"},{"alias_kind":"pith_short_12","alias_value":"CMRWPXFF5TNK","created_at":"2026-07-05T10:03:54Z"},{"alias_kind":"pith_short_16","alias_value":"CMRWPXFF5TNKK6BF","created_at":"2026-07-05T10:03:54Z"},{"alias_kind":"pith_short_8","alias_value":"CMRWPXFF","created_at":"2026-07-05T10:03:54Z"}],"graph_snapshots":[{"event_id":"sha256:749167998b175a47f0d5d098ae1d1d3994688da2187c5bf5197ac243ca741810","target":"graph","created_at":"2026-07-05T10:03:54Z","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/2501.12548/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Deterministic identification offers an efficient solution for scenarios where decoding entire messages is unnecessary. It is commonly used in alarm systems and control systems. A key advantage of this approach is that the capacity for deterministic identification in Gaussian channels with power constraints grows superexponentially, unlike Shannon's transmission capacity. This allows for a significantly higher number of messages to be transmitted using this event-driven method. So far, only upper and lower bounds for deterministic identification capacity have been established. Our work introduc","authors_text":"Christian Deppe, Golamreza Omidi, Holger Boche, Safieh Mahmoodi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-22T00:01:16Z","title":"Galaxy Codes: Advancing Achievability for Deterministic Identification via Gaussian Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.12548","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:57d5861d84e7686fbb8a022efff71006e3e27583f9b3d3535a68c0f6ec50db20","target":"record","created_at":"2026-07-05T10:03:54Z","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":"e9fd8fa8c372061e6aae0473af186aeeb4c5e824d7c0f1f24c761ff14c730804","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-22T00:01:16Z","title_canon_sha256":"f39d030900ff542cd630428dd60b3ac45009fdea216e9e962940c14586ecb8e0"},"schema_version":"1.0","source":{"id":"2501.12548","kind":"arxiv","version":1}},"canonical_sha256":"132367dca5ecdaa57825af0ec28b368063375102d5dd46b96d6da67a65ee4dd3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"132367dca5ecdaa57825af0ec28b368063375102d5dd46b96d6da67a65ee4dd3","first_computed_at":"2026-07-05T10:03:54.821177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:03:54.821177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nrtDts7FVbRkUPQAfcbGuMbJOeK9SGxq8BPNwmYIZ/a52EIMsnS165n6hSI8DAumBvhM8aaaVyIb6umSw0vYDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:03:54.821677Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.12548","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57d5861d84e7686fbb8a022efff71006e3e27583f9b3d3535a68c0f6ec50db20","sha256:749167998b175a47f0d5d098ae1d1d3994688da2187c5bf5197ac243ca741810"],"state_sha256":"a8dc014d55cf5887341b21e08914ca9ca4315a79f14060e1fb0d91bab4101263"}