{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:I3VSVC2ECAOOMPLYCTU56IHDWY","short_pith_number":"pith:I3VSVC2E","schema_version":"1.0","canonical_sha256":"46eb2a8b44101ce63d7814e9df20e3b63b9aaa50fe2e620b0f8fa1a8d6c6a607","source":{"kind":"arxiv","id":"1308.6475","version":2},"attestation_state":"computed","paper":{"title":"Self-stabilizing TDMA Algorithms for Wireless Ad-hoc Networks without External Reference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Elad M. Schiller, Philippas Tsigas, Thomas Petig","submitted_at":"2013-08-29T14:12:19Z","abstract_excerpt":"Time division multiple access (TDMA) is a method for sharing communication media. In wireless communications, TDMA algorithms often divide the radio time into timeslots of uniform size, $\\xi$, and then combine them into frames of uniform size, $\\tau$. We consider TDMA algorithms that allocate at least one timeslot in every frame to every node. Given a maximal node degree, $\\delta$, and no access to external references for collision detection, time or position, we consider the problem of collision-free self-stabilizing TDMA algorithms that use constant frame size.\n  We demonstrate that this pro"},"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":"1308.6475","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-08-29T14:12:19Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"5fa353b45fe4da95c2a53dceee2ec984b72c517df81a90d9c331784c2f2d26f2","abstract_canon_sha256":"e180b9a1ebc7ca12a63a64e7d0324ca1b4721e53371edea6a70451ab6c849e8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:38.965618Z","signature_b64":"cc2KhVw05rVGKukcwAUDWvEBeDlb3q7EGM2SUrYRs6u1TSZiBCjxumHKoNn0gR+II6bGu4KQ7qDrjor3casUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46eb2a8b44101ce63d7814e9df20e3b63b9aaa50fe2e620b0f8fa1a8d6c6a607","last_reissued_at":"2026-05-18T02:55:38.964940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:38.964940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-stabilizing TDMA Algorithms for Wireless Ad-hoc Networks without External Reference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Elad M. Schiller, Philippas Tsigas, Thomas Petig","submitted_at":"2013-08-29T14:12:19Z","abstract_excerpt":"Time division multiple access (TDMA) is a method for sharing communication media. In wireless communications, TDMA algorithms often divide the radio time into timeslots of uniform size, $\\xi$, and then combine them into frames of uniform size, $\\tau$. We consider TDMA algorithms that allocate at least one timeslot in every frame to every node. Given a maximal node degree, $\\delta$, and no access to external references for collision detection, time or position, we consider the problem of collision-free self-stabilizing TDMA algorithms that use constant frame size.\n  We demonstrate that this pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6475","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.6475","created_at":"2026-05-18T02:55:38.965050+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.6475v2","created_at":"2026-05-18T02:55:38.965050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6475","created_at":"2026-05-18T02:55:38.965050+00:00"},{"alias_kind":"pith_short_12","alias_value":"I3VSVC2ECAOO","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"I3VSVC2ECAOOMPLY","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"I3VSVC2E","created_at":"2026-05-18T12:27:46.883200+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/I3VSVC2ECAOOMPLYCTU56IHDWY","json":"https://pith.science/pith/I3VSVC2ECAOOMPLYCTU56IHDWY.json","graph_json":"https://pith.science/api/pith-number/I3VSVC2ECAOOMPLYCTU56IHDWY/graph.json","events_json":"https://pith.science/api/pith-number/I3VSVC2ECAOOMPLYCTU56IHDWY/events.json","paper":"https://pith.science/paper/I3VSVC2E"},"agent_actions":{"view_html":"https://pith.science/pith/I3VSVC2ECAOOMPLYCTU56IHDWY","download_json":"https://pith.science/pith/I3VSVC2ECAOOMPLYCTU56IHDWY.json","view_paper":"https://pith.science/paper/I3VSVC2E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.6475&json=true","fetch_graph":"https://pith.science/api/pith-number/I3VSVC2ECAOOMPLYCTU56IHDWY/graph.json","fetch_events":"https://pith.science/api/pith-number/I3VSVC2ECAOOMPLYCTU56IHDWY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I3VSVC2ECAOOMPLYCTU56IHDWY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I3VSVC2ECAOOMPLYCTU56IHDWY/action/storage_attestation","attest_author":"https://pith.science/pith/I3VSVC2ECAOOMPLYCTU56IHDWY/action/author_attestation","sign_citation":"https://pith.science/pith/I3VSVC2ECAOOMPLYCTU56IHDWY/action/citation_signature","submit_replication":"https://pith.science/pith/I3VSVC2ECAOOMPLYCTU56IHDWY/action/replication_record"}},"created_at":"2026-05-18T02:55:38.965050+00:00","updated_at":"2026-05-18T02:55:38.965050+00:00"}