{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UJDY2NROZUXOMBVJ6X65RQED4J","short_pith_number":"pith:UJDY2NRO","canonical_record":{"source":{"id":"1405.1133","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-06T02:55:50Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"8efa904ba219f657bd7663904eccd3b807d57439942058acf72f72f73e8cbb60","abstract_canon_sha256":"f185632d4c019b1e60dfb9783a88a609d3713f93fa04d73d1f390e65b007f234"},"schema_version":"1.0"},"canonical_sha256":"a2478d362ecd2ee606a9f5fdd8c083e2745dcf1621d69b4b5432fda016bea829","source":{"kind":"arxiv","id":"1405.1133","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1133","created_at":"2026-05-18T02:45:21Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1133v2","created_at":"2026-05-18T02:45:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1133","created_at":"2026-05-18T02:45:21Z"},{"alias_kind":"pith_short_12","alias_value":"UJDY2NROZUXO","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UJDY2NROZUXOMBVJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UJDY2NRO","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UJDY2NROZUXOMBVJ6X65RQED4J","target":"record","payload":{"canonical_record":{"source":{"id":"1405.1133","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-06T02:55:50Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"8efa904ba219f657bd7663904eccd3b807d57439942058acf72f72f73e8cbb60","abstract_canon_sha256":"f185632d4c019b1e60dfb9783a88a609d3713f93fa04d73d1f390e65b007f234"},"schema_version":"1.0"},"canonical_sha256":"a2478d362ecd2ee606a9f5fdd8c083e2745dcf1621d69b4b5432fda016bea829","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:21.366003Z","signature_b64":"htUoOnWjnOyJGxiF8nsL39LerZN35WpE0VbBx3jZIApLFAj9lWvtKlkZJkA5LX3Yn0zIYZDH25QqqV+h6ysRDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2478d362ecd2ee606a9f5fdd8c083e2745dcf1621d69b4b5432fda016bea829","last_reissued_at":"2026-05-18T02:45:21.365586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:21.365586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.1133","source_version":2,"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-18T02:45:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a+mIE9AWto9KNPDitKqQSlJtVkG4iggoAGvYWgKg7LSHp55N+rQiCTaqIE3rlzV/C5fRhLcmQ20Zdm+6G1IyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:38:23.290664Z"},"content_sha256":"8d594f0e16972245f09100836be5084312504de7671d3a0681f61561557ea2d4","schema_version":"1.0","event_id":"sha256:8d594f0e16972245f09100836be5084312504de7671d3a0681f61561557ea2d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UJDY2NROZUXOMBVJ6X65RQED4J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Computing Maximal Independent Sets of Hypergraphs in Parallel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Aravind Srinivasan, David G. Harris, Ioana O. Bercea, Navin Goyal","submitted_at":"2014-05-06T02:55:50Z","abstract_excerpt":"Whether or not the problem of finding maximal independent sets (MIS) in hypergraphs is in (R)NC is one of the fundamental problems in the theory of parallel computing. Unlike the well-understood case of MIS in graphs, for the hypergraph problem, our knowledge is quite limited despite considerable work. It is known that the problem is in \\emph{RNC} when the edges of the hypergraph have constant size. For general hypergraphs with $n$ vertices and $m$ edges, the fastest previously known algorithm works in time $O(\\sqrt{n})$ with $\\text{poly}(m,n)$ processors. In this paper we give an EREW PRAM al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1133","kind":"arxiv","version":2},"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-18T02:45:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8SgbEtl3zWjIsBng1hslRX1/0tqGQLNnfZhrdNLwf7n7lJUTU6Bx60pcChjTNQmkRV6Plf7R3cZjddn5kT2qDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:38:23.291360Z"},"content_sha256":"e749e840ba4f645b65d3a2a88a1cb074bbf99ee01770dc3fc9de3863938bdb95","schema_version":"1.0","event_id":"sha256:e749e840ba4f645b65d3a2a88a1cb074bbf99ee01770dc3fc9de3863938bdb95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJDY2NROZUXOMBVJ6X65RQED4J/bundle.json","state_url":"https://pith.science/pith/UJDY2NROZUXOMBVJ6X65RQED4J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJDY2NROZUXOMBVJ6X65RQED4J/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-06T12:38:23Z","links":{"resolver":"https://pith.science/pith/UJDY2NROZUXOMBVJ6X65RQED4J","bundle":"https://pith.science/pith/UJDY2NROZUXOMBVJ6X65RQED4J/bundle.json","state":"https://pith.science/pith/UJDY2NROZUXOMBVJ6X65RQED4J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJDY2NROZUXOMBVJ6X65RQED4J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UJDY2NROZUXOMBVJ6X65RQED4J","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":"f185632d4c019b1e60dfb9783a88a609d3713f93fa04d73d1f390e65b007f234","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-06T02:55:50Z","title_canon_sha256":"8efa904ba219f657bd7663904eccd3b807d57439942058acf72f72f73e8cbb60"},"schema_version":"1.0","source":{"id":"1405.1133","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1133","created_at":"2026-05-18T02:45:21Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1133v2","created_at":"2026-05-18T02:45:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1133","created_at":"2026-05-18T02:45:21Z"},{"alias_kind":"pith_short_12","alias_value":"UJDY2NROZUXO","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UJDY2NROZUXOMBVJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UJDY2NRO","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:e749e840ba4f645b65d3a2a88a1cb074bbf99ee01770dc3fc9de3863938bdb95","target":"graph","created_at":"2026-05-18T02:45:21Z","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":"Whether or not the problem of finding maximal independent sets (MIS) in hypergraphs is in (R)NC is one of the fundamental problems in the theory of parallel computing. Unlike the well-understood case of MIS in graphs, for the hypergraph problem, our knowledge is quite limited despite considerable work. It is known that the problem is in \\emph{RNC} when the edges of the hypergraph have constant size. For general hypergraphs with $n$ vertices and $m$ edges, the fastest previously known algorithm works in time $O(\\sqrt{n})$ with $\\text{poly}(m,n)$ processors. In this paper we give an EREW PRAM al","authors_text":"Aravind Srinivasan, David G. Harris, Ioana O. Bercea, Navin Goyal","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-06T02:55:50Z","title":"On Computing Maximal Independent Sets of Hypergraphs in Parallel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1133","kind":"arxiv","version":2},"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:8d594f0e16972245f09100836be5084312504de7671d3a0681f61561557ea2d4","target":"record","created_at":"2026-05-18T02:45:21Z","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":"f185632d4c019b1e60dfb9783a88a609d3713f93fa04d73d1f390e65b007f234","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-06T02:55:50Z","title_canon_sha256":"8efa904ba219f657bd7663904eccd3b807d57439942058acf72f72f73e8cbb60"},"schema_version":"1.0","source":{"id":"1405.1133","kind":"arxiv","version":2}},"canonical_sha256":"a2478d362ecd2ee606a9f5fdd8c083e2745dcf1621d69b4b5432fda016bea829","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2478d362ecd2ee606a9f5fdd8c083e2745dcf1621d69b4b5432fda016bea829","first_computed_at":"2026-05-18T02:45:21.365586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:21.365586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"htUoOnWjnOyJGxiF8nsL39LerZN35WpE0VbBx3jZIApLFAj9lWvtKlkZJkA5LX3Yn0zIYZDH25QqqV+h6ysRDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:21.366003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1133","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d594f0e16972245f09100836be5084312504de7671d3a0681f61561557ea2d4","sha256:e749e840ba4f645b65d3a2a88a1cb074bbf99ee01770dc3fc9de3863938bdb95"],"state_sha256":"f9f4d6b251506fa3a17f6ffc399ad13d2e4eaf23d288719a197d5b58bbcd0d09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e0vLQYt5wz7LjH4NhVwmBSeoDk8Dpup6Uun4imFKzFHQ5j1XN8n7V1j1Xy9roCnOhGIeIHaCvKDtIAkmvZ0YCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T12:38:23.295751Z","bundle_sha256":"f886848d7cb7390200531b7e07c26df22279dfedcd5cc3ead4180e16dd78044e"}}