{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JGDF6Z7GB5RHPUZN5SRODKDG6N","short_pith_number":"pith:JGDF6Z7G","canonical_record":{"source":{"id":"1307.3630","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-13T08:20:45Z","cross_cats_sorted":[],"title_canon_sha256":"e5121cfe38762d92be70209f94c961059e7d3833428361cf78eade0f8ab5e8de","abstract_canon_sha256":"7508925307394674dca6bfb17d81eab1eb712da88c1955bbe1ba8845f48b7279"},"schema_version":"1.0"},"canonical_sha256":"49865f67e60f6277d32deca2e1a866f3734cd4533bd6d3fbd43d333505790ede","source":{"kind":"arxiv","id":"1307.3630","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3630","created_at":"2026-05-18T03:01:13Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3630v3","created_at":"2026-05-18T03:01:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3630","created_at":"2026-05-18T03:01:13Z"},{"alias_kind":"pith_short_12","alias_value":"JGDF6Z7GB5RH","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JGDF6Z7GB5RHPUZN","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JGDF6Z7G","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JGDF6Z7GB5RHPUZN5SRODKDG6N","target":"record","payload":{"canonical_record":{"source":{"id":"1307.3630","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-13T08:20:45Z","cross_cats_sorted":[],"title_canon_sha256":"e5121cfe38762d92be70209f94c961059e7d3833428361cf78eade0f8ab5e8de","abstract_canon_sha256":"7508925307394674dca6bfb17d81eab1eb712da88c1955bbe1ba8845f48b7279"},"schema_version":"1.0"},"canonical_sha256":"49865f67e60f6277d32deca2e1a866f3734cd4533bd6d3fbd43d333505790ede","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:13.653080Z","signature_b64":"sFCWqOLoHptoMeNpuU4d2Vix7tTVhEAyijrFoX/6GhemljRqxK2m8+xGFaKp1FOlrvxEiBjlR0+Gs+n1AdryBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49865f67e60f6277d32deca2e1a866f3734cd4533bd6d3fbd43d333505790ede","last_reissued_at":"2026-05-18T03:01:13.652375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:13.652375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.3630","source_version":3,"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-18T03:01:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u+2RcVf1yoqIkxpFZCLDkYSpHjDChKScAoNw1KlxdifAxgDK0fs1WUR+1XvmDb9IbF+Fpxyh8VCPibGz1Jj/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:59:02.023341Z"},"content_sha256":"0153e2affb96c59083643a360e225446d5a05d92de9985ed5994370c1132c6d0","schema_version":"1.0","event_id":"sha256:0153e2affb96c59083643a360e225446d5a05d92de9985ed5994370c1132c6d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JGDF6Z7GB5RHPUZN5SRODKDG6N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mc-Dis: A Heterogeneous Neighbor Discovery Protocol for Multi-channel Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Kaigui Bian, Lin Chen","submitted_at":"2013-07-13T08:20:45Z","abstract_excerpt":"In distributed wireless networks, neighbor discovery is one of the bootstrapping primitives in supporting many important network functionalities. Existing neighbor discovery protocols mostly assume a single-channel network model and can only support a subset of duty cycles, thus limiting the energy conservation levels of wireless devices. In this paper, we study the neighbor discovery problem in multi-channel networks where the wireless nodes have heterogeneous duty cycles, asynchronous clocks and asymmetrical channel perceptions, which we formulate as heterogeneous neighbor discovery problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3630","kind":"arxiv","version":3},"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-18T03:01:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y3IrEbtK/qGTHI9NdAY0ugmueuBTphEm/aIkWxR8x7/iUBSMMPC+fSElBoF+tbJnSO4CRgkFZGAkovulzRwqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:59:02.023691Z"},"content_sha256":"d57ebf65511ac1a21c234029241c7d8bf24ee78cad9ab18c005722850975aa8b","schema_version":"1.0","event_id":"sha256:d57ebf65511ac1a21c234029241c7d8bf24ee78cad9ab18c005722850975aa8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGDF6Z7GB5RHPUZN5SRODKDG6N/bundle.json","state_url":"https://pith.science/pith/JGDF6Z7GB5RHPUZN5SRODKDG6N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGDF6Z7GB5RHPUZN5SRODKDG6N/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-01T07:59:02Z","links":{"resolver":"https://pith.science/pith/JGDF6Z7GB5RHPUZN5SRODKDG6N","bundle":"https://pith.science/pith/JGDF6Z7GB5RHPUZN5SRODKDG6N/bundle.json","state":"https://pith.science/pith/JGDF6Z7GB5RHPUZN5SRODKDG6N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGDF6Z7GB5RHPUZN5SRODKDG6N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JGDF6Z7GB5RHPUZN5SRODKDG6N","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":"7508925307394674dca6bfb17d81eab1eb712da88c1955bbe1ba8845f48b7279","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-13T08:20:45Z","title_canon_sha256":"e5121cfe38762d92be70209f94c961059e7d3833428361cf78eade0f8ab5e8de"},"schema_version":"1.0","source":{"id":"1307.3630","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3630","created_at":"2026-05-18T03:01:13Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3630v3","created_at":"2026-05-18T03:01:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3630","created_at":"2026-05-18T03:01:13Z"},{"alias_kind":"pith_short_12","alias_value":"JGDF6Z7GB5RH","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JGDF6Z7GB5RHPUZN","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JGDF6Z7G","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:d57ebf65511ac1a21c234029241c7d8bf24ee78cad9ab18c005722850975aa8b","target":"graph","created_at":"2026-05-18T03:01:13Z","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 distributed wireless networks, neighbor discovery is one of the bootstrapping primitives in supporting many important network functionalities. Existing neighbor discovery protocols mostly assume a single-channel network model and can only support a subset of duty cycles, thus limiting the energy conservation levels of wireless devices. In this paper, we study the neighbor discovery problem in multi-channel networks where the wireless nodes have heterogeneous duty cycles, asynchronous clocks and asymmetrical channel perceptions, which we formulate as heterogeneous neighbor discovery problem.","authors_text":"Kaigui Bian, Lin Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-13T08:20:45Z","title":"Mc-Dis: A Heterogeneous Neighbor Discovery Protocol for Multi-channel Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3630","kind":"arxiv","version":3},"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:0153e2affb96c59083643a360e225446d5a05d92de9985ed5994370c1132c6d0","target":"record","created_at":"2026-05-18T03:01:13Z","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":"7508925307394674dca6bfb17d81eab1eb712da88c1955bbe1ba8845f48b7279","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-13T08:20:45Z","title_canon_sha256":"e5121cfe38762d92be70209f94c961059e7d3833428361cf78eade0f8ab5e8de"},"schema_version":"1.0","source":{"id":"1307.3630","kind":"arxiv","version":3}},"canonical_sha256":"49865f67e60f6277d32deca2e1a866f3734cd4533bd6d3fbd43d333505790ede","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49865f67e60f6277d32deca2e1a866f3734cd4533bd6d3fbd43d333505790ede","first_computed_at":"2026-05-18T03:01:13.652375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:13.652375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sFCWqOLoHptoMeNpuU4d2Vix7tTVhEAyijrFoX/6GhemljRqxK2m8+xGFaKp1FOlrvxEiBjlR0+Gs+n1AdryBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:13.653080Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.3630","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0153e2affb96c59083643a360e225446d5a05d92de9985ed5994370c1132c6d0","sha256:d57ebf65511ac1a21c234029241c7d8bf24ee78cad9ab18c005722850975aa8b"],"state_sha256":"e0b9545ac4b056d85d48ce0e28a7dbc2b9029cd420b0394b9f29b7ac5a5d7aa4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Msv5HGgZeFwz57OfDJgWDrJf+l3bLG/hM3RtaPkVM8L6RhVSagXv1CJ9vOCevafRWn39lFubUult+FNLm65/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:59:02.025656Z","bundle_sha256":"b6854ec9ade18953e4fd6a2471f8c1339b0e3d8f598d98e979a2b4656aebac1b"}}