{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3I75IMBECDL5I2CCPGWLPUI2LS","short_pith_number":"pith:3I75IMBE","canonical_record":{"source":{"id":"1707.01983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-07-06T22:27:08Z","cross_cats_sorted":["cond-mat.stat-mech","cs.DM","math.PR"],"title_canon_sha256":"850438a204c4ebaafdd9157b0d5507670c292dcbc20b2ab2182685f49a3f3526","abstract_canon_sha256":"a9f714f68edb2f806763532d4aaf9d3728ca5a9e2cff2a16fda82cf554189fce"},"schema_version":"1.0"},"canonical_sha256":"da3fd4302410d7d4684279acb7d11a5cb153325f39da7de071891762a9e20aa0","source":{"kind":"arxiv","id":"1707.01983","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01983","created_at":"2026-05-18T00:23:14Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01983v1","created_at":"2026-05-18T00:23:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01983","created_at":"2026-05-18T00:23:14Z"},{"alias_kind":"pith_short_12","alias_value":"3I75IMBECDL5","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3I75IMBECDL5I2CC","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3I75IMBE","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3I75IMBECDL5I2CCPGWLPUI2LS","target":"record","payload":{"canonical_record":{"source":{"id":"1707.01983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-07-06T22:27:08Z","cross_cats_sorted":["cond-mat.stat-mech","cs.DM","math.PR"],"title_canon_sha256":"850438a204c4ebaafdd9157b0d5507670c292dcbc20b2ab2182685f49a3f3526","abstract_canon_sha256":"a9f714f68edb2f806763532d4aaf9d3728ca5a9e2cff2a16fda82cf554189fce"},"schema_version":"1.0"},"canonical_sha256":"da3fd4302410d7d4684279acb7d11a5cb153325f39da7de071891762a9e20aa0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:14.143988Z","signature_b64":"+1MFo/8R6KEw0+OsJayYS6BJ347947jYiqgp78ufxV5bLiqa0mxIVl0lbk1B2R7o/s1HirWskxhL0wr4UjpuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da3fd4302410d7d4684279acb7d11a5cb153325f39da7de071891762a9e20aa0","last_reissued_at":"2026-05-18T00:23:14.143289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:14.143289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.01983","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-18T00:23:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9SLfQbN5MP/tTZXhhAt6RrnqJo+9/nGuUM8TKF86iqprFmbPId7pjU9SdzAIi9xRghGXmOVOKGrCH2ZPUotYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:22:08.704253Z"},"content_sha256":"b8bf99aafeb17380866f522a650ffcf121f14d75a5646d5a5a8374ab0c5c0071","schema_version":"1.0","event_id":"sha256:b8bf99aafeb17380866f522a650ffcf121f14d75a5646d5a5a8374ab0c5c0071"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3I75IMBECDL5I2CCPGWLPUI2LS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Phase transitions in the $q$-coloring of random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.DM","math.PR"],"primary_cat":"cond-mat.dis-nn","authors_text":"Guilhem Semerjian, Lenka Zdeborov\\'a, Marylou Gabri\\'e, Varsha Dani","submitted_at":"2017-07-06T22:27:08Z","abstract_excerpt":"We study in this paper the structure of solutions in the random hypergraph coloring problem and the phase transitions they undergo when the density of constraints is varied. Hypergraph coloring is a constraint satisfaction problem where each constraint includes $K$ variables that must be assigned one out of $q$ colors in such a way that there are no monochromatic constraints, i.e. there are at least two distinct colors in the set of variables belonging to every constraint. This problem generalizes naturally coloring of random graphs ($K=2$) and bicoloring of random hypergraphs ($q=2$), both of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01983","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-18T00:23:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LOmN1kF3SQ1WKp6bw2+88tlx1ksZle+cvwLac7wn9yBKxztVBE7cRRF0C31rEWZlzJTkqZ0J+fHKRR50tAaPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:22:08.704905Z"},"content_sha256":"82f6f21601328d93ffc6c477aa527dc16d5a88f8c3aa96a617a6d3b4f2f6012c","schema_version":"1.0","event_id":"sha256:82f6f21601328d93ffc6c477aa527dc16d5a88f8c3aa96a617a6d3b4f2f6012c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3I75IMBECDL5I2CCPGWLPUI2LS/bundle.json","state_url":"https://pith.science/pith/3I75IMBECDL5I2CCPGWLPUI2LS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3I75IMBECDL5I2CCPGWLPUI2LS/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-05-28T15:22:08Z","links":{"resolver":"https://pith.science/pith/3I75IMBECDL5I2CCPGWLPUI2LS","bundle":"https://pith.science/pith/3I75IMBECDL5I2CCPGWLPUI2LS/bundle.json","state":"https://pith.science/pith/3I75IMBECDL5I2CCPGWLPUI2LS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3I75IMBECDL5I2CCPGWLPUI2LS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3I75IMBECDL5I2CCPGWLPUI2LS","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":"a9f714f68edb2f806763532d4aaf9d3728ca5a9e2cff2a16fda82cf554189fce","cross_cats_sorted":["cond-mat.stat-mech","cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-07-06T22:27:08Z","title_canon_sha256":"850438a204c4ebaafdd9157b0d5507670c292dcbc20b2ab2182685f49a3f3526"},"schema_version":"1.0","source":{"id":"1707.01983","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01983","created_at":"2026-05-18T00:23:14Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01983v1","created_at":"2026-05-18T00:23:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01983","created_at":"2026-05-18T00:23:14Z"},{"alias_kind":"pith_short_12","alias_value":"3I75IMBECDL5","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3I75IMBECDL5I2CC","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3I75IMBE","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:82f6f21601328d93ffc6c477aa527dc16d5a88f8c3aa96a617a6d3b4f2f6012c","target":"graph","created_at":"2026-05-18T00:23: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":"We study in this paper the structure of solutions in the random hypergraph coloring problem and the phase transitions they undergo when the density of constraints is varied. Hypergraph coloring is a constraint satisfaction problem where each constraint includes $K$ variables that must be assigned one out of $q$ colors in such a way that there are no monochromatic constraints, i.e. there are at least two distinct colors in the set of variables belonging to every constraint. This problem generalizes naturally coloring of random graphs ($K=2$) and bicoloring of random hypergraphs ($q=2$), both of","authors_text":"Guilhem Semerjian, Lenka Zdeborov\\'a, Marylou Gabri\\'e, Varsha Dani","cross_cats":["cond-mat.stat-mech","cs.DM","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-07-06T22:27:08Z","title":"Phase transitions in the $q$-coloring of random hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01983","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:b8bf99aafeb17380866f522a650ffcf121f14d75a5646d5a5a8374ab0c5c0071","target":"record","created_at":"2026-05-18T00:23: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":"a9f714f68edb2f806763532d4aaf9d3728ca5a9e2cff2a16fda82cf554189fce","cross_cats_sorted":["cond-mat.stat-mech","cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-07-06T22:27:08Z","title_canon_sha256":"850438a204c4ebaafdd9157b0d5507670c292dcbc20b2ab2182685f49a3f3526"},"schema_version":"1.0","source":{"id":"1707.01983","kind":"arxiv","version":1}},"canonical_sha256":"da3fd4302410d7d4684279acb7d11a5cb153325f39da7de071891762a9e20aa0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da3fd4302410d7d4684279acb7d11a5cb153325f39da7de071891762a9e20aa0","first_computed_at":"2026-05-18T00:23:14.143289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:14.143289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+1MFo/8R6KEw0+OsJayYS6BJ347947jYiqgp78ufxV5bLiqa0mxIVl0lbk1B2R7o/s1HirWskxhL0wr4UjpuCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:14.143988Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01983","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8bf99aafeb17380866f522a650ffcf121f14d75a5646d5a5a8374ab0c5c0071","sha256:82f6f21601328d93ffc6c477aa527dc16d5a88f8c3aa96a617a6d3b4f2f6012c"],"state_sha256":"cf31ec93003579d32d98336f6b718a8ee4ce6d4db3531e534f9b407e6a59e503"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yt85qLj1nW/ZxlbGlDVMAohg7yh0vvUIUxAiMuLYozmIlJuoc/Qppmh79nRveK/lyeI/PFZ/J6RfAzkUuZwdCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:22:08.707977Z","bundle_sha256":"ba2af8bb4b29945d7564ffa69f67260efd2d14d7070b4a2c0e5286c63aa3583b"}}