{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JZSZ6OKQJJ5BSY6XKIJ67OSYXU","short_pith_number":"pith:JZSZ6OKQ","canonical_record":{"source":{"id":"1708.00276","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-01T12:19:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f99f98ef80c4305ecdf39cb0e9f1e20acd334faaa1b2d95b308b6b96390d6769","abstract_canon_sha256":"c3aebf66df3b192442b8cf3165777a7583984c5b499910bbccc1cc5b9f47d21c"},"schema_version":"1.0"},"canonical_sha256":"4e659f39504a7a1963d75213efba58bd339669ec11e14b6527ecf8eabf409a02","source":{"kind":"arxiv","id":"1708.00276","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00276","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00276v1","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00276","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"pith_short_12","alias_value":"JZSZ6OKQJJ5B","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JZSZ6OKQJJ5BSY6X","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JZSZ6OKQ","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JZSZ6OKQJJ5BSY6XKIJ67OSYXU","target":"record","payload":{"canonical_record":{"source":{"id":"1708.00276","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-01T12:19:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f99f98ef80c4305ecdf39cb0e9f1e20acd334faaa1b2d95b308b6b96390d6769","abstract_canon_sha256":"c3aebf66df3b192442b8cf3165777a7583984c5b499910bbccc1cc5b9f47d21c"},"schema_version":"1.0"},"canonical_sha256":"4e659f39504a7a1963d75213efba58bd339669ec11e14b6527ecf8eabf409a02","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:05.593872Z","signature_b64":"WeyQRAUrzlkRLtXH1D6mp1GVmK4v2bf2Th2Jg8kmdeJCEXRDryfs/X6gYNywjpr0ryeNvki6IOxj9hiDIUPKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e659f39504a7a1963d75213efba58bd339669ec11e14b6527ecf8eabf409a02","last_reissued_at":"2026-05-18T00:39:05.593207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:05.593207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.00276","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-18T00:39:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LnXaG5PoYaGPqoh00ki8S7tk06JmLBkJL1sajMkn33VRa4lqJoQFpnwQhihrudyW5J3LzAuecJAdgKkKgof5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:59:13.939167Z"},"content_sha256":"d262cca5747a3230c80151cbeea249c4d07e7526b0c9c634fbf9a9c3a7a5d5bb","schema_version":"1.0","event_id":"sha256:d262cca5747a3230c80151cbeea249c4d07e7526b0c9c634fbf9a9c3a7a5d5bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JZSZ6OKQJJ5BSY6XKIJ67OSYXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Approximation of Maximum Independent Set and Maximum Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Gregory Schwartzman, Keren Censor-Hillel, Mohsen Ghaffari, Reuven Bar-Yehuda","submitted_at":"2017-08-01T12:19:50Z","abstract_excerpt":"We present a simple distributed $\\Delta$-approximation algorithm for maximum weight independent set (MaxIS) in the $\\mathsf{CONGEST}$ model which completes in $O(\\texttt{MIS}(G)\\cdot \\log W)$ rounds, where $\\Delta$ is the maximum degree, $\\texttt{MIS}(G)$ is the number of rounds needed to compute a maximal independent set (MIS) on $G$, and $W$ is the maximum weight of a node. %Whether our algorithm is randomized or deterministic depends on the \\texttt{MIS} algorithm used as a black-box.\n  Plugging in the best known algorithm for MIS gives a randomized solution in $O(\\log n \\log W)$ rounds, whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00276","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-18T00:39:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"860JLRrFWrd8AD9TXIk1rBhoHlz70XAbzc2WCjqjhj4gn3dt/5I5UFYh/Bcou/DAPb9E65GsTHMOikVhdNmsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:59:13.939828Z"},"content_sha256":"9a4f723691dd2a368188d05344b12bd1728f533e3cf20ddf99120f0c42e4caa4","schema_version":"1.0","event_id":"sha256:9a4f723691dd2a368188d05344b12bd1728f533e3cf20ddf99120f0c42e4caa4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JZSZ6OKQJJ5BSY6XKIJ67OSYXU/bundle.json","state_url":"https://pith.science/pith/JZSZ6OKQJJ5BSY6XKIJ67OSYXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JZSZ6OKQJJ5BSY6XKIJ67OSYXU/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-04T08:59:13Z","links":{"resolver":"https://pith.science/pith/JZSZ6OKQJJ5BSY6XKIJ67OSYXU","bundle":"https://pith.science/pith/JZSZ6OKQJJ5BSY6XKIJ67OSYXU/bundle.json","state":"https://pith.science/pith/JZSZ6OKQJJ5BSY6XKIJ67OSYXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JZSZ6OKQJJ5BSY6XKIJ67OSYXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JZSZ6OKQJJ5BSY6XKIJ67OSYXU","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":"c3aebf66df3b192442b8cf3165777a7583984c5b499910bbccc1cc5b9f47d21c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-01T12:19:50Z","title_canon_sha256":"f99f98ef80c4305ecdf39cb0e9f1e20acd334faaa1b2d95b308b6b96390d6769"},"schema_version":"1.0","source":{"id":"1708.00276","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00276","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00276v1","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00276","created_at":"2026-05-18T00:39:05Z"},{"alias_kind":"pith_short_12","alias_value":"JZSZ6OKQJJ5B","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JZSZ6OKQJJ5BSY6X","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JZSZ6OKQ","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:9a4f723691dd2a368188d05344b12bd1728f533e3cf20ddf99120f0c42e4caa4","target":"graph","created_at":"2026-05-18T00:39: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":"We present a simple distributed $\\Delta$-approximation algorithm for maximum weight independent set (MaxIS) in the $\\mathsf{CONGEST}$ model which completes in $O(\\texttt{MIS}(G)\\cdot \\log W)$ rounds, where $\\Delta$ is the maximum degree, $\\texttt{MIS}(G)$ is the number of rounds needed to compute a maximal independent set (MIS) on $G$, and $W$ is the maximum weight of a node. %Whether our algorithm is randomized or deterministic depends on the \\texttt{MIS} algorithm used as a black-box.\n  Plugging in the best known algorithm for MIS gives a randomized solution in $O(\\log n \\log W)$ rounds, whe","authors_text":"Gregory Schwartzman, Keren Censor-Hillel, Mohsen Ghaffari, Reuven Bar-Yehuda","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-01T12:19:50Z","title":"Distributed Approximation of Maximum Independent Set and Maximum Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00276","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:d262cca5747a3230c80151cbeea249c4d07e7526b0c9c634fbf9a9c3a7a5d5bb","target":"record","created_at":"2026-05-18T00:39: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":"c3aebf66df3b192442b8cf3165777a7583984c5b499910bbccc1cc5b9f47d21c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-01T12:19:50Z","title_canon_sha256":"f99f98ef80c4305ecdf39cb0e9f1e20acd334faaa1b2d95b308b6b96390d6769"},"schema_version":"1.0","source":{"id":"1708.00276","kind":"arxiv","version":1}},"canonical_sha256":"4e659f39504a7a1963d75213efba58bd339669ec11e14b6527ecf8eabf409a02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e659f39504a7a1963d75213efba58bd339669ec11e14b6527ecf8eabf409a02","first_computed_at":"2026-05-18T00:39:05.593207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:05.593207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WeyQRAUrzlkRLtXH1D6mp1GVmK4v2bf2Th2Jg8kmdeJCEXRDryfs/X6gYNywjpr0ryeNvki6IOxj9hiDIUPKBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:05.593872Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00276","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d262cca5747a3230c80151cbeea249c4d07e7526b0c9c634fbf9a9c3a7a5d5bb","sha256:9a4f723691dd2a368188d05344b12bd1728f533e3cf20ddf99120f0c42e4caa4"],"state_sha256":"2d5d3acc58070c6564d6a91b083d578e65c35e085b317c105c3c25aef45c1f6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vPp9mczAqASslKusXPBt2YhA7LGZKsUYcWRkT2M1oe/Yjvuo0ZFp8CjGLZODoiSTpR68qFKXNF9D7MPjHWAMCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T08:59:13.942798Z","bundle_sha256":"524f023ce9316cb6219e2cb0e9798d9835f8f90f9d8f3479e4e1ee6a118db0f0"}}