{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5JHEX233RJ3VJRDKHB7YNKNWPI","short_pith_number":"pith:5JHEX233","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"},"canonical_sha256":"ea4e4beb7b8a7754c46a387f86a9b67a3afdea3ab2380988e16485f67d6b7477","source":{"kind":"arxiv","id":"1812.03545","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.03545","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"arxiv_version","alias_value":"1812.03545v2","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03545","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"pith_short_12","alias_value":"5JHEX233RJ3V","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5JHEX233RJ3VJRDK","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5JHEX233","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5JHEX233RJ3VJRDKHB7YNKNWPI","target":"record","payload":{"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"},"canonical_sha256":"ea4e4beb7b8a7754c46a387f86a9b67a3afdea3ab2380988e16485f67d6b7477","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"},"source_kind":"arxiv","source_id":"1812.03545","source_version":2,"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-17T23:57:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wDjUm2ljTABM1nr5LRLW2/vpug6mU4fmJWU6YAKFrx/Ge9wZSmRXfYeadZn59YM3aS2qBVthwjGdpbJKzkIEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:07:56.015586Z"},"content_sha256":"9e79d03f3af092618b3276659e3d9bf1415351c9b2385e59c8a6bbbc5b8e74a7","schema_version":"1.0","event_id":"sha256:9e79d03f3af092618b3276659e3d9bf1415351c9b2385e59c8a6bbbc5b8e74a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5JHEX233RJ3VJRDKHB7YNKNWPI","target":"graph","payload":{"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"},"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-17T23:57:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5qzMFx/s/HZpYZrJBt1HuKNnJDb0DLXO4Hxi+eoaFsOWzV6KMnS24lbnHauCHRuee7FAXYHyekPaWEGjgnlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:07:56.016307Z"},"content_sha256":"9f30b317a5f7b6123703aa731fa2cbea296d1cffd23bebcc02d86eb212283b2d","schema_version":"1.0","event_id":"sha256:9f30b317a5f7b6123703aa731fa2cbea296d1cffd23bebcc02d86eb212283b2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5JHEX233RJ3VJRDKHB7YNKNWPI/bundle.json","state_url":"https://pith.science/pith/5JHEX233RJ3VJRDKHB7YNKNWPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5JHEX233RJ3VJRDKHB7YNKNWPI/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-08T19:07:56Z","links":{"resolver":"https://pith.science/pith/5JHEX233RJ3VJRDKHB7YNKNWPI","bundle":"https://pith.science/pith/5JHEX233RJ3VJRDKHB7YNKNWPI/bundle.json","state":"https://pith.science/pith/5JHEX233RJ3VJRDKHB7YNKNWPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5JHEX233RJ3VJRDKHB7YNKNWPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5JHEX233RJ3VJRDKHB7YNKNWPI","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":"4d4ff7c7d7e39f22a5a5067f2cfc7c17d1889008d97e8e9d126844efeb66e8d9","cross_cats_sorted":["cs.MA","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-09T18:58:36Z","title_canon_sha256":"352413214e09e4c85bc1314e6d9eb1b382d162219ab16690bb5438b58e7a84c5"},"schema_version":"1.0","source":{"id":"1812.03545","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.03545","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"arxiv_version","alias_value":"1812.03545v2","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03545","created_at":"2026-05-17T23:57:30Z"},{"alias_kind":"pith_short_12","alias_value":"5JHEX233RJ3V","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5JHEX233RJ3VJRDK","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5JHEX233","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:9f30b317a5f7b6123703aa731fa2cbea296d1cffd23bebcc02d86eb212283b2d","target":"graph","created_at":"2026-05-17T23:57:30Z","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":"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","authors_text":"Faryar Jabbari, Homayoun Yousefi'zadeh, Kai Ding","cross_cats":["cs.MA","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-09T18:58:36Z","title":"A Robust Advantaged Node Placement Strategy for Sparse Network Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03545","kind":"arxiv","version":2},"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:9e79d03f3af092618b3276659e3d9bf1415351c9b2385e59c8a6bbbc5b8e74a7","target":"record","created_at":"2026-05-17T23:57:30Z","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":"4d4ff7c7d7e39f22a5a5067f2cfc7c17d1889008d97e8e9d126844efeb66e8d9","cross_cats_sorted":["cs.MA","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-09T18:58:36Z","title_canon_sha256":"352413214e09e4c85bc1314e6d9eb1b382d162219ab16690bb5438b58e7a84c5"},"schema_version":"1.0","source":{"id":"1812.03545","kind":"arxiv","version":2}},"canonical_sha256":"ea4e4beb7b8a7754c46a387f86a9b67a3afdea3ab2380988e16485f67d6b7477","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea4e4beb7b8a7754c46a387f86a9b67a3afdea3ab2380988e16485f67d6b7477","first_computed_at":"2026-05-17T23:57:30.605227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:30.605227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SFfyvYbixevi3mpp/NLuSKfmF8sCwchzcu7nHtc92UNDVYAfjm3i8n5//qA8tpZVWh0HZoozvu4En8s1MiO4Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:30.605867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.03545","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e79d03f3af092618b3276659e3d9bf1415351c9b2385e59c8a6bbbc5b8e74a7","sha256:9f30b317a5f7b6123703aa731fa2cbea296d1cffd23bebcc02d86eb212283b2d"],"state_sha256":"3a0ee9bcca7421067c8df8e3594b970792285ddb755e6ffd086ce64d0f332f48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M77IBiA7wjzcMLIldM1ZKPQ39RKPe7Ud4LynknRsqZK3l4aMqSk7WGSBOksaqCEzUQju5Eg2ziZcDM9yAcsqCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:07:56.020283Z","bundle_sha256":"af1bce60da87d12b776f695f5307e43bf0c51ee3aeda4b89d93b60bfc9a04cb8"}}