{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ZR6W7NJEUJL6CHT2LPUNET56S2","short_pith_number":"pith:ZR6W7NJE","canonical_record":{"source":{"id":"2510.13661","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-10-15T15:19:59Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"3aa4cd5990a0917304dc055761b3f0baba4faf66cd5c430ded2575cf8fdbd46d","abstract_canon_sha256":"0d40b1be8a0592e73e42d3f416b7799968cb050a5d4df263c3204722c96636e5"},"schema_version":"1.0"},"canonical_sha256":"cc7d6fb524a257e11e7a5be8d24fbe96a58b17722a8ab55f8c00c59b3d3f4544","source":{"kind":"arxiv","id":"2510.13661","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.13661","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"2510.13661v2","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.13661","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZR6W7NJEUJL6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ZR6W7NJEUJL6CHT2","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ZR6W7NJE","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ZR6W7NJEUJL6CHT2LPUNET56S2","target":"record","payload":{"canonical_record":{"source":{"id":"2510.13661","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-10-15T15:19:59Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"3aa4cd5990a0917304dc055761b3f0baba4faf66cd5c430ded2575cf8fdbd46d","abstract_canon_sha256":"0d40b1be8a0592e73e42d3f416b7799968cb050a5d4df263c3204722c96636e5"},"schema_version":"1.0"},"canonical_sha256":"cc7d6fb524a257e11e7a5be8d24fbe96a58b17722a8ab55f8c00c59b3d3f4544","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:33.070704Z","signature_b64":"n5MJZsNxoBZBDaDLcCGucrdP+tQW7IP49VgY4ce2rEwnHb/RKl9J/1wwTTbhKTFFRN+JVKPUmDr0z8wQ7p5SBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc7d6fb524a257e11e7a5be8d24fbe96a58b17722a8ab55f8c00c59b3d3f4544","last_reissued_at":"2026-05-18T02:44:33.070228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:33.070228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2510.13661","source_version":2,"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-18T02:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oRiGmNl1t6Kpf3cm2OvNRFEHFJl4Rl4nOHABqWksFpnTxdMn6s8OBw0EO70yMNfdEgQXNn0IoGLsTRR55BA1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T06:18:07.998518Z"},"content_sha256":"db19adb8dab54c1f0719f68892a75e6f86c06013d99c71bfef0803fe4f8d0235","schema_version":"1.0","event_id":"sha256:db19adb8dab54c1f0719f68892a75e6f86c06013d99c71bfef0803fe4f8d0235"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ZR6W7NJEUJL6CHT2LPUNET56S2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Information-Theoretic Security via Euclidean Geometry","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Emmanouil M.Athanasakos, Hariprasad Manjunath, Nicholas Kalouptsidis","submitted_at":"2025-10-15T15:19:59Z","abstract_excerpt":"This paper introduces a methodology based on Euclidean information theory to investigate local properties of secure communication over discrete memoryless wiretap channels. We formulate a constrained optimization problem that maximizes a legitimate user's information rate while imposing explicit upper bounds on both the information leakage to an eavesdropper and the informational cost of encoding the secret message. By leveraging local geometric approximations, this inherently non-convex problem is transformed into a tractable quadratic programming structure. It is demonstrated that the optima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.13661","kind":"arxiv","version":2},"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-18T02:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rt+RmDdFxI5JE8irsGAftvWPTNVmBUg0gdFNWeRW+CVXN8bwPAZ9Ay39AJ5ZRQ8Ica2u52q+2/ZBNkyXOQV2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T06:18:07.998862Z"},"content_sha256":"d353215fad03702252fc523a4df5b51b98c9cfd03cb0828e3958fbbb9f155bf6","schema_version":"1.0","event_id":"sha256:d353215fad03702252fc523a4df5b51b98c9cfd03cb0828e3958fbbb9f155bf6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZR6W7NJEUJL6CHT2LPUNET56S2/bundle.json","state_url":"https://pith.science/pith/ZR6W7NJEUJL6CHT2LPUNET56S2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZR6W7NJEUJL6CHT2LPUNET56S2/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-21T06:18:07Z","links":{"resolver":"https://pith.science/pith/ZR6W7NJEUJL6CHT2LPUNET56S2","bundle":"https://pith.science/pith/ZR6W7NJEUJL6CHT2LPUNET56S2/bundle.json","state":"https://pith.science/pith/ZR6W7NJEUJL6CHT2LPUNET56S2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZR6W7NJEUJL6CHT2LPUNET56S2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZR6W7NJEUJL6CHT2LPUNET56S2","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":"0d40b1be8a0592e73e42d3f416b7799968cb050a5d4df263c3204722c96636e5","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-10-15T15:19:59Z","title_canon_sha256":"3aa4cd5990a0917304dc055761b3f0baba4faf66cd5c430ded2575cf8fdbd46d"},"schema_version":"1.0","source":{"id":"2510.13661","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.13661","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"2510.13661v2","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.13661","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZR6W7NJEUJL6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ZR6W7NJEUJL6CHT2","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ZR6W7NJE","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:d353215fad03702252fc523a4df5b51b98c9cfd03cb0828e3958fbbb9f155bf6","target":"graph","created_at":"2026-05-18T02:44:33Z","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":"This paper introduces a methodology based on Euclidean information theory to investigate local properties of secure communication over discrete memoryless wiretap channels. We formulate a constrained optimization problem that maximizes a legitimate user's information rate while imposing explicit upper bounds on both the information leakage to an eavesdropper and the informational cost of encoding the secret message. By leveraging local geometric approximations, this inherently non-convex problem is transformed into a tractable quadratic programming structure. It is demonstrated that the optima","authors_text":"Emmanouil M.Athanasakos, Hariprasad Manjunath, Nicholas Kalouptsidis","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-10-15T15:19:59Z","title":"Local Information-Theoretic Security via Euclidean Geometry"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.13661","kind":"arxiv","version":2},"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:db19adb8dab54c1f0719f68892a75e6f86c06013d99c71bfef0803fe4f8d0235","target":"record","created_at":"2026-05-18T02:44:33Z","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":"0d40b1be8a0592e73e42d3f416b7799968cb050a5d4df263c3204722c96636e5","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-10-15T15:19:59Z","title_canon_sha256":"3aa4cd5990a0917304dc055761b3f0baba4faf66cd5c430ded2575cf8fdbd46d"},"schema_version":"1.0","source":{"id":"2510.13661","kind":"arxiv","version":2}},"canonical_sha256":"cc7d6fb524a257e11e7a5be8d24fbe96a58b17722a8ab55f8c00c59b3d3f4544","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc7d6fb524a257e11e7a5be8d24fbe96a58b17722a8ab55f8c00c59b3d3f4544","first_computed_at":"2026-05-18T02:44:33.070228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:33.070228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n5MJZsNxoBZBDaDLcCGucrdP+tQW7IP49VgY4ce2rEwnHb/RKl9J/1wwTTbhKTFFRN+JVKPUmDr0z8wQ7p5SBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:33.070704Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.13661","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db19adb8dab54c1f0719f68892a75e6f86c06013d99c71bfef0803fe4f8d0235","sha256:d353215fad03702252fc523a4df5b51b98c9cfd03cb0828e3958fbbb9f155bf6"],"state_sha256":"393850bc07635ac6ca7f5b1fecf5560c87d9e806446c945a00828ffa31abcee0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mWbfCtzYQJV5da1GbMdb0P8OCU6jjynkpZ9bDcVwoQPu79796fsPkq9Yp5E+xxgvhT93JJHTJHkv0L222wPjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T06:18:08.000876Z","bundle_sha256":"f41cc56363ba0202850e0f5c0aad47bacec2da62868d5fac9569f3dd3be17c9b"}}