{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QJG7D6YPLBDGZ245GPDA22BK6K","short_pith_number":"pith:QJG7D6YP","schema_version":"1.0","canonical_sha256":"824df1fb0f58466ceb9d33c60d682af2b1b0e8c973cf2b8a2baca3ab2afaeef9","source":{"kind":"arxiv","id":"1703.06652","version":1},"attestation_state":"computed","paper":{"title":"Inference-Based Distributed Channel Allocation in Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aggelos Bletsas, Efthymios A. Vlachos, Panos N. Alevizos","submitted_at":"2017-03-20T10:08:21Z","abstract_excerpt":"Interference-aware resource allocation of time slots and frequency channels in single-antenna, halfduplex radio wireless sensor networks (WSN) is challenging. Devising distributed algorithms for such task further complicates the problem. This work studiesWSN joint time and frequency channel allocation for a given routing tree, such that: a) allocation is performed in a fully distributed way, i.e., information exchange is only performed among neighboring WSN terminals, within communication up to two hops, and b) detection of potential interfering terminals is simplified and can be practically r"},"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":"1703.06652","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-20T10:08:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4ce46110f6cd654ca5363784f8a2d204564db10d1b05ef5be7ca98c1e9d9c7f2","abstract_canon_sha256":"183ebe53e3fa6be5abe6ee81895ff1a15e54c26154be73103e52b25d3c9fb329"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:22.126310Z","signature_b64":"4IPzTKoMVgGT+V1nCaJpbRN1qN7OfTGFW0t/bW8TwrQxrRgfsiycHil8q29ACginDw40o8b95WwjmwcOFqKdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"824df1fb0f58466ceb9d33c60d682af2b1b0e8c973cf2b8a2baca3ab2afaeef9","last_reissued_at":"2026-05-18T00:48:22.125651Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:22.125651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inference-Based Distributed Channel Allocation in Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aggelos Bletsas, Efthymios A. Vlachos, Panos N. Alevizos","submitted_at":"2017-03-20T10:08:21Z","abstract_excerpt":"Interference-aware resource allocation of time slots and frequency channels in single-antenna, halfduplex radio wireless sensor networks (WSN) is challenging. Devising distributed algorithms for such task further complicates the problem. This work studiesWSN joint time and frequency channel allocation for a given routing tree, such that: a) allocation is performed in a fully distributed way, i.e., information exchange is only performed among neighboring WSN terminals, within communication up to two hops, and b) detection of potential interfering terminals is simplified and can be practically r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06652","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":"1703.06652","created_at":"2026-05-18T00:48:22.125752+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06652v1","created_at":"2026-05-18T00:48:22.125752+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06652","created_at":"2026-05-18T00:48:22.125752+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJG7D6YPLBDG","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJG7D6YPLBDGZ245","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJG7D6YP","created_at":"2026-05-18T12:31:39.905425+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/QJG7D6YPLBDGZ245GPDA22BK6K","json":"https://pith.science/pith/QJG7D6YPLBDGZ245GPDA22BK6K.json","graph_json":"https://pith.science/api/pith-number/QJG7D6YPLBDGZ245GPDA22BK6K/graph.json","events_json":"https://pith.science/api/pith-number/QJG7D6YPLBDGZ245GPDA22BK6K/events.json","paper":"https://pith.science/paper/QJG7D6YP"},"agent_actions":{"view_html":"https://pith.science/pith/QJG7D6YPLBDGZ245GPDA22BK6K","download_json":"https://pith.science/pith/QJG7D6YPLBDGZ245GPDA22BK6K.json","view_paper":"https://pith.science/paper/QJG7D6YP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06652&json=true","fetch_graph":"https://pith.science/api/pith-number/QJG7D6YPLBDGZ245GPDA22BK6K/graph.json","fetch_events":"https://pith.science/api/pith-number/QJG7D6YPLBDGZ245GPDA22BK6K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJG7D6YPLBDGZ245GPDA22BK6K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJG7D6YPLBDGZ245GPDA22BK6K/action/storage_attestation","attest_author":"https://pith.science/pith/QJG7D6YPLBDGZ245GPDA22BK6K/action/author_attestation","sign_citation":"https://pith.science/pith/QJG7D6YPLBDGZ245GPDA22BK6K/action/citation_signature","submit_replication":"https://pith.science/pith/QJG7D6YPLBDGZ245GPDA22BK6K/action/replication_record"}},"created_at":"2026-05-18T00:48:22.125752+00:00","updated_at":"2026-05-18T00:48:22.125752+00:00"}