{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:L5BMMDPRJXRZUYQDR355K2BBYK","short_pith_number":"pith:L5BMMDPR","canonical_record":{"source":{"id":"1403.4637","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-18T22:41:49Z","cross_cats_sorted":[],"title_canon_sha256":"034dcad3d236405442532c68b86bb747061ff6795274b4a2382204d456ee4b3c","abstract_canon_sha256":"51997fdf1fec35c6c2b8da9e6c445bfc699c83c017423ce32f4a74a40c838851"},"schema_version":"1.0"},"canonical_sha256":"5f42c60df14de39a62038efbd56821c299dbb29edf1baf0ffccfd19a91ede6d5","source":{"kind":"arxiv","id":"1403.4637","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4637","created_at":"2026-05-18T02:55:05Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4637v2","created_at":"2026-05-18T02:55:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4637","created_at":"2026-05-18T02:55:05Z"},{"alias_kind":"pith_short_12","alias_value":"L5BMMDPRJXRZ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L5BMMDPRJXRZUYQD","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L5BMMDPR","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:L5BMMDPRJXRZUYQDR355K2BBYK","target":"record","payload":{"canonical_record":{"source":{"id":"1403.4637","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-18T22:41:49Z","cross_cats_sorted":[],"title_canon_sha256":"034dcad3d236405442532c68b86bb747061ff6795274b4a2382204d456ee4b3c","abstract_canon_sha256":"51997fdf1fec35c6c2b8da9e6c445bfc699c83c017423ce32f4a74a40c838851"},"schema_version":"1.0"},"canonical_sha256":"5f42c60df14de39a62038efbd56821c299dbb29edf1baf0ffccfd19a91ede6d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:05.396991Z","signature_b64":"AIA2zwKm261aCSiv34Z6ioa55Pm/IXkFF8UYi8Bop1KCiggr56OflndS2y8mvYsQQembbBojYRXx97WsyUDeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f42c60df14de39a62038efbd56821c299dbb29edf1baf0ffccfd19a91ede6d5","last_reissued_at":"2026-05-18T02:55:05.396512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:05.396512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.4637","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-18T02:55:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9TpAFhGJ3O5yReAQDsHixjJqWwsiyzniAkFbnwUB4UMqMRal+gQa9vy5DWHdlRkgl6TYOfZrxg53lgYFmrFLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:26:41.635245Z"},"content_sha256":"500ecf69b76f666b4a1f4cb79f87d90e19be0c27a26563cf8bfddf871fc37a7d","schema_version":"1.0","event_id":"sha256:500ecf69b76f666b4a1f4cb79f87d90e19be0c27a26563cf8bfddf871fc37a7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:L5BMMDPRJXRZUYQDR355K2BBYK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Maximal Concurrency and Low Latency Distributed Scheduling Protocol for Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hongwei Zhang, Xiaohui Liu","submitted_at":"2014-03-18T22:41:49Z","abstract_excerpt":"Existing work that schedules concurrent transmissions collision-free suffers from low channel utilization. We propose the Optimal Node Activation Multiple Access (ONAMA) protocol to achieve maximal channel spatial reuse through a distributed maximal independent set (DMIS) algorithm. To overcome DMIS's excessive delay in finding a maximal independent set, we devise a novel technique called pipelined precomputation that decouples DMIS from data transmission. We implement ONAMA on resource-constrained TelosB motes using TinyOS. Extensive measurements on two testbeds independently attest to ONAMA'"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4637","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-18T02:55:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZT1GEZvqrDVbbB7LccwFQhDjU5ZCvoMDsqTWP/dO2rSn1Fr6u/HxjAZ8EyBSgBzpP5W3zd6AdyW6sKm+a72QBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:26:41.635992Z"},"content_sha256":"2bc73304c61760eb8c3aa0f88db8ef66c983dd62a33089b0d28ba14d0944f41d","schema_version":"1.0","event_id":"sha256:2bc73304c61760eb8c3aa0f88db8ef66c983dd62a33089b0d28ba14d0944f41d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L5BMMDPRJXRZUYQDR355K2BBYK/bundle.json","state_url":"https://pith.science/pith/L5BMMDPRJXRZUYQDR355K2BBYK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L5BMMDPRJXRZUYQDR355K2BBYK/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-10T05:26:41Z","links":{"resolver":"https://pith.science/pith/L5BMMDPRJXRZUYQDR355K2BBYK","bundle":"https://pith.science/pith/L5BMMDPRJXRZUYQDR355K2BBYK/bundle.json","state":"https://pith.science/pith/L5BMMDPRJXRZUYQDR355K2BBYK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L5BMMDPRJXRZUYQDR355K2BBYK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:L5BMMDPRJXRZUYQDR355K2BBYK","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":"51997fdf1fec35c6c2b8da9e6c445bfc699c83c017423ce32f4a74a40c838851","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-18T22:41:49Z","title_canon_sha256":"034dcad3d236405442532c68b86bb747061ff6795274b4a2382204d456ee4b3c"},"schema_version":"1.0","source":{"id":"1403.4637","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4637","created_at":"2026-05-18T02:55:05Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4637v2","created_at":"2026-05-18T02:55:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4637","created_at":"2026-05-18T02:55:05Z"},{"alias_kind":"pith_short_12","alias_value":"L5BMMDPRJXRZ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L5BMMDPRJXRZUYQD","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L5BMMDPR","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:2bc73304c61760eb8c3aa0f88db8ef66c983dd62a33089b0d28ba14d0944f41d","target":"graph","created_at":"2026-05-18T02:55:05Z","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":"Existing work that schedules concurrent transmissions collision-free suffers from low channel utilization. We propose the Optimal Node Activation Multiple Access (ONAMA) protocol to achieve maximal channel spatial reuse through a distributed maximal independent set (DMIS) algorithm. To overcome DMIS's excessive delay in finding a maximal independent set, we devise a novel technique called pipelined precomputation that decouples DMIS from data transmission. We implement ONAMA on resource-constrained TelosB motes using TinyOS. Extensive measurements on two testbeds independently attest to ONAMA'","authors_text":"Hongwei Zhang, Xiaohui Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-18T22:41:49Z","title":"A Maximal Concurrency and Low Latency Distributed Scheduling Protocol for Wireless Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4637","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:500ecf69b76f666b4a1f4cb79f87d90e19be0c27a26563cf8bfddf871fc37a7d","target":"record","created_at":"2026-05-18T02:55:05Z","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":"51997fdf1fec35c6c2b8da9e6c445bfc699c83c017423ce32f4a74a40c838851","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-18T22:41:49Z","title_canon_sha256":"034dcad3d236405442532c68b86bb747061ff6795274b4a2382204d456ee4b3c"},"schema_version":"1.0","source":{"id":"1403.4637","kind":"arxiv","version":2}},"canonical_sha256":"5f42c60df14de39a62038efbd56821c299dbb29edf1baf0ffccfd19a91ede6d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f42c60df14de39a62038efbd56821c299dbb29edf1baf0ffccfd19a91ede6d5","first_computed_at":"2026-05-18T02:55:05.396512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:05.396512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AIA2zwKm261aCSiv34Z6ioa55Pm/IXkFF8UYi8Bop1KCiggr56OflndS2y8mvYsQQembbBojYRXx97WsyUDeDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:05.396991Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.4637","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:500ecf69b76f666b4a1f4cb79f87d90e19be0c27a26563cf8bfddf871fc37a7d","sha256:2bc73304c61760eb8c3aa0f88db8ef66c983dd62a33089b0d28ba14d0944f41d"],"state_sha256":"9b7b109c22b0dd10a663c8388854550e782803c59ae17c5d8e29d90c783a524a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uwFSvuXu+C61aH797FhFiKClMWc7xpRnj81et5AW9VIUyQk4lU8AJ6DoH6LEHJKeByq2x9NI/6pdShatgHBCCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T05:26:41.640652Z","bundle_sha256":"75a04634487c1c131e07572100145e5146719c0bd0d73840f8b8659ce0194a64"}}