{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZHPSRUGS7UM2D5EZKOIXY3ZDAM","short_pith_number":"pith:ZHPSRUGS","canonical_record":{"source":{"id":"1508.04921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-20T08:48:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"43166e6ad01cafdb4c8fd43a92175d30e5af747847c0f54ea24e3674057209aa","abstract_canon_sha256":"9775381fe67fc00af9d9caf751d6909d8f2e9fbacf16c0c1908eda1681348dec"},"schema_version":"1.0"},"canonical_sha256":"c9df28d0d2fd19a1f49953917c6f230315d8361d7ce4e558a0ce710db387641a","source":{"kind":"arxiv","id":"1508.04921","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04921","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04921v1","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04921","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZHPSRUGS7UM2","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZHPSRUGS7UM2D5EZ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZHPSRUGS","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZHPSRUGS7UM2D5EZKOIXY3ZDAM","target":"record","payload":{"canonical_record":{"source":{"id":"1508.04921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-20T08:48:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"43166e6ad01cafdb4c8fd43a92175d30e5af747847c0f54ea24e3674057209aa","abstract_canon_sha256":"9775381fe67fc00af9d9caf751d6909d8f2e9fbacf16c0c1908eda1681348dec"},"schema_version":"1.0"},"canonical_sha256":"c9df28d0d2fd19a1f49953917c6f230315d8361d7ce4e558a0ce710db387641a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:00.231467Z","signature_b64":"uhj4xE5HeMA6A/mP3cHfpcjohB+DRyHZ1Bsm1zo5oRWykgHSTJN5IKYLlpTDeSvCks8fMS08WQCxohP7J2SzCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9df28d0d2fd19a1f49953917c6f230315d8361d7ce4e558a0ce710db387641a","last_reissued_at":"2026-05-18T01:35:00.230843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:00.230843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.04921","source_version":1,"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-18T01:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"plTDNnU8jl6+Py1GIfDPoede2+wlTKTX7n8IznN11sKYhGbjg4qS5+ai2gE31CvHh9Tp44vMTtJOACYeSPfWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:23:04.406284Z"},"content_sha256":"6321af51970d5bc2f3a0829839e7b3e8a8e04eedc5b85020122bbaf91091925e","schema_version":"1.0","event_id":"sha256:6321af51970d5bc2f3a0829839e7b3e8a8e04eedc5b85020122bbaf91091925e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZHPSRUGS7UM2D5EZKOIXY3ZDAM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Node Estimation and Topology Discovery Algorithm in Large-Scale Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Douik, Mohamed-Slim Alouini, Salah A. Aly, Tareq Y. Al-Naffouri","submitted_at":"2015-08-20T08:48:29Z","abstract_excerpt":"This paper introduces a novel algorithm for cardinality, i.e., the number of nodes, estimation in large scale anonymous graphs using statistical inference methods. Applications of this work include estimating the number of sensor devices, online social users, active protein cells, etc. In anonymous graphs, each node possesses little or non-existing information on the network topology. In particular, this paper assumes that each node only knows its unique identifier. The aim is to estimate the cardinality of the graph and the neighbours of each node by querying a small portion of them. While th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04921","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"},"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-18T01:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+VK3o7YhwCBdcFE3CQglGeYXz/8ZRpJr6PJWfaMkRxuB6ane7sP5u+VxC5USj4WEJGy51KTz0jhy71CKkhFWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:23:04.406659Z"},"content_sha256":"d1f327ae73bd21f64dc661c7dd975c8d495b2fef0b8ee272adb7ad0222fc43ac","schema_version":"1.0","event_id":"sha256:d1f327ae73bd21f64dc661c7dd975c8d495b2fef0b8ee272adb7ad0222fc43ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZHPSRUGS7UM2D5EZKOIXY3ZDAM/bundle.json","state_url":"https://pith.science/pith/ZHPSRUGS7UM2D5EZKOIXY3ZDAM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZHPSRUGS7UM2D5EZKOIXY3ZDAM/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-05T11:23:04Z","links":{"resolver":"https://pith.science/pith/ZHPSRUGS7UM2D5EZKOIXY3ZDAM","bundle":"https://pith.science/pith/ZHPSRUGS7UM2D5EZKOIXY3ZDAM/bundle.json","state":"https://pith.science/pith/ZHPSRUGS7UM2D5EZKOIXY3ZDAM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZHPSRUGS7UM2D5EZKOIXY3ZDAM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZHPSRUGS7UM2D5EZKOIXY3ZDAM","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":"9775381fe67fc00af9d9caf751d6909d8f2e9fbacf16c0c1908eda1681348dec","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-20T08:48:29Z","title_canon_sha256":"43166e6ad01cafdb4c8fd43a92175d30e5af747847c0f54ea24e3674057209aa"},"schema_version":"1.0","source":{"id":"1508.04921","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04921","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04921v1","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04921","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZHPSRUGS7UM2","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZHPSRUGS7UM2D5EZ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZHPSRUGS","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:d1f327ae73bd21f64dc661c7dd975c8d495b2fef0b8ee272adb7ad0222fc43ac","target":"graph","created_at":"2026-05-18T01:35:00Z","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":"This paper introduces a novel algorithm for cardinality, i.e., the number of nodes, estimation in large scale anonymous graphs using statistical inference methods. Applications of this work include estimating the number of sensor devices, online social users, active protein cells, etc. In anonymous graphs, each node possesses little or non-existing information on the network topology. In particular, this paper assumes that each node only knows its unique identifier. The aim is to estimate the cardinality of the graph and the neighbours of each node by querying a small portion of them. While th","authors_text":"Ahmed Douik, Mohamed-Slim Alouini, Salah A. Aly, Tareq Y. Al-Naffouri","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-20T08:48:29Z","title":"Robust Node Estimation and Topology Discovery Algorithm in Large-Scale Wireless Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04921","kind":"arxiv","version":1},"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:6321af51970d5bc2f3a0829839e7b3e8a8e04eedc5b85020122bbaf91091925e","target":"record","created_at":"2026-05-18T01:35:00Z","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":"9775381fe67fc00af9d9caf751d6909d8f2e9fbacf16c0c1908eda1681348dec","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-20T08:48:29Z","title_canon_sha256":"43166e6ad01cafdb4c8fd43a92175d30e5af747847c0f54ea24e3674057209aa"},"schema_version":"1.0","source":{"id":"1508.04921","kind":"arxiv","version":1}},"canonical_sha256":"c9df28d0d2fd19a1f49953917c6f230315d8361d7ce4e558a0ce710db387641a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9df28d0d2fd19a1f49953917c6f230315d8361d7ce4e558a0ce710db387641a","first_computed_at":"2026-05-18T01:35:00.230843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:00.230843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uhj4xE5HeMA6A/mP3cHfpcjohB+DRyHZ1Bsm1zo5oRWykgHSTJN5IKYLlpTDeSvCks8fMS08WQCxohP7J2SzCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:00.231467Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.04921","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6321af51970d5bc2f3a0829839e7b3e8a8e04eedc5b85020122bbaf91091925e","sha256:d1f327ae73bd21f64dc661c7dd975c8d495b2fef0b8ee272adb7ad0222fc43ac"],"state_sha256":"9faada16ec95d891eb6bed8850bac00c85f574e399f513887acd738a42fe2c31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iJCHZNroSMj8zJNGa9WcJKHsQGQN0wQNRtEWuZs1UXyyB6dwcMTHz5YwaKZke0BvJoAUpukzBSvJ5iUZqgOdAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:23:04.408641Z","bundle_sha256":"1750ccaaf30c8d8c6e629c1bbeec38962372d7334d70eb4826804e2fda5c0158"}}