{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:72RLCQJPHRE5UIZIKDWBVMIFTN","short_pith_number":"pith:72RLCQJP","canonical_record":{"source":{"id":"1103.0171","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-01T14:05:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"54329e40a7b8f0e95e7b3d34fce6e54239de810aaf4ceb6f08aac878a9d7da93","abstract_canon_sha256":"71f9c0d49f814d9314c150a17617fcf816384c2e6d90ca68809d1dcfec90b7c0"},"schema_version":"1.0"},"canonical_sha256":"fea2b1412f3c49da232850ec1ab1059b584e929a4d905c17dd331f46040e5e92","source":{"kind":"arxiv","id":"1103.0171","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0171","created_at":"2026-05-18T03:32:28Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0171v3","created_at":"2026-05-18T03:32:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0171","created_at":"2026-05-18T03:32:28Z"},{"alias_kind":"pith_short_12","alias_value":"72RLCQJPHRE5","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"72RLCQJPHRE5UIZI","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"72RLCQJP","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:72RLCQJPHRE5UIZIKDWBVMIFTN","target":"record","payload":{"canonical_record":{"source":{"id":"1103.0171","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-01T14:05:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"54329e40a7b8f0e95e7b3d34fce6e54239de810aaf4ceb6f08aac878a9d7da93","abstract_canon_sha256":"71f9c0d49f814d9314c150a17617fcf816384c2e6d90ca68809d1dcfec90b7c0"},"schema_version":"1.0"},"canonical_sha256":"fea2b1412f3c49da232850ec1ab1059b584e929a4d905c17dd331f46040e5e92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:28.768454Z","signature_b64":"mpFuzcP0fGhX2y1/EZF6ZRqkdPPXVJFFzUMNf2ZLKI1RV8MA6y/Ur8pFGrvKG2DhSPNdThkwL/cakd/ba1pcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fea2b1412f3c49da232850ec1ab1059b584e929a4d905c17dd331f46040e5e92","last_reissued_at":"2026-05-18T03:32:28.767866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:28.767866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.0171","source_version":3,"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-18T03:32:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O498dAL7OZk4qJZUxZqkFqPaxpJhnNlwgR1hOUYA74PAcjhahyG0gHx3ef2A+Dp9pSFGuPfZaJ9qHaQrgVJjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:42:19.235489Z"},"content_sha256":"7bb7dea4fc157b777c7b56be1b01f98b843b8894e7eb6badc0a5893bd73e5c22","schema_version":"1.0","event_id":"sha256:7bb7dea4fc157b777c7b56be1b01f98b843b8894e7eb6badc0a5893bd73e5c22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:72RLCQJPHRE5UIZIKDWBVMIFTN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite Dimensional Infinite Constellations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir Ingber, Meir Feder, Ram Zamir","submitted_at":"2011-03-01T14:05:30Z","abstract_excerpt":"In the setting of a Gaussian channel without power constraints, proposed by Poltyrev, the codewords are points in an n-dimensional Euclidean space (an infinite constellation) and the tradeoff between their density and the error probability is considered. The capacity in this setting is the highest achievable normalized log density (NLD) with vanishing error probability. This capacity as well as error exponent bounds for this setting are known. In this work we consider the optimal performance achievable in the fixed blocklength (dimension) regime. We provide two new achievability bounds, and ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0171","kind":"arxiv","version":3},"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-18T03:32:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ds02o4tab+ZgRwIE1SgVRc3VzQKTTSdUtLVRMrUbeWE8OmMSmXurHOwZvxbUzHnUtZ70SW7vzDascMVzmGxnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:42:19.236091Z"},"content_sha256":"de66969a6fa581a5315dc2338d1acca6b7a1c3a3f34abbbc44399c85a04b6494","schema_version":"1.0","event_id":"sha256:de66969a6fa581a5315dc2338d1acca6b7a1c3a3f34abbbc44399c85a04b6494"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/72RLCQJPHRE5UIZIKDWBVMIFTN/bundle.json","state_url":"https://pith.science/pith/72RLCQJPHRE5UIZIKDWBVMIFTN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/72RLCQJPHRE5UIZIKDWBVMIFTN/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-31T19:42:19Z","links":{"resolver":"https://pith.science/pith/72RLCQJPHRE5UIZIKDWBVMIFTN","bundle":"https://pith.science/pith/72RLCQJPHRE5UIZIKDWBVMIFTN/bundle.json","state":"https://pith.science/pith/72RLCQJPHRE5UIZIKDWBVMIFTN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/72RLCQJPHRE5UIZIKDWBVMIFTN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:72RLCQJPHRE5UIZIKDWBVMIFTN","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":"71f9c0d49f814d9314c150a17617fcf816384c2e6d90ca68809d1dcfec90b7c0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-01T14:05:30Z","title_canon_sha256":"54329e40a7b8f0e95e7b3d34fce6e54239de810aaf4ceb6f08aac878a9d7da93"},"schema_version":"1.0","source":{"id":"1103.0171","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0171","created_at":"2026-05-18T03:32:28Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0171v3","created_at":"2026-05-18T03:32:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0171","created_at":"2026-05-18T03:32:28Z"},{"alias_kind":"pith_short_12","alias_value":"72RLCQJPHRE5","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"72RLCQJPHRE5UIZI","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"72RLCQJP","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:de66969a6fa581a5315dc2338d1acca6b7a1c3a3f34abbbc44399c85a04b6494","target":"graph","created_at":"2026-05-18T03:32:28Z","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":"In the setting of a Gaussian channel without power constraints, proposed by Poltyrev, the codewords are points in an n-dimensional Euclidean space (an infinite constellation) and the tradeoff between their density and the error probability is considered. The capacity in this setting is the highest achievable normalized log density (NLD) with vanishing error probability. This capacity as well as error exponent bounds for this setting are known. In this work we consider the optimal performance achievable in the fixed blocklength (dimension) regime. We provide two new achievability bounds, and ex","authors_text":"Amir Ingber, Meir Feder, Ram Zamir","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-01T14:05:30Z","title":"Finite Dimensional Infinite Constellations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0171","kind":"arxiv","version":3},"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:7bb7dea4fc157b777c7b56be1b01f98b843b8894e7eb6badc0a5893bd73e5c22","target":"record","created_at":"2026-05-18T03:32:28Z","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":"71f9c0d49f814d9314c150a17617fcf816384c2e6d90ca68809d1dcfec90b7c0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-01T14:05:30Z","title_canon_sha256":"54329e40a7b8f0e95e7b3d34fce6e54239de810aaf4ceb6f08aac878a9d7da93"},"schema_version":"1.0","source":{"id":"1103.0171","kind":"arxiv","version":3}},"canonical_sha256":"fea2b1412f3c49da232850ec1ab1059b584e929a4d905c17dd331f46040e5e92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fea2b1412f3c49da232850ec1ab1059b584e929a4d905c17dd331f46040e5e92","first_computed_at":"2026-05-18T03:32:28.767866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:28.767866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mpFuzcP0fGhX2y1/EZF6ZRqkdPPXVJFFzUMNf2ZLKI1RV8MA6y/Ur8pFGrvKG2DhSPNdThkwL/cakd/ba1pcDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:28.768454Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.0171","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bb7dea4fc157b777c7b56be1b01f98b843b8894e7eb6badc0a5893bd73e5c22","sha256:de66969a6fa581a5315dc2338d1acca6b7a1c3a3f34abbbc44399c85a04b6494"],"state_sha256":"8ad609c04085d54f95bf555b41352f46dcb097be3768710539cf5defacf0809f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nYoDwbnOpMm80wZjavKJoIRtlJgiDTuUwne5yELMKyBF5g/kniv1H6ivhccsZWxJgFP/Nd/l5noFSxmYhjVHDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:42:19.240279Z","bundle_sha256":"c772bd8a6c2364e13751b6b04a3af2ecfb3bee8abd4319a3fb0b260512532390"}}