{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OIRGOFUODVBGMT5QBOOBLNGB47","short_pith_number":"pith:OIRGOFUO","canonical_record":{"source":{"id":"1904.06328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-12T17:12:23Z","cross_cats_sorted":[],"title_canon_sha256":"78f5e62493178e3dd3fa2008d718e2959e8916c13d6051a2902cceba9146a923","abstract_canon_sha256":"bbf3234dbc81088cd5a74fbdd631020e0350732bd755f885db96c996e1896b16"},"schema_version":"1.0"},"canonical_sha256":"722267168e1d42664fb00b9c15b4c1e7f28d63fe048a2428ba9c3287dfa061b3","source":{"kind":"arxiv","id":"1904.06328","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06328","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06328v1","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06328","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"OIRGOFUODVBG","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OIRGOFUODVBGMT5Q","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OIRGOFUO","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OIRGOFUODVBGMT5QBOOBLNGB47","target":"record","payload":{"canonical_record":{"source":{"id":"1904.06328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-12T17:12:23Z","cross_cats_sorted":[],"title_canon_sha256":"78f5e62493178e3dd3fa2008d718e2959e8916c13d6051a2902cceba9146a923","abstract_canon_sha256":"bbf3234dbc81088cd5a74fbdd631020e0350732bd755f885db96c996e1896b16"},"schema_version":"1.0"},"canonical_sha256":"722267168e1d42664fb00b9c15b4c1e7f28d63fe048a2428ba9c3287dfa061b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:43.569254Z","signature_b64":"vJ8osuevqsOKiM5A037OGImfvkFlBIyAAg7o6UQ4HaCL/A+k0n0gMyEEjwlzKzBDfVw/q2WISN1Nr5pHQRn8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"722267168e1d42664fb00b9c15b4c1e7f28d63fe048a2428ba9c3287dfa061b3","last_reissued_at":"2026-05-17T23:48:43.568662Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:43.568662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.06328","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-17T23:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o80PuJ8+DRcRngWNWFxL0Tyf1/njbZUJKnNabwrlFg4HjEeO13/Qed5FdQTPLwWeOz0SBEwaZgqzWKTynVB7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:34:31.196731Z"},"content_sha256":"5ba3add7b66d4f41ec300290a7d9af1bf13d04df81944b2849892e83f0eaf459","schema_version":"1.0","event_id":"sha256:5ba3add7b66d4f41ec300290a7d9af1bf13d04df81944b2849892e83f0eaf459"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OIRGOFUODVBGMT5QBOOBLNGB47","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and Resource Competitive Broadcast in Multi-channel Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chaodong Zheng, Haimin Chen","submitted_at":"2019-04-12T17:12:23Z","abstract_excerpt":"Consider a single-hop, multi-channel, synchronous radio network in which a source node needs to disseminate a message to all other $n-1$ nodes. An adversary called Eve, which captures environmental noise and potentially malicious interference, aims to disrupt this process via jamming. Assume sending, listening, or jamming on one channel for one time slot costs unit energy. The question is, if Eve spends $T$ units of energy on jamming, can we devise broadcast algorithms in which each node's cost is $o(T)$? Previous results show such resource competitive algorithms do exist in the single-channel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06328","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-17T23:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q1UHthhugYPeDvNba095PrjTD4FjL5QVf1eMMahCsDUxcLIgJzUqYAAQ5pP0LQJpayz3MegPkveSRdTO1HIbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:34:31.197087Z"},"content_sha256":"a720bc0c052f48a461d2c5fea9e0174a92ebe078d7320e09b65bf78adf5335dc","schema_version":"1.0","event_id":"sha256:a720bc0c052f48a461d2c5fea9e0174a92ebe078d7320e09b65bf78adf5335dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OIRGOFUODVBGMT5QBOOBLNGB47/bundle.json","state_url":"https://pith.science/pith/OIRGOFUODVBGMT5QBOOBLNGB47/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OIRGOFUODVBGMT5QBOOBLNGB47/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-02T10:34:31Z","links":{"resolver":"https://pith.science/pith/OIRGOFUODVBGMT5QBOOBLNGB47","bundle":"https://pith.science/pith/OIRGOFUODVBGMT5QBOOBLNGB47/bundle.json","state":"https://pith.science/pith/OIRGOFUODVBGMT5QBOOBLNGB47/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OIRGOFUODVBGMT5QBOOBLNGB47/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OIRGOFUODVBGMT5QBOOBLNGB47","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":"bbf3234dbc81088cd5a74fbdd631020e0350732bd755f885db96c996e1896b16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-12T17:12:23Z","title_canon_sha256":"78f5e62493178e3dd3fa2008d718e2959e8916c13d6051a2902cceba9146a923"},"schema_version":"1.0","source":{"id":"1904.06328","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06328","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06328v1","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06328","created_at":"2026-05-17T23:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"OIRGOFUODVBG","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OIRGOFUODVBGMT5Q","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OIRGOFUO","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:a720bc0c052f48a461d2c5fea9e0174a92ebe078d7320e09b65bf78adf5335dc","target":"graph","created_at":"2026-05-17T23:48:43Z","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":"Consider a single-hop, multi-channel, synchronous radio network in which a source node needs to disseminate a message to all other $n-1$ nodes. An adversary called Eve, which captures environmental noise and potentially malicious interference, aims to disrupt this process via jamming. Assume sending, listening, or jamming on one channel for one time slot costs unit energy. The question is, if Eve spends $T$ units of energy on jamming, can we devise broadcast algorithms in which each node's cost is $o(T)$? Previous results show such resource competitive algorithms do exist in the single-channel","authors_text":"Chaodong Zheng, Haimin Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-12T17:12:23Z","title":"Fast and Resource Competitive Broadcast in Multi-channel Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06328","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:5ba3add7b66d4f41ec300290a7d9af1bf13d04df81944b2849892e83f0eaf459","target":"record","created_at":"2026-05-17T23:48:43Z","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":"bbf3234dbc81088cd5a74fbdd631020e0350732bd755f885db96c996e1896b16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-12T17:12:23Z","title_canon_sha256":"78f5e62493178e3dd3fa2008d718e2959e8916c13d6051a2902cceba9146a923"},"schema_version":"1.0","source":{"id":"1904.06328","kind":"arxiv","version":1}},"canonical_sha256":"722267168e1d42664fb00b9c15b4c1e7f28d63fe048a2428ba9c3287dfa061b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"722267168e1d42664fb00b9c15b4c1e7f28d63fe048a2428ba9c3287dfa061b3","first_computed_at":"2026-05-17T23:48:43.568662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:43.568662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vJ8osuevqsOKiM5A037OGImfvkFlBIyAAg7o6UQ4HaCL/A+k0n0gMyEEjwlzKzBDfVw/q2WISN1Nr5pHQRn8AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:43.569254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.06328","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ba3add7b66d4f41ec300290a7d9af1bf13d04df81944b2849892e83f0eaf459","sha256:a720bc0c052f48a461d2c5fea9e0174a92ebe078d7320e09b65bf78adf5335dc"],"state_sha256":"9b2065026d03838dd69234fda6178412820d20da09ade81934e8b3a087f7bd80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"57wxi7LGGB6eIZHxwwc6vL4i4eptvQJ7bBbxdZCuoFOzlr/9cNf/w/iDCG4WbJ5UZtf6VD7Pe/p3RuwaxnNuBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:34:31.199146Z","bundle_sha256":"d5bd56fd46c867d723b35693703210a4ba113b85eff48754eba9dc2530057bc4"}}