{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6FTGQMAODCDWUGBOJOXFPKRM2X","short_pith_number":"pith:6FTGQMAO","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"},"canonical_sha256":"f16668300e18876a182e4bae57aa2cd5cc2475d63594ebf62f8904d9335be2b9","source":{"kind":"arxiv","id":"1508.04390","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04390","created_at":"2026-05-18T01:35:05Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04390v1","created_at":"2026-05-18T01:35:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04390","created_at":"2026-05-18T01:35:05Z"},{"alias_kind":"pith_short_12","alias_value":"6FTGQMAODCDW","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6FTGQMAODCDWUGBO","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6FTGQMAO","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6FTGQMAODCDWUGBOJOXFPKRM2X","target":"record","payload":{"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"},"canonical_sha256":"f16668300e18876a182e4bae57aa2cd5cc2475d63594ebf62f8904d9335be2b9","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"},"source_kind":"arxiv","source_id":"1508.04390","source_version":1,"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-18T01:35:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rR8QwQ0HadpML3eLnJGHHRrX/isvNSBSJ59YzrWrTA1hZTCR1XaW94NJsee3tZJrDd4eIjZTI44T1PcwiEoSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:46:04.773779Z"},"content_sha256":"7e9987e9a047cdcdd2dcbea7a10a5442d023720740cd04c5002e9c5c79fc390c","schema_version":"1.0","event_id":"sha256:7e9987e9a047cdcdd2dcbea7a10a5442d023720740cd04c5002e9c5c79fc390c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6FTGQMAODCDWUGBOJOXFPKRM2X","target":"graph","payload":{"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"},"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-18T01:35:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"02aVGLbQLxAw7NfOh34p8yICGpMHAHY2G8Ufrw+tRho/p9yDm1cRmozOQa+6QrX2CxsQsjoHrg+afjJa4REdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:46:04.774347Z"},"content_sha256":"2dfef14ad9a00253fbdb74e7d59790ca10f6ae575574d5a93a1b7ae4f69a15d3","schema_version":"1.0","event_id":"sha256:2dfef14ad9a00253fbdb74e7d59790ca10f6ae575574d5a93a1b7ae4f69a15d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6FTGQMAODCDWUGBOJOXFPKRM2X/bundle.json","state_url":"https://pith.science/pith/6FTGQMAODCDWUGBOJOXFPKRM2X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6FTGQMAODCDWUGBOJOXFPKRM2X/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-05-26T13:46:04Z","links":{"resolver":"https://pith.science/pith/6FTGQMAODCDWUGBOJOXFPKRM2X","bundle":"https://pith.science/pith/6FTGQMAODCDWUGBOJOXFPKRM2X/bundle.json","state":"https://pith.science/pith/6FTGQMAODCDWUGBOJOXFPKRM2X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6FTGQMAODCDWUGBOJOXFPKRM2X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6FTGQMAODCDWUGBOJOXFPKRM2X","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":"3e0d60be9de2762694186425555476a45394d67bc155c67bcb427451c69947b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-18T17:25:34Z","title_canon_sha256":"1e0593f954964583e175b6a25013fef3a7487346f285dbb0994e7e9a93e0dd2e"},"schema_version":"1.0","source":{"id":"1508.04390","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04390","created_at":"2026-05-18T01:35:05Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04390v1","created_at":"2026-05-18T01:35:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04390","created_at":"2026-05-18T01:35:05Z"},{"alias_kind":"pith_short_12","alias_value":"6FTGQMAODCDW","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6FTGQMAODCDWUGBO","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6FTGQMAO","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:2dfef14ad9a00253fbdb74e7d59790ca10f6ae575574d5a93a1b7ae4f69a15d3","target":"graph","created_at":"2026-05-18T01:35: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":"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, ","authors_text":"Fabian Kuhn, Sebastian Daum","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-18T17:25:34Z","title":"Tight Bounds for MIS in Multichannel Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04390","kind":"arxiv","version":1},"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:7e9987e9a047cdcdd2dcbea7a10a5442d023720740cd04c5002e9c5c79fc390c","target":"record","created_at":"2026-05-18T01:35: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":"3e0d60be9de2762694186425555476a45394d67bc155c67bcb427451c69947b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-18T17:25:34Z","title_canon_sha256":"1e0593f954964583e175b6a25013fef3a7487346f285dbb0994e7e9a93e0dd2e"},"schema_version":"1.0","source":{"id":"1508.04390","kind":"arxiv","version":1}},"canonical_sha256":"f16668300e18876a182e4bae57aa2cd5cc2475d63594ebf62f8904d9335be2b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f16668300e18876a182e4bae57aa2cd5cc2475d63594ebf62f8904d9335be2b9","first_computed_at":"2026-05-18T01:35:05.465443Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:05.465443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qLqAYlSzxBfrloVNS+ZWO+7qzm3f00oLHkZb108J1T4dEpUR/IPLAPHr+H4s8xjSs6m8rRojDCI0OgonYYwcBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:05.466067Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.04390","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e9987e9a047cdcdd2dcbea7a10a5442d023720740cd04c5002e9c5c79fc390c","sha256:2dfef14ad9a00253fbdb74e7d59790ca10f6ae575574d5a93a1b7ae4f69a15d3"],"state_sha256":"a2e968bfaafd2a83e1a8fb2615144ef007a7fb46f3e83b6f67991ac17db131e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FVM6/xFbW/minzzTejcM8DfjDLz8W9cug9I4rpl3qZ1nXGvFiCD1BUFC0ZviGJDITulxCmL8mMre2PmwItDICw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:46:04.777404Z","bundle_sha256":"1487c694cbcf5132fdcb17819b5716772f4edade253562499f1b20585150a992"}}