{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3KO7NRF4UAZEYCI2NTPIA6QO5C","short_pith_number":"pith:3KO7NRF4","schema_version":"1.0","canonical_sha256":"da9df6c4bca0324c091a6cde807a0ee8b4b4ab0af2114084e9502c8c11939242","source":{"kind":"arxiv","id":"1507.06239","version":1},"attestation_state":"computed","paper":{"title":"Fast Desynchronization For Decentralized Multichannel Medium Access Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.MA","math.IT","math.OC"],"primary_cat":"cs.SY","authors_text":"George Smart, Joao F. C. Mota, Nikos Deligiannis, Yiannis Andreopoulos","submitted_at":"2015-07-22T16:12:03Z","abstract_excerpt":"Distributed desynchronization algorithms are key to wireless sensor networks as they allow for medium access control in a decentralized manner. In this paper, we view desynchronization primitives as iterative methods that solve optimization problems. In particular, by formalizing a well established desynchronization algorithm as a gradient descent method, we establish novel upper bounds on the number of iterations required to reach convergence. Moreover, by using Nesterov's accelerated gradient method, we propose a novel desynchronization primitive that provides for faster convergence to the s"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1507.06239","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-07-22T16:12:03Z","cross_cats_sorted":["cs.IT","cs.MA","math.IT","math.OC"],"title_canon_sha256":"d177ac6fbc477dae35f46c433f42da39324121aeaa1f2ffbab101917234ffd02","abstract_canon_sha256":"81bbde11947172dfdb6a2405db3afc8b73539444edd51c27d4d5945e8bb4ef20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:50.513566Z","signature_b64":"siCK22kJk9PbMPHS3Y4bZ4JAFyXBn4k2uGs6GM00SX7n717IWir8RyWVYHQ2EKsEnOSz5gXDIk7DpeIlKe8lCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da9df6c4bca0324c091a6cde807a0ee8b4b4ab0af2114084e9502c8c11939242","last_reissued_at":"2026-05-18T00:57:50.513078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:50.513078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Desynchronization For Decentralized Multichannel Medium Access Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.MA","math.IT","math.OC"],"primary_cat":"cs.SY","authors_text":"George Smart, Joao F. C. Mota, Nikos Deligiannis, Yiannis Andreopoulos","submitted_at":"2015-07-22T16:12:03Z","abstract_excerpt":"Distributed desynchronization algorithms are key to wireless sensor networks as they allow for medium access control in a decentralized manner. In this paper, we view desynchronization primitives as iterative methods that solve optimization problems. In particular, by formalizing a well established desynchronization algorithm as a gradient descent method, we establish novel upper bounds on the number of iterations required to reach convergence. Moreover, by using Nesterov's accelerated gradient method, we propose a novel desynchronization primitive that provides for faster convergence to the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06239","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.06239","created_at":"2026-05-18T00:57:50.513159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.06239v1","created_at":"2026-05-18T00:57:50.513159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06239","created_at":"2026-05-18T00:57:50.513159+00:00"},{"alias_kind":"pith_short_12","alias_value":"3KO7NRF4UAZE","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3KO7NRF4UAZEYCI2","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3KO7NRF4","created_at":"2026-05-18T12:29:02.477457+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3KO7NRF4UAZEYCI2NTPIA6QO5C","json":"https://pith.science/pith/3KO7NRF4UAZEYCI2NTPIA6QO5C.json","graph_json":"https://pith.science/api/pith-number/3KO7NRF4UAZEYCI2NTPIA6QO5C/graph.json","events_json":"https://pith.science/api/pith-number/3KO7NRF4UAZEYCI2NTPIA6QO5C/events.json","paper":"https://pith.science/paper/3KO7NRF4"},"agent_actions":{"view_html":"https://pith.science/pith/3KO7NRF4UAZEYCI2NTPIA6QO5C","download_json":"https://pith.science/pith/3KO7NRF4UAZEYCI2NTPIA6QO5C.json","view_paper":"https://pith.science/paper/3KO7NRF4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.06239&json=true","fetch_graph":"https://pith.science/api/pith-number/3KO7NRF4UAZEYCI2NTPIA6QO5C/graph.json","fetch_events":"https://pith.science/api/pith-number/3KO7NRF4UAZEYCI2NTPIA6QO5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3KO7NRF4UAZEYCI2NTPIA6QO5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3KO7NRF4UAZEYCI2NTPIA6QO5C/action/storage_attestation","attest_author":"https://pith.science/pith/3KO7NRF4UAZEYCI2NTPIA6QO5C/action/author_attestation","sign_citation":"https://pith.science/pith/3KO7NRF4UAZEYCI2NTPIA6QO5C/action/citation_signature","submit_replication":"https://pith.science/pith/3KO7NRF4UAZEYCI2NTPIA6QO5C/action/replication_record"}},"created_at":"2026-05-18T00:57:50.513159+00:00","updated_at":"2026-05-18T00:57:50.513159+00:00"}