{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2B4PSQFVMFIIZU2ZNAEUBMMXYO","short_pith_number":"pith:2B4PSQFV","schema_version":"1.0","canonical_sha256":"d078f940b561508cd359680940b197c3b8055ef93adadd4982073e69b0555395","source":{"kind":"arxiv","id":"1907.01980","version":1},"attestation_state":"computed","paper":{"title":"Triangles and Girth in Disk Graphs and Transmission Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Haim Kaplan, Katharina Klost, Liam Roditty, Micha Sharir, Paul Seiferth, Wolfgang Mulzer","submitted_at":"2019-07-03T15:09:05Z","abstract_excerpt":"Let $S \\subset \\mathbb{R}^2$ be a set of $n$ sites, where each $s \\in S$ has an associated radius $r_s > 0$. The disk graph $D(S)$ is the undirected graph with vertex set $S$ and an undirected edge between two sites $s, t \\in S$ if and only if $|st| \\leq r_s + r_t$, i.e., if the disks with centers $s$ and $t$ and respective radii $r_s$ and $r_t$ intersect. Disk graphs are used to model sensor networks. Similarly, the transmission graph $T(S)$ is the directed graph with vertex set $S$ and a directed edge from a site $s$ to a site $t$ if and only if $|st| \\leq r_s$, i.e., if $t$ lies in the disk"},"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":"1907.01980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-07-03T15:09:05Z","cross_cats_sorted":[],"title_canon_sha256":"2d781388a4ec5af8504cf9d47c4eaa1bcdb2fefd490dcc1fa97e976981735a00","abstract_canon_sha256":"6f02f4df7876150827234eb046075fabddcf38e56c650cb87a25237f752e552b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:34.323457Z","signature_b64":"AcJNNKRF5b8rJhe4e08hyuC4b50pS91zY3F9BL7ptCWPA0fAMnmSStTVJzy4ceBs/zHM1Tuxv6JHYuxj4o5yCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d078f940b561508cd359680940b197c3b8055ef93adadd4982073e69b0555395","last_reissued_at":"2026-05-17T23:41:34.322737Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:34.322737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triangles and Girth in Disk Graphs and Transmission Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Haim Kaplan, Katharina Klost, Liam Roditty, Micha Sharir, Paul Seiferth, Wolfgang Mulzer","submitted_at":"2019-07-03T15:09:05Z","abstract_excerpt":"Let $S \\subset \\mathbb{R}^2$ be a set of $n$ sites, where each $s \\in S$ has an associated radius $r_s > 0$. The disk graph $D(S)$ is the undirected graph with vertex set $S$ and an undirected edge between two sites $s, t \\in S$ if and only if $|st| \\leq r_s + r_t$, i.e., if the disks with centers $s$ and $t$ and respective radii $r_s$ and $r_t$ intersect. Disk graphs are used to model sensor networks. Similarly, the transmission graph $T(S)$ is the directed graph with vertex set $S$ and a directed edge from a site $s$ to a site $t$ if and only if $|st| \\leq r_s$, i.e., if $t$ lies in the disk"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01980","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":"1907.01980","created_at":"2026-05-17T23:41:34.322857+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01980v1","created_at":"2026-05-17T23:41:34.322857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01980","created_at":"2026-05-17T23:41:34.322857+00:00"},{"alias_kind":"pith_short_12","alias_value":"2B4PSQFVMFII","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2B4PSQFVMFIIZU2Z","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2B4PSQFV","created_at":"2026-05-18T12:33:07.085635+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/2B4PSQFVMFIIZU2ZNAEUBMMXYO","json":"https://pith.science/pith/2B4PSQFVMFIIZU2ZNAEUBMMXYO.json","graph_json":"https://pith.science/api/pith-number/2B4PSQFVMFIIZU2ZNAEUBMMXYO/graph.json","events_json":"https://pith.science/api/pith-number/2B4PSQFVMFIIZU2ZNAEUBMMXYO/events.json","paper":"https://pith.science/paper/2B4PSQFV"},"agent_actions":{"view_html":"https://pith.science/pith/2B4PSQFVMFIIZU2ZNAEUBMMXYO","download_json":"https://pith.science/pith/2B4PSQFVMFIIZU2ZNAEUBMMXYO.json","view_paper":"https://pith.science/paper/2B4PSQFV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01980&json=true","fetch_graph":"https://pith.science/api/pith-number/2B4PSQFVMFIIZU2ZNAEUBMMXYO/graph.json","fetch_events":"https://pith.science/api/pith-number/2B4PSQFVMFIIZU2ZNAEUBMMXYO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2B4PSQFVMFIIZU2ZNAEUBMMXYO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2B4PSQFVMFIIZU2ZNAEUBMMXYO/action/storage_attestation","attest_author":"https://pith.science/pith/2B4PSQFVMFIIZU2ZNAEUBMMXYO/action/author_attestation","sign_citation":"https://pith.science/pith/2B4PSQFVMFIIZU2ZNAEUBMMXYO/action/citation_signature","submit_replication":"https://pith.science/pith/2B4PSQFVMFIIZU2ZNAEUBMMXYO/action/replication_record"}},"created_at":"2026-05-17T23:41:34.322857+00:00","updated_at":"2026-05-17T23:41:34.322857+00:00"}