{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5JHEX233RJ3VJRDKHB7YNKNWPI","short_pith_number":"pith:5JHEX233","schema_version":"1.0","canonical_sha256":"ea4e4beb7b8a7754c46a387f86a9b67a3afdea3ab2380988e16485f67d6b7477","source":{"kind":"arxiv","id":"1812.03545","version":2},"attestation_state":"computed","paper":{"title":"A Robust Advantaged Node Placement Strategy for Sparse Network Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.SY"],"primary_cat":"cs.NI","authors_text":"Faryar Jabbari, Homayoun Yousefi'zadeh, Kai Ding","submitted_at":"2018-12-09T18:58:36Z","abstract_excerpt":"Establishing robust connectivity in heterogeneous networks (HetNets) is an important yet challenging problem. For a HetNet accommodating a large number of nodes, establishing perturbation-invulnerable connectivity is of utmost importance. This paper provides a robust advantaged node placement strategy best suited for sparse network graphs. In order to offer connectivity robustness, this paper models the communication range of an advantaged node with a hexagon embedded within a circle representing the physical range of a node. Consequently, the proposed node placement method of this paper is ba"},"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":"1812.03545","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-09T18:58:36Z","cross_cats_sorted":["cs.MA","cs.SY"],"title_canon_sha256":"352413214e09e4c85bc1314e6d9eb1b382d162219ab16690bb5438b58e7a84c5","abstract_canon_sha256":"4d4ff7c7d7e39f22a5a5067f2cfc7c17d1889008d97e8e9d126844efeb66e8d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:30.605867Z","signature_b64":"SFfyvYbixevi3mpp/NLuSKfmF8sCwchzcu7nHtc92UNDVYAfjm3i8n5//qA8tpZVWh0HZoozvu4En8s1MiO4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea4e4beb7b8a7754c46a387f86a9b67a3afdea3ab2380988e16485f67d6b7477","last_reissued_at":"2026-05-17T23:57:30.605227Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:30.605227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Robust Advantaged Node Placement Strategy for Sparse Network Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.SY"],"primary_cat":"cs.NI","authors_text":"Faryar Jabbari, Homayoun Yousefi'zadeh, Kai Ding","submitted_at":"2018-12-09T18:58:36Z","abstract_excerpt":"Establishing robust connectivity in heterogeneous networks (HetNets) is an important yet challenging problem. For a HetNet accommodating a large number of nodes, establishing perturbation-invulnerable connectivity is of utmost importance. This paper provides a robust advantaged node placement strategy best suited for sparse network graphs. In order to offer connectivity robustness, this paper models the communication range of an advantaged node with a hexagon embedded within a circle representing the physical range of a node. Consequently, the proposed node placement method of this paper is ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03545","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":"1812.03545","created_at":"2026-05-17T23:57:30.605324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.03545v2","created_at":"2026-05-17T23:57:30.605324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03545","created_at":"2026-05-17T23:57:30.605324+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JHEX233RJ3V","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JHEX233RJ3VJRDK","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JHEX233","created_at":"2026-05-18T12:32:08.215937+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/5JHEX233RJ3VJRDKHB7YNKNWPI","json":"https://pith.science/pith/5JHEX233RJ3VJRDKHB7YNKNWPI.json","graph_json":"https://pith.science/api/pith-number/5JHEX233RJ3VJRDKHB7YNKNWPI/graph.json","events_json":"https://pith.science/api/pith-number/5JHEX233RJ3VJRDKHB7YNKNWPI/events.json","paper":"https://pith.science/paper/5JHEX233"},"agent_actions":{"view_html":"https://pith.science/pith/5JHEX233RJ3VJRDKHB7YNKNWPI","download_json":"https://pith.science/pith/5JHEX233RJ3VJRDKHB7YNKNWPI.json","view_paper":"https://pith.science/paper/5JHEX233","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.03545&json=true","fetch_graph":"https://pith.science/api/pith-number/5JHEX233RJ3VJRDKHB7YNKNWPI/graph.json","fetch_events":"https://pith.science/api/pith-number/5JHEX233RJ3VJRDKHB7YNKNWPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JHEX233RJ3VJRDKHB7YNKNWPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JHEX233RJ3VJRDKHB7YNKNWPI/action/storage_attestation","attest_author":"https://pith.science/pith/5JHEX233RJ3VJRDKHB7YNKNWPI/action/author_attestation","sign_citation":"https://pith.science/pith/5JHEX233RJ3VJRDKHB7YNKNWPI/action/citation_signature","submit_replication":"https://pith.science/pith/5JHEX233RJ3VJRDKHB7YNKNWPI/action/replication_record"}},"created_at":"2026-05-17T23:57:30.605324+00:00","updated_at":"2026-05-17T23:57:30.605324+00:00"}