{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XOPKZALODSLPJVJEZFDFVJCOVW","short_pith_number":"pith:XOPKZALO","schema_version":"1.0","canonical_sha256":"bb9eac816e1c96f4d524c9465aa44eadb4d965404a48d4d3d72a2c17b5d17c7d","source":{"kind":"arxiv","id":"1502.00404","version":2},"attestation_state":"computed","paper":{"title":"A curious gap in one-dimensional geometric random graphs between connectivity and the absence of isolated node","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","math.CO","math.PR"],"primary_cat":"physics.soc-ph","authors_text":"Jun Zhao, Osman Ya\\u{g}an, Virgil Gligor","submitted_at":"2015-02-02T09:03:13Z","abstract_excerpt":"One-dimensional geometric random graphs are constructed by distributing $n$ nodes uniformly and independently on a unit interval and then assigning an undirected edge between any two nodes that have a distance at most $r_n$. These graphs have received much interest and been used in various applications including wireless networks. A threshold of $r_n$ for connectivity is known as $r_n^{*} = \\frac{\\ln n}{n}$ in the literature. In this paper, we prove that a threshold of $r_n$ for the absence of isolated node is $\\frac{\\ln n}{2 n}$ (i.e., a half of the threshold $r_n^{*}$). Our result shows ther"},"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":"1502.00404","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-02-02T09:03:13Z","cross_cats_sorted":["cs.DM","cs.SI","math.CO","math.PR"],"title_canon_sha256":"7feb858453d8dfe84a132d31a2d23b5692fcc92222bf60573b0e2bc5d6ff7241","abstract_canon_sha256":"6961fb3522bd87f8be7c0569858235ea6c6eba250940ac8dbfe84c9ca2613128"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:46.632821Z","signature_b64":"3JDqvyy6mvJeYpdvl0ynmWJ8BhzcrnBfnw1ujh3LgiKaF65SJCWCzy74vhbtm4uRutWXBa8IzvDqSLsWQ1feBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb9eac816e1c96f4d524c9465aa44eadb4d965404a48d4d3d72a2c17b5d17c7d","last_reissued_at":"2026-05-18T02:26:46.632433Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:46.632433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A curious gap in one-dimensional geometric random graphs between connectivity and the absence of isolated node","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","math.CO","math.PR"],"primary_cat":"physics.soc-ph","authors_text":"Jun Zhao, Osman Ya\\u{g}an, Virgil Gligor","submitted_at":"2015-02-02T09:03:13Z","abstract_excerpt":"One-dimensional geometric random graphs are constructed by distributing $n$ nodes uniformly and independently on a unit interval and then assigning an undirected edge between any two nodes that have a distance at most $r_n$. These graphs have received much interest and been used in various applications including wireless networks. A threshold of $r_n$ for connectivity is known as $r_n^{*} = \\frac{\\ln n}{n}$ in the literature. In this paper, we prove that a threshold of $r_n$ for the absence of isolated node is $\\frac{\\ln n}{2 n}$ (i.e., a half of the threshold $r_n^{*}$). Our result shows ther"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00404","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.00404","created_at":"2026-05-18T02:26:46.632495+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00404v2","created_at":"2026-05-18T02:26:46.632495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00404","created_at":"2026-05-18T02:26:46.632495+00:00"},{"alias_kind":"pith_short_12","alias_value":"XOPKZALODSLP","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XOPKZALODSLPJVJE","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XOPKZALO","created_at":"2026-05-18T12:29:50.041715+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/XOPKZALODSLPJVJEZFDFVJCOVW","json":"https://pith.science/pith/XOPKZALODSLPJVJEZFDFVJCOVW.json","graph_json":"https://pith.science/api/pith-number/XOPKZALODSLPJVJEZFDFVJCOVW/graph.json","events_json":"https://pith.science/api/pith-number/XOPKZALODSLPJVJEZFDFVJCOVW/events.json","paper":"https://pith.science/paper/XOPKZALO"},"agent_actions":{"view_html":"https://pith.science/pith/XOPKZALODSLPJVJEZFDFVJCOVW","download_json":"https://pith.science/pith/XOPKZALODSLPJVJEZFDFVJCOVW.json","view_paper":"https://pith.science/paper/XOPKZALO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00404&json=true","fetch_graph":"https://pith.science/api/pith-number/XOPKZALODSLPJVJEZFDFVJCOVW/graph.json","fetch_events":"https://pith.science/api/pith-number/XOPKZALODSLPJVJEZFDFVJCOVW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XOPKZALODSLPJVJEZFDFVJCOVW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XOPKZALODSLPJVJEZFDFVJCOVW/action/storage_attestation","attest_author":"https://pith.science/pith/XOPKZALODSLPJVJEZFDFVJCOVW/action/author_attestation","sign_citation":"https://pith.science/pith/XOPKZALODSLPJVJEZFDFVJCOVW/action/citation_signature","submit_replication":"https://pith.science/pith/XOPKZALODSLPJVJEZFDFVJCOVW/action/replication_record"}},"created_at":"2026-05-18T02:26:46.632495+00:00","updated_at":"2026-05-18T02:26:46.632495+00:00"}