{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VT4MKRHWK24BJQPIKAUCEWAYUF","short_pith_number":"pith:VT4MKRHW","schema_version":"1.0","canonical_sha256":"acf8c544f656b814c1e85028225818a17a18c40a78726021c52d70794b128d34","source":{"kind":"arxiv","id":"1405.1649","version":4},"attestation_state":"computed","paper":{"title":"Distributed Symmetry Breaking in Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Danupon Nanongkai, Gopal Pandurangan, Peter Robinson, Shay Kutten","submitted_at":"2014-05-07T15:48:36Z","abstract_excerpt":"Fundamental local symmetry breaking problems such as Maximal Independent Set (MIS) and coloring have been recognized as important by the community, and studied extensively in (standard) graphs. In particular, fast (i.e., logarithmic run time) randomized algorithms are well-established for MIS and $\\Delta +1$-coloring in both the LOCAL and CONGEST distributed computing models. On the other hand, comparatively much less is known on the complexity of distributed symmetry breaking in {\\em hypergraphs}. In particular, a key question is whether a fast (randomized) algorithm for MIS exists for hyperg"},"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":"1405.1649","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-05-07T15:48:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d066574ddab920e99b92b98cd545a03be6ab5dea44f471891664d7ef35399e73","abstract_canon_sha256":"8f0c2925ea63c87ecd85b9bfd2aa37aa35ab8701e03fc20bf9af0c1d6e4e6d8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:25.963908Z","signature_b64":"hNOGwmw/+5ffTQuEoYw6BVxRw7M8bstUHCL3zvIwRcudU0LbkrnjCI2U4L5Up3L3usFQo1fYvoJCzSMCpqUUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acf8c544f656b814c1e85028225818a17a18c40a78726021c52d70794b128d34","last_reissued_at":"2026-05-18T02:41:25.963321Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:25.963321Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Symmetry Breaking in Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Danupon Nanongkai, Gopal Pandurangan, Peter Robinson, Shay Kutten","submitted_at":"2014-05-07T15:48:36Z","abstract_excerpt":"Fundamental local symmetry breaking problems such as Maximal Independent Set (MIS) and coloring have been recognized as important by the community, and studied extensively in (standard) graphs. In particular, fast (i.e., logarithmic run time) randomized algorithms are well-established for MIS and $\\Delta +1$-coloring in both the LOCAL and CONGEST distributed computing models. On the other hand, comparatively much less is known on the complexity of distributed symmetry breaking in {\\em hypergraphs}. In particular, a key question is whether a fast (randomized) algorithm for MIS exists for hyperg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1649","kind":"arxiv","version":4},"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":"1405.1649","created_at":"2026-05-18T02:41:25.963406+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.1649v4","created_at":"2026-05-18T02:41:25.963406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1649","created_at":"2026-05-18T02:41:25.963406+00:00"},{"alias_kind":"pith_short_12","alias_value":"VT4MKRHWK24B","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VT4MKRHWK24BJQPI","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VT4MKRHW","created_at":"2026-05-18T12:28:54.890064+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/VT4MKRHWK24BJQPIKAUCEWAYUF","json":"https://pith.science/pith/VT4MKRHWK24BJQPIKAUCEWAYUF.json","graph_json":"https://pith.science/api/pith-number/VT4MKRHWK24BJQPIKAUCEWAYUF/graph.json","events_json":"https://pith.science/api/pith-number/VT4MKRHWK24BJQPIKAUCEWAYUF/events.json","paper":"https://pith.science/paper/VT4MKRHW"},"agent_actions":{"view_html":"https://pith.science/pith/VT4MKRHWK24BJQPIKAUCEWAYUF","download_json":"https://pith.science/pith/VT4MKRHWK24BJQPIKAUCEWAYUF.json","view_paper":"https://pith.science/paper/VT4MKRHW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.1649&json=true","fetch_graph":"https://pith.science/api/pith-number/VT4MKRHWK24BJQPIKAUCEWAYUF/graph.json","fetch_events":"https://pith.science/api/pith-number/VT4MKRHWK24BJQPIKAUCEWAYUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VT4MKRHWK24BJQPIKAUCEWAYUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VT4MKRHWK24BJQPIKAUCEWAYUF/action/storage_attestation","attest_author":"https://pith.science/pith/VT4MKRHWK24BJQPIKAUCEWAYUF/action/author_attestation","sign_citation":"https://pith.science/pith/VT4MKRHWK24BJQPIKAUCEWAYUF/action/citation_signature","submit_replication":"https://pith.science/pith/VT4MKRHWK24BJQPIKAUCEWAYUF/action/replication_record"}},"created_at":"2026-05-18T02:41:25.963406+00:00","updated_at":"2026-05-18T02:41:25.963406+00:00"}