{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XGUHLQ6J57ZKQBOH2B3CI3N7LX","short_pith_number":"pith:XGUHLQ6J","canonical_record":{"source":{"id":"1605.05614","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-18T15:28:36Z","cross_cats_sorted":[],"title_canon_sha256":"351042a0c65eb98707ad69d26a634044f2cf6e5e07ebdf569ed81d87de017b5a","abstract_canon_sha256":"56cf4f7c7dab429d038c6afe837b6e42f64bef7bb1087f687762fa3ab7761786"},"schema_version":"1.0"},"canonical_sha256":"b9a875c3c9eff2a805c7d076246dbf5df0eb39b0e60e3ae3e6040906554229a8","source":{"kind":"arxiv","id":"1605.05614","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05614","created_at":"2026-05-18T01:11:07Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05614v2","created_at":"2026-05-18T01:11:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05614","created_at":"2026-05-18T01:11:07Z"},{"alias_kind":"pith_short_12","alias_value":"XGUHLQ6J57ZK","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XGUHLQ6J57ZKQBOH","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XGUHLQ6J","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XGUHLQ6J57ZKQBOH2B3CI3N7LX","target":"record","payload":{"canonical_record":{"source":{"id":"1605.05614","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-18T15:28:36Z","cross_cats_sorted":[],"title_canon_sha256":"351042a0c65eb98707ad69d26a634044f2cf6e5e07ebdf569ed81d87de017b5a","abstract_canon_sha256":"56cf4f7c7dab429d038c6afe837b6e42f64bef7bb1087f687762fa3ab7761786"},"schema_version":"1.0"},"canonical_sha256":"b9a875c3c9eff2a805c7d076246dbf5df0eb39b0e60e3ae3e6040906554229a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:07.943623Z","signature_b64":"qDOscup6y1KPsy7ER5pTtWxws7asHAMZp3HssvOaH0vhxZ8MQ0Vjg+ouuj+WqfjHzNI+GY1KIbOCgwK9cnIXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9a875c3c9eff2a805c7d076246dbf5df0eb39b0e60e3ae3e6040906554229a8","last_reissued_at":"2026-05-18T01:11:07.943033Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:07.943033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.05614","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-18T01:11:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PKUtbHoh4MUGIgugSiIeU5rlwMb+AyPOLLsljSDu25vZ6LxF2LP3Ph/+RU4zush4ZMvwKqZAcpXDAbH7VCw3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:26:43.969147Z"},"content_sha256":"d281cff0fba27423ea4ba5d3310b1852b567603cab52a8eb437ca16717cb7b16","schema_version":"1.0","event_id":"sha256:d281cff0fba27423ea4ba5d3310b1852b567603cab52a8eb437ca16717cb7b16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XGUHLQ6J57ZKQBOH2B3CI3N7LX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Slotless Protocols for Fast and Energy-Efficient Neighbor Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Marco Saur, Philipp H. Kindt, Samarjit Chakraborty","submitted_at":"2016-05-18T15:28:36Z","abstract_excerpt":"In mobile ad-hoc networks, neighbor discovery protocols are used to find surrounding devices and to establish a first contact between them. Since the clocks of the devices are not synchronized and their energy-budgets are limited, usually duty-cycled, asynchronous discovery protocols are applied. Only if two devices are awake at the same point in time, they can rendezvous. Currently, time-slotted protocols, which subdivide time into multiple intervals with equal lengths (slots), are considered to be the most efficient discovery schemes. In this paper, we break away from the assumption of slott"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05614","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-18T01:11:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6J4xkt2XTNCyi9Fu9GkQ+0JQzgdlePtgd4R0+7q8dFW+Ft/E3L9xxW623K1wbvB8SihfWngmZi5YJgC3bB5SDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:26:43.969610Z"},"content_sha256":"ed404c8b9b95af4707f5affc2afcdc4ddf2d1780f7dec8b030c534b328be5e87","schema_version":"1.0","event_id":"sha256:ed404c8b9b95af4707f5affc2afcdc4ddf2d1780f7dec8b030c534b328be5e87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XGUHLQ6J57ZKQBOH2B3CI3N7LX/bundle.json","state_url":"https://pith.science/pith/XGUHLQ6J57ZKQBOH2B3CI3N7LX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XGUHLQ6J57ZKQBOH2B3CI3N7LX/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-24T13:26:43Z","links":{"resolver":"https://pith.science/pith/XGUHLQ6J57ZKQBOH2B3CI3N7LX","bundle":"https://pith.science/pith/XGUHLQ6J57ZKQBOH2B3CI3N7LX/bundle.json","state":"https://pith.science/pith/XGUHLQ6J57ZKQBOH2B3CI3N7LX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XGUHLQ6J57ZKQBOH2B3CI3N7LX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XGUHLQ6J57ZKQBOH2B3CI3N7LX","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":"56cf4f7c7dab429d038c6afe837b6e42f64bef7bb1087f687762fa3ab7761786","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-18T15:28:36Z","title_canon_sha256":"351042a0c65eb98707ad69d26a634044f2cf6e5e07ebdf569ed81d87de017b5a"},"schema_version":"1.0","source":{"id":"1605.05614","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05614","created_at":"2026-05-18T01:11:07Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05614v2","created_at":"2026-05-18T01:11:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05614","created_at":"2026-05-18T01:11:07Z"},{"alias_kind":"pith_short_12","alias_value":"XGUHLQ6J57ZK","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XGUHLQ6J57ZKQBOH","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XGUHLQ6J","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:ed404c8b9b95af4707f5affc2afcdc4ddf2d1780f7dec8b030c534b328be5e87","target":"graph","created_at":"2026-05-18T01:11:07Z","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":"In mobile ad-hoc networks, neighbor discovery protocols are used to find surrounding devices and to establish a first contact between them. Since the clocks of the devices are not synchronized and their energy-budgets are limited, usually duty-cycled, asynchronous discovery protocols are applied. Only if two devices are awake at the same point in time, they can rendezvous. Currently, time-slotted protocols, which subdivide time into multiple intervals with equal lengths (slots), are considered to be the most efficient discovery schemes. In this paper, we break away from the assumption of slott","authors_text":"Marco Saur, Philipp H. Kindt, Samarjit Chakraborty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-18T15:28:36Z","title":"Slotless Protocols for Fast and Energy-Efficient Neighbor Discovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05614","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:d281cff0fba27423ea4ba5d3310b1852b567603cab52a8eb437ca16717cb7b16","target":"record","created_at":"2026-05-18T01:11:07Z","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":"56cf4f7c7dab429d038c6afe837b6e42f64bef7bb1087f687762fa3ab7761786","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-18T15:28:36Z","title_canon_sha256":"351042a0c65eb98707ad69d26a634044f2cf6e5e07ebdf569ed81d87de017b5a"},"schema_version":"1.0","source":{"id":"1605.05614","kind":"arxiv","version":2}},"canonical_sha256":"b9a875c3c9eff2a805c7d076246dbf5df0eb39b0e60e3ae3e6040906554229a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9a875c3c9eff2a805c7d076246dbf5df0eb39b0e60e3ae3e6040906554229a8","first_computed_at":"2026-05-18T01:11:07.943033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:07.943033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qDOscup6y1KPsy7ER5pTtWxws7asHAMZp3HssvOaH0vhxZ8MQ0Vjg+ouuj+WqfjHzNI+GY1KIbOCgwK9cnIXCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:07.943623Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05614","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d281cff0fba27423ea4ba5d3310b1852b567603cab52a8eb437ca16717cb7b16","sha256:ed404c8b9b95af4707f5affc2afcdc4ddf2d1780f7dec8b030c534b328be5e87"],"state_sha256":"b844e2654f701e090ef4472576e96cba38ad52692315ed8389cea5562f13b64a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PkGqvauGnqpWsv7D1MDoXopmaf/kk/My13oEdkEvobP7zUlYJBSBFn/vsD5+vaaLeakVTufULYqhRtCJ3M01Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T13:26:43.971959Z","bundle_sha256":"6098c8b866e32a3d17b25f9d13b8c57cfe482d943c171ec2aeb68b5acec2f700"}}