{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:C2OBZA2T5T46PTP6KULLXHR6EU","short_pith_number":"pith:C2OBZA2T","schema_version":"1.0","canonical_sha256":"169c1c8353ecf9e7cdfe5516bb9e3e2519aeb24b665b111e1ae01346edd271e2","source":{"kind":"arxiv","id":"1103.4343","version":1},"attestation_state":"computed","paper":{"title":"Undirected Connectivity of Sparse Yao Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Abhaykumar Kumbhar, Mirela Damian","submitted_at":"2011-03-22T18:39:00Z","abstract_excerpt":"Given a finite set S of points in the plane and a real value d > 0, the d-radius disk graph G^d contains all edges connecting pairs of points in S that are within distance d of each other. For a given graph G with vertex set S, the Yao subgraph Y_k[G] with integer parameter k > 0 contains, for each point p in S, a shortest edge pq from G (if any) in each of the k sectors defined by k equally-spaced rays with origin p. Motivated by communication issues in mobile networks with directional antennas, we study the connectivity properties of Y_k[G^d], for small values of k and d. In particular, we d"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1103.4343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-03-22T18:39:00Z","cross_cats_sorted":[],"title_canon_sha256":"64f72f9178c2c39c7cdd873b0b4e68e3aae896493a006745ae9d26d48eff888a","abstract_canon_sha256":"fe9d2de8fcb8a3a2a857b0a56ab04af3751edb6c6f58db1ed886e1e3b11fea20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:12.508003Z","signature_b64":"ItMj77bb9T/kUlFQhcUFP2ecpjczfY6FqrlUMYmKFNsrufUIevO/3qE9idE4+4tj0ZlNsXdrVeFU0LAgvj3bAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"169c1c8353ecf9e7cdfe5516bb9e3e2519aeb24b665b111e1ae01346edd271e2","last_reissued_at":"2026-05-18T04:26:12.507326Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:12.507326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Undirected Connectivity of Sparse Yao Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Abhaykumar Kumbhar, Mirela Damian","submitted_at":"2011-03-22T18:39:00Z","abstract_excerpt":"Given a finite set S of points in the plane and a real value d > 0, the d-radius disk graph G^d contains all edges connecting pairs of points in S that are within distance d of each other. For a given graph G with vertex set S, the Yao subgraph Y_k[G] with integer parameter k > 0 contains, for each point p in S, a shortest edge pq from G (if any) in each of the k sectors defined by k equally-spaced rays with origin p. Motivated by communication issues in mobile networks with directional antennas, we study the connectivity properties of Y_k[G^d], for small values of k and d. In particular, we d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4343","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.4343","created_at":"2026-05-18T04:26:12.507426+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.4343v1","created_at":"2026-05-18T04:26:12.507426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4343","created_at":"2026-05-18T04:26:12.507426+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2OBZA2T5T46","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2OBZA2T5T46PTP6","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2OBZA2T","created_at":"2026-05-18T12:26:24.575870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C2OBZA2T5T46PTP6KULLXHR6EU","json":"https://pith.science/pith/C2OBZA2T5T46PTP6KULLXHR6EU.json","graph_json":"https://pith.science/api/pith-number/C2OBZA2T5T46PTP6KULLXHR6EU/graph.json","events_json":"https://pith.science/api/pith-number/C2OBZA2T5T46PTP6KULLXHR6EU/events.json","paper":"https://pith.science/paper/C2OBZA2T"},"agent_actions":{"view_html":"https://pith.science/pith/C2OBZA2T5T46PTP6KULLXHR6EU","download_json":"https://pith.science/pith/C2OBZA2T5T46PTP6KULLXHR6EU.json","view_paper":"https://pith.science/paper/C2OBZA2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.4343&json=true","fetch_graph":"https://pith.science/api/pith-number/C2OBZA2T5T46PTP6KULLXHR6EU/graph.json","fetch_events":"https://pith.science/api/pith-number/C2OBZA2T5T46PTP6KULLXHR6EU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2OBZA2T5T46PTP6KULLXHR6EU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2OBZA2T5T46PTP6KULLXHR6EU/action/storage_attestation","attest_author":"https://pith.science/pith/C2OBZA2T5T46PTP6KULLXHR6EU/action/author_attestation","sign_citation":"https://pith.science/pith/C2OBZA2T5T46PTP6KULLXHR6EU/action/citation_signature","submit_replication":"https://pith.science/pith/C2OBZA2T5T46PTP6KULLXHR6EU/action/replication_record"}},"created_at":"2026-05-18T04:26:12.507426+00:00","updated_at":"2026-05-18T04:26:12.507426+00:00"}