{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:P6JRX32X5L2K4ABGV6PP4CDUTJ","short_pith_number":"pith:P6JRX32X","schema_version":"1.0","canonical_sha256":"7f931bef57eaf4ae0026af9efe08749a69df4c369e3b327b975e085103ca8442","source":{"kind":"arxiv","id":"1709.02990","version":2},"attestation_state":"computed","paper":{"title":"Large monochromatic components and long monochromatic cycles in random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Dudek, Louis DeBiasio, Patrick Bennett, Sean English","submitted_at":"2017-09-09T18:25:24Z","abstract_excerpt":"We extend results of Gy\\'arf\\'as and F\\\"uredi on the largest monochromatic component in $r$-colored complete $k$-uniform hypergraphs to the setting of random hypergraphs. We also study long monochromatic loose cycles in $r$-colored random hypergraphs. In particular, we obtain a random analog of a result of Gy\\'arf\\'as, S\\'ark\\\"ozy, and Szemer\\'edi on the longest monochromatic loose cycle in $2$-colored complete $k$-uniform hypergraphs."},"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":"1709.02990","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-09T18:25:24Z","cross_cats_sorted":[],"title_canon_sha256":"6034a9353e412ba1aee1b2533b418f906c304b2e16e11fec53c7df345bc7059f","abstract_canon_sha256":"16bd5123cf7302dcb75c5afcace0ce270b121bbc6899a46d546cb4edca694507"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:47.732986Z","signature_b64":"OwzOaBg2bqb4YML76dr4suNSt/yUSsZGL3txF7UZtcFjEtu9+avui3NDD/79Rq0/wWzTxPFUJki+SgAn+DLfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f931bef57eaf4ae0026af9efe08749a69df4c369e3b327b975e085103ca8442","last_reissued_at":"2026-05-18T00:09:47.732381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:47.732381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large monochromatic components and long monochromatic cycles in random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Dudek, Louis DeBiasio, Patrick Bennett, Sean English","submitted_at":"2017-09-09T18:25:24Z","abstract_excerpt":"We extend results of Gy\\'arf\\'as and F\\\"uredi on the largest monochromatic component in $r$-colored complete $k$-uniform hypergraphs to the setting of random hypergraphs. We also study long monochromatic loose cycles in $r$-colored random hypergraphs. In particular, we obtain a random analog of a result of Gy\\'arf\\'as, S\\'ark\\\"ozy, and Szemer\\'edi on the longest monochromatic loose cycle in $2$-colored complete $k$-uniform hypergraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02990","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.02990","created_at":"2026-05-18T00:09:47.732483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.02990v2","created_at":"2026-05-18T00:09:47.732483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02990","created_at":"2026-05-18T00:09:47.732483+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6JRX32X5L2K","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6JRX32X5L2K4ABG","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6JRX32X","created_at":"2026-05-18T12:31:37.085036+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/P6JRX32X5L2K4ABGV6PP4CDUTJ","json":"https://pith.science/pith/P6JRX32X5L2K4ABGV6PP4CDUTJ.json","graph_json":"https://pith.science/api/pith-number/P6JRX32X5L2K4ABGV6PP4CDUTJ/graph.json","events_json":"https://pith.science/api/pith-number/P6JRX32X5L2K4ABGV6PP4CDUTJ/events.json","paper":"https://pith.science/paper/P6JRX32X"},"agent_actions":{"view_html":"https://pith.science/pith/P6JRX32X5L2K4ABGV6PP4CDUTJ","download_json":"https://pith.science/pith/P6JRX32X5L2K4ABGV6PP4CDUTJ.json","view_paper":"https://pith.science/paper/P6JRX32X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.02990&json=true","fetch_graph":"https://pith.science/api/pith-number/P6JRX32X5L2K4ABGV6PP4CDUTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/P6JRX32X5L2K4ABGV6PP4CDUTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6JRX32X5L2K4ABGV6PP4CDUTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6JRX32X5L2K4ABGV6PP4CDUTJ/action/storage_attestation","attest_author":"https://pith.science/pith/P6JRX32X5L2K4ABGV6PP4CDUTJ/action/author_attestation","sign_citation":"https://pith.science/pith/P6JRX32X5L2K4ABGV6PP4CDUTJ/action/citation_signature","submit_replication":"https://pith.science/pith/P6JRX32X5L2K4ABGV6PP4CDUTJ/action/replication_record"}},"created_at":"2026-05-18T00:09:47.732483+00:00","updated_at":"2026-05-18T00:09:47.732483+00:00"}