{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PZQ3NGLLS7TOTUUSLDDICLNVHF","short_pith_number":"pith:PZQ3NGLL","schema_version":"1.0","canonical_sha256":"7e61b6996b97e6e9d29258c6812db5394de3ff95c4ba7f2094e88fd6d8dedf92","source":{"kind":"arxiv","id":"2411.13377","version":1},"attestation_state":"computed","paper":{"title":"Distributed weak independent sets in hypergraphs: Upper and lower bounds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Duncan Adamson, Paul G. Spirakis, Will Rosenbaum","submitted_at":"2024-11-20T14:58:47Z","abstract_excerpt":"In this paper, we consider the problem of finding weak independent sets in a distributed network represented by a hypergraph. In this setting, each edge contains a set of r vertices rather than simply a pair, as in a standard graph. A k-weak independent set in a hypergraph is a set where no edge contains more than k vertices in the independent set. We focus two variations of this problem. First, we study the problem of finding k-weak maximal independent sets, k-weak independent sets where each vertex belongs to at least one edge with k vertices in the independent set. Second we introduce a wea"},"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":"2411.13377","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-11-20T14:58:47Z","cross_cats_sorted":[],"title_canon_sha256":"a751ce927fa634764fbb3522a860db0765f691d717ddcd32e025aa6cf4f56fbe","abstract_canon_sha256":"2ba55717fd800a1622472b5d730e400eb89ff0bcde8400c9195d6ed0448ae8e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:09.480588Z","signature_b64":"XixSc3l070e7H1P/ey5ti6TtyWm6Bfzneabw92ofMZiZ0HhOxJhz/4rR74fSfU9O3UpOpG1wFRETVSVgw2bcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e61b6996b97e6e9d29258c6812db5394de3ff95c4ba7f2094e88fd6d8dedf92","last_reissued_at":"2026-07-05T09:38:09.480100Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:09.480100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed weak independent sets in hypergraphs: Upper and lower bounds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Duncan Adamson, Paul G. Spirakis, Will Rosenbaum","submitted_at":"2024-11-20T14:58:47Z","abstract_excerpt":"In this paper, we consider the problem of finding weak independent sets in a distributed network represented by a hypergraph. In this setting, each edge contains a set of r vertices rather than simply a pair, as in a standard graph. A k-weak independent set in a hypergraph is a set where no edge contains more than k vertices in the independent set. We focus two variations of this problem. First, we study the problem of finding k-weak maximal independent sets, k-weak independent sets where each vertex belongs to at least one edge with k vertices in the independent set. Second we introduce a wea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13377","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.13377/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.13377","created_at":"2026-07-05T09:38:09.480162+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.13377v1","created_at":"2026-07-05T09:38:09.480162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13377","created_at":"2026-07-05T09:38:09.480162+00:00"},{"alias_kind":"pith_short_12","alias_value":"PZQ3NGLLS7TO","created_at":"2026-07-05T09:38:09.480162+00:00"},{"alias_kind":"pith_short_16","alias_value":"PZQ3NGLLS7TOTUUS","created_at":"2026-07-05T09:38:09.480162+00:00"},{"alias_kind":"pith_short_8","alias_value":"PZQ3NGLL","created_at":"2026-07-05T09:38:09.480162+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/PZQ3NGLLS7TOTUUSLDDICLNVHF","json":"https://pith.science/pith/PZQ3NGLLS7TOTUUSLDDICLNVHF.json","graph_json":"https://pith.science/api/pith-number/PZQ3NGLLS7TOTUUSLDDICLNVHF/graph.json","events_json":"https://pith.science/api/pith-number/PZQ3NGLLS7TOTUUSLDDICLNVHF/events.json","paper":"https://pith.science/paper/PZQ3NGLL"},"agent_actions":{"view_html":"https://pith.science/pith/PZQ3NGLLS7TOTUUSLDDICLNVHF","download_json":"https://pith.science/pith/PZQ3NGLLS7TOTUUSLDDICLNVHF.json","view_paper":"https://pith.science/paper/PZQ3NGLL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.13377&json=true","fetch_graph":"https://pith.science/api/pith-number/PZQ3NGLLS7TOTUUSLDDICLNVHF/graph.json","fetch_events":"https://pith.science/api/pith-number/PZQ3NGLLS7TOTUUSLDDICLNVHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PZQ3NGLLS7TOTUUSLDDICLNVHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PZQ3NGLLS7TOTUUSLDDICLNVHF/action/storage_attestation","attest_author":"https://pith.science/pith/PZQ3NGLLS7TOTUUSLDDICLNVHF/action/author_attestation","sign_citation":"https://pith.science/pith/PZQ3NGLLS7TOTUUSLDDICLNVHF/action/citation_signature","submit_replication":"https://pith.science/pith/PZQ3NGLLS7TOTUUSLDDICLNVHF/action/replication_record"}},"created_at":"2026-07-05T09:38:09.480162+00:00","updated_at":"2026-07-05T09:38:09.480162+00:00"}