{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CJU5E2G2G7KOE5PDFD46DWIUAR","short_pith_number":"pith:CJU5E2G2","canonical_record":{"source":{"id":"1202.3205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-15T05:19:40Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"f94e105b4d77e6bd199dd7f3ff370fcfd866ac091301b4809f72f925335f03ba","abstract_canon_sha256":"f731362c6e71b628e74c8c286f76f0f0aff15ed93bab54e31cc188178c12f459"},"schema_version":"1.0"},"canonical_sha256":"1269d268da37d4e275e328f9e1d914047222f01c81741aa6a704beecf5b15045","source":{"kind":"arxiv","id":"1202.3205","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3205","created_at":"2026-05-18T04:02:14Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3205v1","created_at":"2026-05-18T04:02:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3205","created_at":"2026-05-18T04:02:14Z"},{"alias_kind":"pith_short_12","alias_value":"CJU5E2G2G7KO","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CJU5E2G2G7KOE5PD","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CJU5E2G2","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CJU5E2G2G7KOE5PDFD46DWIUAR","target":"record","payload":{"canonical_record":{"source":{"id":"1202.3205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-15T05:19:40Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"f94e105b4d77e6bd199dd7f3ff370fcfd866ac091301b4809f72f925335f03ba","abstract_canon_sha256":"f731362c6e71b628e74c8c286f76f0f0aff15ed93bab54e31cc188178c12f459"},"schema_version":"1.0"},"canonical_sha256":"1269d268da37d4e275e328f9e1d914047222f01c81741aa6a704beecf5b15045","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:14.401913Z","signature_b64":"0bL+fS2yK4+3MJfFEkPMYs5NPZ3+yzvMFufx6N+dOFy9D5lFwZRORteODBbnmh1dU8xEWoCL62hzo7feE8SPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1269d268da37d4e275e328f9e1d914047222f01c81741aa6a704beecf5b15045","last_reissued_at":"2026-05-18T04:02:14.401278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:14.401278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.3205","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-18T04:02:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VVHxI0mF/4FWu9Q+FDC2VgxIAI2oVdMR1zktHqKsvnBDfkgl4ETZS9r+cYR5MVZ5ozBp9ZS7PnasNs2iY1DXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:09:54.514946Z"},"content_sha256":"256c336937cfcb0ffd3614d3e02db1497c0e0a64d744d6ebd791c84a9ef2cf23","schema_version":"1.0","event_id":"sha256:256c336937cfcb0ffd3614d3e02db1497c0e0a64d744d6ebd791c84a9ef2cf23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CJU5E2G2G7KOE5PDFD46DWIUAR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy Sequential Maximal Independent Set and Matching are Parallel on Average","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Guy Blelloch, Jeremy Fineman, Julian Shun","submitted_at":"2012-02-15T05:19:40Z","abstract_excerpt":"The greedy sequential algorithm for maximal independent set (MIS) loops over the vertices in arbitrary order adding a vertex to the resulting set if and only if no previous neighboring vertex has been added. In this loop, as in many sequential loops, each iterate will only depend directly on a subset of the previous iterates (i.e. knowing that any one of a vertices neighbors is in the MIS or knowing that it has no previous neighbors is sufficient to decide its fate). This leads to a dependence structure among the iterates. If this structure is shallow then running the iterates in parallel whil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3205","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-18T04:02:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fGvR9tBN4W0NrQ0bj+F0AxcfcQsZSPs+4K96bSCgy+A3rTt5LY5Jibc1tabtPNH6izvfTeNlKJUBkydL8SQ1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:09:54.515299Z"},"content_sha256":"be32811fca4d38d9546a762c5d98f4bdaf3cf9d1b418b26b24773f91165057fb","schema_version":"1.0","event_id":"sha256:be32811fca4d38d9546a762c5d98f4bdaf3cf9d1b418b26b24773f91165057fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJU5E2G2G7KOE5PDFD46DWIUAR/bundle.json","state_url":"https://pith.science/pith/CJU5E2G2G7KOE5PDFD46DWIUAR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJU5E2G2G7KOE5PDFD46DWIUAR/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-01T19:09:54Z","links":{"resolver":"https://pith.science/pith/CJU5E2G2G7KOE5PDFD46DWIUAR","bundle":"https://pith.science/pith/CJU5E2G2G7KOE5PDFD46DWIUAR/bundle.json","state":"https://pith.science/pith/CJU5E2G2G7KOE5PDFD46DWIUAR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJU5E2G2G7KOE5PDFD46DWIUAR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CJU5E2G2G7KOE5PDFD46DWIUAR","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":"f731362c6e71b628e74c8c286f76f0f0aff15ed93bab54e31cc188178c12f459","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-15T05:19:40Z","title_canon_sha256":"f94e105b4d77e6bd199dd7f3ff370fcfd866ac091301b4809f72f925335f03ba"},"schema_version":"1.0","source":{"id":"1202.3205","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3205","created_at":"2026-05-18T04:02:14Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3205v1","created_at":"2026-05-18T04:02:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3205","created_at":"2026-05-18T04:02:14Z"},{"alias_kind":"pith_short_12","alias_value":"CJU5E2G2G7KO","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CJU5E2G2G7KOE5PD","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CJU5E2G2","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:be32811fca4d38d9546a762c5d98f4bdaf3cf9d1b418b26b24773f91165057fb","target":"graph","created_at":"2026-05-18T04:02:14Z","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":"The greedy sequential algorithm for maximal independent set (MIS) loops over the vertices in arbitrary order adding a vertex to the resulting set if and only if no previous neighboring vertex has been added. In this loop, as in many sequential loops, each iterate will only depend directly on a subset of the previous iterates (i.e. knowing that any one of a vertices neighbors is in the MIS or knowing that it has no previous neighbors is sufficient to decide its fate). This leads to a dependence structure among the iterates. If this structure is shallow then running the iterates in parallel whil","authors_text":"Guy Blelloch, Jeremy Fineman, Julian Shun","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-15T05:19:40Z","title":"Greedy Sequential Maximal Independent Set and Matching are Parallel on Average"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3205","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:256c336937cfcb0ffd3614d3e02db1497c0e0a64d744d6ebd791c84a9ef2cf23","target":"record","created_at":"2026-05-18T04:02:14Z","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":"f731362c6e71b628e74c8c286f76f0f0aff15ed93bab54e31cc188178c12f459","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-15T05:19:40Z","title_canon_sha256":"f94e105b4d77e6bd199dd7f3ff370fcfd866ac091301b4809f72f925335f03ba"},"schema_version":"1.0","source":{"id":"1202.3205","kind":"arxiv","version":1}},"canonical_sha256":"1269d268da37d4e275e328f9e1d914047222f01c81741aa6a704beecf5b15045","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1269d268da37d4e275e328f9e1d914047222f01c81741aa6a704beecf5b15045","first_computed_at":"2026-05-18T04:02:14.401278Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:14.401278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0bL+fS2yK4+3MJfFEkPMYs5NPZ3+yzvMFufx6N+dOFy9D5lFwZRORteODBbnmh1dU8xEWoCL62hzo7feE8SPCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:14.401913Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3205","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:256c336937cfcb0ffd3614d3e02db1497c0e0a64d744d6ebd791c84a9ef2cf23","sha256:be32811fca4d38d9546a762c5d98f4bdaf3cf9d1b418b26b24773f91165057fb"],"state_sha256":"047a17f9ac942b74b32debeb75cf58f88adecbb512b162e007ddce8afb964ddc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gfw2OA2xIFXogO90B2jOc2S5LVpO7sliEOeHz6fMEBVQOCIjhrPvDaapjy+KM7LgvsPxeDhIzqbQybLKA8RXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:09:54.517259Z","bundle_sha256":"c5b15a13bfc463a41fc1cf457112830c4333327e2d88ff7c524122aa8873ecc4"}}