{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6FTGQMAODCDWUGBOJOXFPKRM2X","short_pith_number":"pith:6FTGQMAO","schema_version":"1.0","canonical_sha256":"f16668300e18876a182e4bae57aa2cd5cc2475d63594ebf62f8904d9335be2b9","source":{"kind":"arxiv","id":"1508.04390","version":1},"attestation_state":"computed","paper":{"title":"Tight Bounds for MIS in Multichannel Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fabian Kuhn, Sebastian Daum","submitted_at":"2015-08-18T17:25:34Z","abstract_excerpt":"Daum et al. [PODC'13] presented an algorithm that computes a maximal independent set (MIS) within $O(\\log^2 n/F+\\log n \\mathrm{polyloglog} n)$ rounds in an $n$-node multichannel radio network with $F$ communication channels. The paper uses a multichannel variant of the standard graph-based radio network model without collision detection and it assumes that the network graph is a polynomially bounded independence graph (BIG), a natural combinatorial generalization of well-known geographic families. The upper bound of that paper is known to be optimal up to a polyloglog factor.\n  In this paper, "},"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":"1508.04390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-18T17:25:34Z","cross_cats_sorted":[],"title_canon_sha256":"1e0593f954964583e175b6a25013fef3a7487346f285dbb0994e7e9a93e0dd2e","abstract_canon_sha256":"3e0d60be9de2762694186425555476a45394d67bc155c67bcb427451c69947b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:05.466067Z","signature_b64":"qLqAYlSzxBfrloVNS+ZWO+7qzm3f00oLHkZb108J1T4dEpUR/IPLAPHr+H4s8xjSs6m8rRojDCI0OgonYYwcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f16668300e18876a182e4bae57aa2cd5cc2475d63594ebf62f8904d9335be2b9","last_reissued_at":"2026-05-18T01:35:05.465443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:05.465443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds for MIS in Multichannel Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fabian Kuhn, Sebastian Daum","submitted_at":"2015-08-18T17:25:34Z","abstract_excerpt":"Daum et al. [PODC'13] presented an algorithm that computes a maximal independent set (MIS) within $O(\\log^2 n/F+\\log n \\mathrm{polyloglog} n)$ rounds in an $n$-node multichannel radio network with $F$ communication channels. The paper uses a multichannel variant of the standard graph-based radio network model without collision detection and it assumes that the network graph is a polynomially bounded independence graph (BIG), a natural combinatorial generalization of well-known geographic families. The upper bound of that paper is known to be optimal up to a polyloglog factor.\n  In this paper, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04390","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":"1508.04390","created_at":"2026-05-18T01:35:05.465556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.04390v1","created_at":"2026-05-18T01:35:05.465556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04390","created_at":"2026-05-18T01:35:05.465556+00:00"},{"alias_kind":"pith_short_12","alias_value":"6FTGQMAODCDW","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6FTGQMAODCDWUGBO","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6FTGQMAO","created_at":"2026-05-18T12:29:07.941421+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/6FTGQMAODCDWUGBOJOXFPKRM2X","json":"https://pith.science/pith/6FTGQMAODCDWUGBOJOXFPKRM2X.json","graph_json":"https://pith.science/api/pith-number/6FTGQMAODCDWUGBOJOXFPKRM2X/graph.json","events_json":"https://pith.science/api/pith-number/6FTGQMAODCDWUGBOJOXFPKRM2X/events.json","paper":"https://pith.science/paper/6FTGQMAO"},"agent_actions":{"view_html":"https://pith.science/pith/6FTGQMAODCDWUGBOJOXFPKRM2X","download_json":"https://pith.science/pith/6FTGQMAODCDWUGBOJOXFPKRM2X.json","view_paper":"https://pith.science/paper/6FTGQMAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.04390&json=true","fetch_graph":"https://pith.science/api/pith-number/6FTGQMAODCDWUGBOJOXFPKRM2X/graph.json","fetch_events":"https://pith.science/api/pith-number/6FTGQMAODCDWUGBOJOXFPKRM2X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6FTGQMAODCDWUGBOJOXFPKRM2X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6FTGQMAODCDWUGBOJOXFPKRM2X/action/storage_attestation","attest_author":"https://pith.science/pith/6FTGQMAODCDWUGBOJOXFPKRM2X/action/author_attestation","sign_citation":"https://pith.science/pith/6FTGQMAODCDWUGBOJOXFPKRM2X/action/citation_signature","submit_replication":"https://pith.science/pith/6FTGQMAODCDWUGBOJOXFPKRM2X/action/replication_record"}},"created_at":"2026-05-18T01:35:05.465556+00:00","updated_at":"2026-05-18T01:35:05.465556+00:00"}