{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:B7UTXLHC22EE44KV7GMZIC23QV","short_pith_number":"pith:B7UTXLHC","schema_version":"1.0","canonical_sha256":"0fe93bace2d6884e7155f999940b5b8561e31565e849017b301bbda34d206f95","source":{"kind":"arxiv","id":"1805.03357","version":1},"attestation_state":"computed","paper":{"title":"Efficient Distributed Computation of MIS and Generalized MIS in Linear Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chaodong Zheng, Fabian Kuhn","submitted_at":"2018-05-09T03:04:45Z","abstract_excerpt":"Given a graph, a maximal independent set (MIS) is a maximal subset of pairwise non-adjacent vertices. Finding an MIS is a fundamental problem in distributed computing. Although the problem is extensively studied and well understood in simple graphs, our knowledge is still quite limited when solving it in hypergraphs, especially in the distributed CONGEST model. In this paper, we focus on linear hypergraphs---a class of hypergraphs in which any two hyperedges overlap on at most one node.\n  We first present a randomized algorithm for computing an MIS in linear hypergraphs. It has poly-logarithmi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1805.03357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-09T03:04:45Z","cross_cats_sorted":[],"title_canon_sha256":"4a9c75121960dedfd9ce090eb412522583ac2e5b3c15b8040fbb94e2b0b11431","abstract_canon_sha256":"0163b1471e384341cbcfe53a1be2e747dda08b4ab28925ab61dc09a6b4fc6104"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:20.399350Z","signature_b64":"tWvgu8gM6xKjiM3iu+Hi61xXSl78n4sUfB57z3wNLHX1Dl5E1qZbPvGI46STokCYRLb3Ui6BreJqGuJj5bVcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fe93bace2d6884e7155f999940b5b8561e31565e849017b301bbda34d206f95","last_reissued_at":"2026-05-18T00:16:20.398940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:20.398940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Distributed Computation of MIS and Generalized MIS in Linear Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chaodong Zheng, Fabian Kuhn","submitted_at":"2018-05-09T03:04:45Z","abstract_excerpt":"Given a graph, a maximal independent set (MIS) is a maximal subset of pairwise non-adjacent vertices. Finding an MIS is a fundamental problem in distributed computing. Although the problem is extensively studied and well understood in simple graphs, our knowledge is still quite limited when solving it in hypergraphs, especially in the distributed CONGEST model. In this paper, we focus on linear hypergraphs---a class of hypergraphs in which any two hyperedges overlap on at most one node.\n  We first present a randomized algorithm for computing an MIS in linear hypergraphs. It has poly-logarithmi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03357","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.03357","created_at":"2026-05-18T00:16:20.399002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03357v1","created_at":"2026-05-18T00:16:20.399002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03357","created_at":"2026-05-18T00:16:20.399002+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7UTXLHC22EE","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7UTXLHC22EE44KV","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7UTXLHC","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B7UTXLHC22EE44KV7GMZIC23QV","json":"https://pith.science/pith/B7UTXLHC22EE44KV7GMZIC23QV.json","graph_json":"https://pith.science/api/pith-number/B7UTXLHC22EE44KV7GMZIC23QV/graph.json","events_json":"https://pith.science/api/pith-number/B7UTXLHC22EE44KV7GMZIC23QV/events.json","paper":"https://pith.science/paper/B7UTXLHC"},"agent_actions":{"view_html":"https://pith.science/pith/B7UTXLHC22EE44KV7GMZIC23QV","download_json":"https://pith.science/pith/B7UTXLHC22EE44KV7GMZIC23QV.json","view_paper":"https://pith.science/paper/B7UTXLHC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03357&json=true","fetch_graph":"https://pith.science/api/pith-number/B7UTXLHC22EE44KV7GMZIC23QV/graph.json","fetch_events":"https://pith.science/api/pith-number/B7UTXLHC22EE44KV7GMZIC23QV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7UTXLHC22EE44KV7GMZIC23QV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7UTXLHC22EE44KV7GMZIC23QV/action/storage_attestation","attest_author":"https://pith.science/pith/B7UTXLHC22EE44KV7GMZIC23QV/action/author_attestation","sign_citation":"https://pith.science/pith/B7UTXLHC22EE44KV7GMZIC23QV/action/citation_signature","submit_replication":"https://pith.science/pith/B7UTXLHC22EE44KV7GMZIC23QV/action/replication_record"}},"created_at":"2026-05-18T00:16:20.399002+00:00","updated_at":"2026-05-18T00:16:20.399002+00:00"}