{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3NCC7PH3JKLLKZ6LPMGLHE7N73","short_pith_number":"pith:3NCC7PH3","canonical_record":{"source":{"id":"1305.2173","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-09T18:37:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8be1b9f27b3eefc9c67ad7121d6a6bab1d021d134c4a5a24968aff44520f96c9","abstract_canon_sha256":"33b0ff233fa4641c100200147c6065f074e69a83fb65908230fa540f5463f5e3"},"schema_version":"1.0"},"canonical_sha256":"db442fbcfb4a96b567cb7b0cb393edfefc77a43723740f421540f398e6104c9a","source":{"kind":"arxiv","id":"1305.2173","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2173","created_at":"2026-05-18T03:26:09Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2173v1","created_at":"2026-05-18T03:26:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2173","created_at":"2026-05-18T03:26:09Z"},{"alias_kind":"pith_short_12","alias_value":"3NCC7PH3JKLL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3NCC7PH3JKLLKZ6L","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3NCC7PH3","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3NCC7PH3JKLLKZ6LPMGLHE7N73","target":"record","payload":{"canonical_record":{"source":{"id":"1305.2173","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-09T18:37:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8be1b9f27b3eefc9c67ad7121d6a6bab1d021d134c4a5a24968aff44520f96c9","abstract_canon_sha256":"33b0ff233fa4641c100200147c6065f074e69a83fb65908230fa540f5463f5e3"},"schema_version":"1.0"},"canonical_sha256":"db442fbcfb4a96b567cb7b0cb393edfefc77a43723740f421540f398e6104c9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:09.184341Z","signature_b64":"EW+kAB27/hUSwqJYgTMbo6/oZtqKa17J21xfo4nTx4ESt1/CcKh+bHaSZan9hSVk5JekZL3DMQHNk6la6bhRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db442fbcfb4a96b567cb7b0cb393edfefc77a43723740f421540f398e6104c9a","last_reissued_at":"2026-05-18T03:26:09.183583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:09.183583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.2173","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-05-18T03:26:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ihVFqCC9GTpeC5aiTDG/DxFeVZdZAomtYF3+JpoYXrpVBwGDks4hdXZaWPsvnS3wKF1ZzBGW21P4/tYV7amkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:58:07.218398Z"},"content_sha256":"6207fbdc0bbfa9301f98e1793326a26c94a858aa121d16ac19ffe6d325ca5641","schema_version":"1.0","event_id":"sha256:6207fbdc0bbfa9301f98e1793326a26c94a858aa121d16ac19ffe6d325ca5641"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3NCC7PH3JKLLKZ6LPMGLHE7N73","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimality of Orthogonal Access for One-dimensional Convex Cellular Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamed Maleki, Syed A. Jafar","submitted_at":"2013-05-09T18:37:07Z","abstract_excerpt":"It is shown that a greedy orthogonal access scheme achieves the sum degrees of freedom of all one-dimensional (all nodes placed along a straight line) convex cellular networks (where cells are convex regions) when no channel knowledge is available at the transmitters except the knowledge of the network topology. In general, optimality of orthogonal access holds neither for two-dimensional convex cellular networks nor for one-dimensional non-convex cellular networks, thus revealing a fundamental limitation that exists only when both one-dimensional and convex properties are simultaneously enfor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2173","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":""},"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:26:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P2h5yzuALexnDyuONszOYNCUWu0oJn6ijvt+HAE62sLIpM5ofjySmjvMC0VOd+jdgU1x1gzj0OmL6EDciMohDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:58:07.218756Z"},"content_sha256":"fe7d99e16902619e8409fe23f809e91eaa7528ea6ff36b3ff215c477fc7c217b","schema_version":"1.0","event_id":"sha256:fe7d99e16902619e8409fe23f809e91eaa7528ea6ff36b3ff215c477fc7c217b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3NCC7PH3JKLLKZ6LPMGLHE7N73/bundle.json","state_url":"https://pith.science/pith/3NCC7PH3JKLLKZ6LPMGLHE7N73/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3NCC7PH3JKLLKZ6LPMGLHE7N73/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-06-20T02:58:07Z","links":{"resolver":"https://pith.science/pith/3NCC7PH3JKLLKZ6LPMGLHE7N73","bundle":"https://pith.science/pith/3NCC7PH3JKLLKZ6LPMGLHE7N73/bundle.json","state":"https://pith.science/pith/3NCC7PH3JKLLKZ6LPMGLHE7N73/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3NCC7PH3JKLLKZ6LPMGLHE7N73/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3NCC7PH3JKLLKZ6LPMGLHE7N73","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":"33b0ff233fa4641c100200147c6065f074e69a83fb65908230fa540f5463f5e3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-09T18:37:07Z","title_canon_sha256":"8be1b9f27b3eefc9c67ad7121d6a6bab1d021d134c4a5a24968aff44520f96c9"},"schema_version":"1.0","source":{"id":"1305.2173","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2173","created_at":"2026-05-18T03:26:09Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2173v1","created_at":"2026-05-18T03:26:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2173","created_at":"2026-05-18T03:26:09Z"},{"alias_kind":"pith_short_12","alias_value":"3NCC7PH3JKLL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3NCC7PH3JKLLKZ6L","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3NCC7PH3","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:fe7d99e16902619e8409fe23f809e91eaa7528ea6ff36b3ff215c477fc7c217b","target":"graph","created_at":"2026-05-18T03:26:09Z","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":"It is shown that a greedy orthogonal access scheme achieves the sum degrees of freedom of all one-dimensional (all nodes placed along a straight line) convex cellular networks (where cells are convex regions) when no channel knowledge is available at the transmitters except the knowledge of the network topology. In general, optimality of orthogonal access holds neither for two-dimensional convex cellular networks nor for one-dimensional non-convex cellular networks, thus revealing a fundamental limitation that exists only when both one-dimensional and convex properties are simultaneously enfor","authors_text":"Hamed Maleki, Syed A. Jafar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-09T18:37:07Z","title":"Optimality of Orthogonal Access for One-dimensional Convex Cellular Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2173","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:6207fbdc0bbfa9301f98e1793326a26c94a858aa121d16ac19ffe6d325ca5641","target":"record","created_at":"2026-05-18T03:26:09Z","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":"33b0ff233fa4641c100200147c6065f074e69a83fb65908230fa540f5463f5e3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-09T18:37:07Z","title_canon_sha256":"8be1b9f27b3eefc9c67ad7121d6a6bab1d021d134c4a5a24968aff44520f96c9"},"schema_version":"1.0","source":{"id":"1305.2173","kind":"arxiv","version":1}},"canonical_sha256":"db442fbcfb4a96b567cb7b0cb393edfefc77a43723740f421540f398e6104c9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db442fbcfb4a96b567cb7b0cb393edfefc77a43723740f421540f398e6104c9a","first_computed_at":"2026-05-18T03:26:09.183583Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:09.183583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EW+kAB27/hUSwqJYgTMbo6/oZtqKa17J21xfo4nTx4ESt1/CcKh+bHaSZan9hSVk5JekZL3DMQHNk6la6bhRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:09.184341Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.2173","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6207fbdc0bbfa9301f98e1793326a26c94a858aa121d16ac19ffe6d325ca5641","sha256:fe7d99e16902619e8409fe23f809e91eaa7528ea6ff36b3ff215c477fc7c217b"],"state_sha256":"c09f63bb5dd8f31ed146c72c031347e451653b89858ac9e08fd1b24bc84e0338"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zj7AfQyptEWBN6uTJEbp9SBZaPCAbhAXICEm51iBc5Cos4N+UXWdGqad9JFs34do10GZgkiwT5Uvp2xVBbLYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T02:58:07.220831Z","bundle_sha256":"5a4abd8cee63323cb07329a7a1880cc25afa6a17953087465381f8a4a8b4a348"}}