{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:G7J35IVHOXJDM7IKBJTB32RCOC","short_pith_number":"pith:G7J35IVH","canonical_record":{"source":{"id":"1807.04618","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-12T14:11:40Z","cross_cats_sorted":[],"title_canon_sha256":"b4eac072e14499ca321acfa9ed74009d5b0fcb765113d6fe00ee64926f03e77f","abstract_canon_sha256":"6e4e7f115c3a6622b2d5645d7a1beb867b1f4f318d33b0795224558e107f8721"},"schema_version":"1.0"},"canonical_sha256":"37d3bea2a775d2367d0a0a661dea2270bb8bcd395e2a08cc22ccb020bb70664c","source":{"kind":"arxiv","id":"1807.04618","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04618","created_at":"2026-05-18T00:10:36Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04618v2","created_at":"2026-05-18T00:10:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04618","created_at":"2026-05-18T00:10:36Z"},{"alias_kind":"pith_short_12","alias_value":"G7J35IVHOXJD","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G7J35IVHOXJDM7IK","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G7J35IVH","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:G7J35IVHOXJDM7IKBJTB32RCOC","target":"record","payload":{"canonical_record":{"source":{"id":"1807.04618","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-12T14:11:40Z","cross_cats_sorted":[],"title_canon_sha256":"b4eac072e14499ca321acfa9ed74009d5b0fcb765113d6fe00ee64926f03e77f","abstract_canon_sha256":"6e4e7f115c3a6622b2d5645d7a1beb867b1f4f318d33b0795224558e107f8721"},"schema_version":"1.0"},"canonical_sha256":"37d3bea2a775d2367d0a0a661dea2270bb8bcd395e2a08cc22ccb020bb70664c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:36.639337Z","signature_b64":"+ZRV21K7hrkHwIFYoS+UKK7SSSc/+nvUTxqoKSlbNhYLxNQ066Cee/m278cezKdMtXWnSw0MgiD53rlxwWI4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37d3bea2a775d2367d0a0a661dea2270bb8bcd395e2a08cc22ccb020bb70664c","last_reissued_at":"2026-05-18T00:10:36.638763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:36.638763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.04618","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-18T00:10:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9CzWS9s0Kf7UfWya2tkteerH6zSxcPd0ecJzuRC3VR45GGnmHbGoImDu1lyO6k++An/aUGuFUFpJoSk1o9fGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:40:13.987500Z"},"content_sha256":"1ac9a068c9ba121a81fd2987cb74eddf09ba81b244a221250a5f264fb424fc43","schema_version":"1.0","event_id":"sha256:1ac9a068c9ba121a81fd2987cb74eddf09ba81b244a221250a5f264fb424fc43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:G7J35IVHOXJDM7IKBJTB32RCOC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proofs and Performance Evaluation of Greedy Multi-Channel Neighbor Discovery Approaches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Konstantin Miller, Niels Karowski","submitted_at":"2018-07-12T14:11:40Z","abstract_excerpt":"The accelerating penetration of physical environments by objects with information processing and wireless communication capabilities requires approaches to find potential communication partners and discover services. In the present work, we focus on passive discovery approaches in multi-channel wireless networks based on overhearing periodic beacon transmissions of neighboring devices which are otherwise agnostic to the discovery process. We propose a family of low-complexity algorithms that generate listening schedules guaranteed to discover all neighbors. The presented approaches simultaneou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04618","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-18T00:10:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gJxQwN89tprHB1PnCCS97f2i/IKCFLnH6my8nqcHfc+yGktbYykfKoPbOJ1be/oI4xK+vJen4/4AP+1ATaTqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:40:13.987839Z"},"content_sha256":"3a7f23ba4d3bff88baf6ff53696a6007813c168b9fedd42b74134c626402cc35","schema_version":"1.0","event_id":"sha256:3a7f23ba4d3bff88baf6ff53696a6007813c168b9fedd42b74134c626402cc35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G7J35IVHOXJDM7IKBJTB32RCOC/bundle.json","state_url":"https://pith.science/pith/G7J35IVHOXJDM7IKBJTB32RCOC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G7J35IVHOXJDM7IKBJTB32RCOC/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-01T02:40:13Z","links":{"resolver":"https://pith.science/pith/G7J35IVHOXJDM7IKBJTB32RCOC","bundle":"https://pith.science/pith/G7J35IVHOXJDM7IKBJTB32RCOC/bundle.json","state":"https://pith.science/pith/G7J35IVHOXJDM7IKBJTB32RCOC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G7J35IVHOXJDM7IKBJTB32RCOC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:G7J35IVHOXJDM7IKBJTB32RCOC","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":"6e4e7f115c3a6622b2d5645d7a1beb867b1f4f318d33b0795224558e107f8721","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-12T14:11:40Z","title_canon_sha256":"b4eac072e14499ca321acfa9ed74009d5b0fcb765113d6fe00ee64926f03e77f"},"schema_version":"1.0","source":{"id":"1807.04618","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04618","created_at":"2026-05-18T00:10:36Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04618v2","created_at":"2026-05-18T00:10:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04618","created_at":"2026-05-18T00:10:36Z"},{"alias_kind":"pith_short_12","alias_value":"G7J35IVHOXJD","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G7J35IVHOXJDM7IK","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G7J35IVH","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:3a7f23ba4d3bff88baf6ff53696a6007813c168b9fedd42b74134c626402cc35","target":"graph","created_at":"2026-05-18T00:10:36Z","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":"The accelerating penetration of physical environments by objects with information processing and wireless communication capabilities requires approaches to find potential communication partners and discover services. In the present work, we focus on passive discovery approaches in multi-channel wireless networks based on overhearing periodic beacon transmissions of neighboring devices which are otherwise agnostic to the discovery process. We propose a family of low-complexity algorithms that generate listening schedules guaranteed to discover all neighbors. The presented approaches simultaneou","authors_text":"Konstantin Miller, Niels Karowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-12T14:11:40Z","title":"Proofs and Performance Evaluation of Greedy Multi-Channel Neighbor Discovery Approaches"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04618","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:1ac9a068c9ba121a81fd2987cb74eddf09ba81b244a221250a5f264fb424fc43","target":"record","created_at":"2026-05-18T00:10:36Z","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":"6e4e7f115c3a6622b2d5645d7a1beb867b1f4f318d33b0795224558e107f8721","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-12T14:11:40Z","title_canon_sha256":"b4eac072e14499ca321acfa9ed74009d5b0fcb765113d6fe00ee64926f03e77f"},"schema_version":"1.0","source":{"id":"1807.04618","kind":"arxiv","version":2}},"canonical_sha256":"37d3bea2a775d2367d0a0a661dea2270bb8bcd395e2a08cc22ccb020bb70664c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37d3bea2a775d2367d0a0a661dea2270bb8bcd395e2a08cc22ccb020bb70664c","first_computed_at":"2026-05-18T00:10:36.638763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:36.638763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+ZRV21K7hrkHwIFYoS+UKK7SSSc/+nvUTxqoKSlbNhYLxNQ066Cee/m278cezKdMtXWnSw0MgiD53rlxwWI4Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:36.639337Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04618","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ac9a068c9ba121a81fd2987cb74eddf09ba81b244a221250a5f264fb424fc43","sha256:3a7f23ba4d3bff88baf6ff53696a6007813c168b9fedd42b74134c626402cc35"],"state_sha256":"09a6e0da19839182b2730b85c04f04e9babd10e8c493262966126a9d68aff844"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fbgl2JyCaQJnIXlvbsFZfKbTJoRClBQKfhIuN1ztIfsArOyj7zekQmUDb6CCN5nEKyYmSzX1CLmf+klMagmcBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:40:13.989841Z","bundle_sha256":"ef23fcd5e5cf9430f459d8723b64f23d5a151f8bf8f8b93ee6f5705248c257db"}}