{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WQ45UUMJ63SOZBM5JPI54QWYPY","short_pith_number":"pith:WQ45UUMJ","canonical_record":{"source":{"id":"1605.06486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-20T19:42:16Z","cross_cats_sorted":[],"title_canon_sha256":"aaa383a2434c1d1c02ecaeaf390117941044dd1c4a7b66a11748570c9f554e28","abstract_canon_sha256":"b7c646dd36dd3bbbf3d5d6f4faa58a18ba492cf88583d7898d86d4d6078db4e4"},"schema_version":"1.0"},"canonical_sha256":"b439da5189f6e4ec859d4bd1de42d87e08371b3151a11aa1069961f0d5ca1810","source":{"kind":"arxiv","id":"1605.06486","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06486","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06486v1","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06486","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"WQ45UUMJ63SO","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WQ45UUMJ63SOZBM5","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WQ45UUMJ","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WQ45UUMJ63SOZBM5JPI54QWYPY","target":"record","payload":{"canonical_record":{"source":{"id":"1605.06486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-20T19:42:16Z","cross_cats_sorted":[],"title_canon_sha256":"aaa383a2434c1d1c02ecaeaf390117941044dd1c4a7b66a11748570c9f554e28","abstract_canon_sha256":"b7c646dd36dd3bbbf3d5d6f4faa58a18ba492cf88583d7898d86d4d6078db4e4"},"schema_version":"1.0"},"canonical_sha256":"b439da5189f6e4ec859d4bd1de42d87e08371b3151a11aa1069961f0d5ca1810","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:18.776517Z","signature_b64":"lQQsyTVGWS7covB7J4N4vR0pjscVrb+c8yWVMWuV7YZwSCHcyb83LsVErOwEbdb5ZSFhTK5fut8/b4/sKWmsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b439da5189f6e4ec859d4bd1de42d87e08371b3151a11aa1069961f0d5ca1810","last_reissued_at":"2026-05-18T01:14:18.775760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:18.775760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.06486","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:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"shNWgjLsGSfxLQM1v5Y01ab+pW+a+mRtbXlrOYd/6ngAbUJ1w7SQ7lHB7Dp4pBTfd6eoRO0yGlFvtww2fX94Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:17:51.392830Z"},"content_sha256":"c32157ed0e499e4d124f2fc01adf5fbb82bd50ea01f35a7a140bd4bc4bc88000","schema_version":"1.0","event_id":"sha256:c32157ed0e499e4d124f2fc01adf5fbb82bd50ea01f35a7a140bd4bc4bc88000"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WQ45UUMJ63SOZBM5JPI54QWYPY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Read-$k$ Inequalities to Analyze a Distributed MIS Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Sriram Pemmaraju, Talal Riaz","submitted_at":"2016-05-20T19:42:16Z","abstract_excerpt":"Until recently, the fastest distributed MIS algorithm, even for simple graphs, e.g., unoriented trees has been the simple randomized algorithm discovered the 80s. This algorithm (commonly called Luby's algorithm) computes an MIS in $O(\\log n)$ rounds (with high probability). This situation changed when Lenzen and Wattenhofer (PODC 2011) presented a randomized $O(\\sqrt{\\log n}\\cdot \\log\\log n)$-round MIS algorithm for unoriented trees. This algorithm was improved by Barenboim et al. (FOCS 2012), resulting in an $O(\\sqrt{\\log n \\cdot \\log\\log n})$-round MIS algorithm.\n  The analyses of these tre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06486","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:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SjS03Ul00wy5pC7GxFH7eGi3FV1FAo3s61rnpQS8Xlm+u1tfiFdz92TnpR6ZQrulcqHDYwaLLjVmuHb0qZLvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:17:51.393555Z"},"content_sha256":"3e1197e6420515bb978fef5a44db135bbcfcd0eb7413ed70a356522d526bd520","schema_version":"1.0","event_id":"sha256:3e1197e6420515bb978fef5a44db135bbcfcd0eb7413ed70a356522d526bd520"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WQ45UUMJ63SOZBM5JPI54QWYPY/bundle.json","state_url":"https://pith.science/pith/WQ45UUMJ63SOZBM5JPI54QWYPY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WQ45UUMJ63SOZBM5JPI54QWYPY/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-06-08T05:17:51Z","links":{"resolver":"https://pith.science/pith/WQ45UUMJ63SOZBM5JPI54QWYPY","bundle":"https://pith.science/pith/WQ45UUMJ63SOZBM5JPI54QWYPY/bundle.json","state":"https://pith.science/pith/WQ45UUMJ63SOZBM5JPI54QWYPY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WQ45UUMJ63SOZBM5JPI54QWYPY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WQ45UUMJ63SOZBM5JPI54QWYPY","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":"b7c646dd36dd3bbbf3d5d6f4faa58a18ba492cf88583d7898d86d4d6078db4e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-20T19:42:16Z","title_canon_sha256":"aaa383a2434c1d1c02ecaeaf390117941044dd1c4a7b66a11748570c9f554e28"},"schema_version":"1.0","source":{"id":"1605.06486","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06486","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06486v1","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06486","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"WQ45UUMJ63SO","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WQ45UUMJ63SOZBM5","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WQ45UUMJ","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:3e1197e6420515bb978fef5a44db135bbcfcd0eb7413ed70a356522d526bd520","target":"graph","created_at":"2026-05-18T01:14:18Z","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":"Until recently, the fastest distributed MIS algorithm, even for simple graphs, e.g., unoriented trees has been the simple randomized algorithm discovered the 80s. This algorithm (commonly called Luby's algorithm) computes an MIS in $O(\\log n)$ rounds (with high probability). This situation changed when Lenzen and Wattenhofer (PODC 2011) presented a randomized $O(\\sqrt{\\log n}\\cdot \\log\\log n)$-round MIS algorithm for unoriented trees. This algorithm was improved by Barenboim et al. (FOCS 2012), resulting in an $O(\\sqrt{\\log n \\cdot \\log\\log n})$-round MIS algorithm.\n  The analyses of these tre","authors_text":"Sriram Pemmaraju, Talal Riaz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-20T19:42:16Z","title":"Using Read-$k$ Inequalities to Analyze a Distributed MIS Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06486","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:c32157ed0e499e4d124f2fc01adf5fbb82bd50ea01f35a7a140bd4bc4bc88000","target":"record","created_at":"2026-05-18T01:14:18Z","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":"b7c646dd36dd3bbbf3d5d6f4faa58a18ba492cf88583d7898d86d4d6078db4e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-20T19:42:16Z","title_canon_sha256":"aaa383a2434c1d1c02ecaeaf390117941044dd1c4a7b66a11748570c9f554e28"},"schema_version":"1.0","source":{"id":"1605.06486","kind":"arxiv","version":1}},"canonical_sha256":"b439da5189f6e4ec859d4bd1de42d87e08371b3151a11aa1069961f0d5ca1810","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b439da5189f6e4ec859d4bd1de42d87e08371b3151a11aa1069961f0d5ca1810","first_computed_at":"2026-05-18T01:14:18.775760Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:18.775760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lQQsyTVGWS7covB7J4N4vR0pjscVrb+c8yWVMWuV7YZwSCHcyb83LsVErOwEbdb5ZSFhTK5fut8/b4/sKWmsAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:18.776517Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06486","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c32157ed0e499e4d124f2fc01adf5fbb82bd50ea01f35a7a140bd4bc4bc88000","sha256:3e1197e6420515bb978fef5a44db135bbcfcd0eb7413ed70a356522d526bd520"],"state_sha256":"3d49ddb4f606adcb6d7fbbdcef5500d53b30912a33a092adb3f3b280d553c539"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BUGRWY1GKh9TmTRUryL7QFD9lV1ISlgV7lM/+ME106Fr4U0HFSTggo3QI3f77QhbHheZJQwNAUSZkZunzbIzAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T05:17:51.397597Z","bundle_sha256":"c954410b4f6ce81bf6cc5021946b091b34288c0b63dadca715478e505ce55f38"}}