{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BYSDFLQUK6ZSD4XMPIDMOFFTZQ","short_pith_number":"pith:BYSDFLQU","canonical_record":{"source":{"id":"1803.09573","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-26T13:24:57Z","cross_cats_sorted":[],"title_canon_sha256":"4d139369db091f8abb3f0c7a7c4ad24ea801fc98c3cca72c64819df4d627001f","abstract_canon_sha256":"863428d354247ccd98d831496b723ee6770e4389018e08a89a20dc1d8877e9d0"},"schema_version":"1.0"},"canonical_sha256":"0e2432ae1457b321f2ec7a06c714b3cc1f03099b73bff67486346d41fbcb5317","source":{"kind":"arxiv","id":"1803.09573","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09573","created_at":"2026-05-17T23:43:51Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09573v3","created_at":"2026-05-17T23:43:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09573","created_at":"2026-05-17T23:43:51Z"},{"alias_kind":"pith_short_12","alias_value":"BYSDFLQUK6ZS","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BYSDFLQUK6ZSD4XM","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BYSDFLQU","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BYSDFLQUK6ZSD4XMPIDMOFFTZQ","target":"record","payload":{"canonical_record":{"source":{"id":"1803.09573","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-26T13:24:57Z","cross_cats_sorted":[],"title_canon_sha256":"4d139369db091f8abb3f0c7a7c4ad24ea801fc98c3cca72c64819df4d627001f","abstract_canon_sha256":"863428d354247ccd98d831496b723ee6770e4389018e08a89a20dc1d8877e9d0"},"schema_version":"1.0"},"canonical_sha256":"0e2432ae1457b321f2ec7a06c714b3cc1f03099b73bff67486346d41fbcb5317","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:51.337044Z","signature_b64":"D8l+Y6NZJ4bKWFM+NXINaylFXKKl6X2Gg30O6kVNnmU356FrPH3XvFJlEZeB2Tua5msvfQmqc/9+NF84u0bgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e2432ae1457b321f2ec7a06c714b3cc1f03099b73bff67486346d41fbcb5317","last_reissued_at":"2026-05-17T23:43:51.336390Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:51.336390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.09573","source_version":3,"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-17T23:43:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HmaOLBQiI7LSOlzcGJW/7Up8W05OhrZrstv0tEEDYRadmHc29dbtybU9P2hK7lZIcEdzs0y2wSGvwP9HGFttBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:26:49.404651Z"},"content_sha256":"1b1c5621d5378e25f7bc19f2f86b30abfdf100a53ccf5123e14597553d8c6c22","schema_version":"1.0","event_id":"sha256:1b1c5621d5378e25f7bc19f2f86b30abfdf100a53ccf5123e14597553d8c6c22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BYSDFLQUK6ZSD4XMPIDMOFFTZQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Colouring set families without monochromatic k-chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Roman Glebov, Shagnik Das, Tuan Tran","submitted_at":"2018-03-26T13:24:57Z","abstract_excerpt":"A coloured version of classic extremal problems dates back to Erd\\H{o}s and Rothschild, who in 1974 asked which $n$-vertex graph has the maximum number of 2-edge-colourings without monochromatic triangles. They conjectured that the answer is simply given by the largest triangle-free graph. Since then, this new class of coloured extremal problems has been extensively studied by various researchers. In this paper we pursue the Erd\\H{o}s--Rothschild versions of Sperner's Theorem, the classic result in extremal set theory on the size of the largest antichain in the Boolean lattice, and Erd\\H{o}s' "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09573","kind":"arxiv","version":3},"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-17T23:43:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/1OGO91YtTIRu8f1GD0J7mTiPZt0E6DixfhKkWzfF9wNkP6B43dlw1T5xsFqDvxVHDz7JZ2xOk4cLeqrOtlhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:26:49.404996Z"},"content_sha256":"df1dd07f4d930b0374072344f6664fd3eb544277df90add53df53976346fe81f","schema_version":"1.0","event_id":"sha256:df1dd07f4d930b0374072344f6664fd3eb544277df90add53df53976346fe81f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYSDFLQUK6ZSD4XMPIDMOFFTZQ/bundle.json","state_url":"https://pith.science/pith/BYSDFLQUK6ZSD4XMPIDMOFFTZQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYSDFLQUK6ZSD4XMPIDMOFFTZQ/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-31T09:26:49Z","links":{"resolver":"https://pith.science/pith/BYSDFLQUK6ZSD4XMPIDMOFFTZQ","bundle":"https://pith.science/pith/BYSDFLQUK6ZSD4XMPIDMOFFTZQ/bundle.json","state":"https://pith.science/pith/BYSDFLQUK6ZSD4XMPIDMOFFTZQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYSDFLQUK6ZSD4XMPIDMOFFTZQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BYSDFLQUK6ZSD4XMPIDMOFFTZQ","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":"863428d354247ccd98d831496b723ee6770e4389018e08a89a20dc1d8877e9d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-26T13:24:57Z","title_canon_sha256":"4d139369db091f8abb3f0c7a7c4ad24ea801fc98c3cca72c64819df4d627001f"},"schema_version":"1.0","source":{"id":"1803.09573","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09573","created_at":"2026-05-17T23:43:51Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09573v3","created_at":"2026-05-17T23:43:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09573","created_at":"2026-05-17T23:43:51Z"},{"alias_kind":"pith_short_12","alias_value":"BYSDFLQUK6ZS","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BYSDFLQUK6ZSD4XM","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BYSDFLQU","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:df1dd07f4d930b0374072344f6664fd3eb544277df90add53df53976346fe81f","target":"graph","created_at":"2026-05-17T23:43:51Z","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":"A coloured version of classic extremal problems dates back to Erd\\H{o}s and Rothschild, who in 1974 asked which $n$-vertex graph has the maximum number of 2-edge-colourings without monochromatic triangles. They conjectured that the answer is simply given by the largest triangle-free graph. Since then, this new class of coloured extremal problems has been extensively studied by various researchers. In this paper we pursue the Erd\\H{o}s--Rothschild versions of Sperner's Theorem, the classic result in extremal set theory on the size of the largest antichain in the Boolean lattice, and Erd\\H{o}s' ","authors_text":"Benny Sudakov, Roman Glebov, Shagnik Das, Tuan Tran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-26T13:24:57Z","title":"Colouring set families without monochromatic k-chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09573","kind":"arxiv","version":3},"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:1b1c5621d5378e25f7bc19f2f86b30abfdf100a53ccf5123e14597553d8c6c22","target":"record","created_at":"2026-05-17T23:43:51Z","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":"863428d354247ccd98d831496b723ee6770e4389018e08a89a20dc1d8877e9d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-26T13:24:57Z","title_canon_sha256":"4d139369db091f8abb3f0c7a7c4ad24ea801fc98c3cca72c64819df4d627001f"},"schema_version":"1.0","source":{"id":"1803.09573","kind":"arxiv","version":3}},"canonical_sha256":"0e2432ae1457b321f2ec7a06c714b3cc1f03099b73bff67486346d41fbcb5317","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e2432ae1457b321f2ec7a06c714b3cc1f03099b73bff67486346d41fbcb5317","first_computed_at":"2026-05-17T23:43:51.336390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:51.336390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D8l+Y6NZJ4bKWFM+NXINaylFXKKl6X2Gg30O6kVNnmU356FrPH3XvFJlEZeB2Tua5msvfQmqc/9+NF84u0bgBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:51.337044Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09573","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b1c5621d5378e25f7bc19f2f86b30abfdf100a53ccf5123e14597553d8c6c22","sha256:df1dd07f4d930b0374072344f6664fd3eb544277df90add53df53976346fe81f"],"state_sha256":"d340fa2bdc776c1100b541cac97472b4f265a22c1dd683a02b097cf7d7d59147"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BNmfnRUyYAYeX/H0pdwYXk0o3uDzvebHskKWht1ny1yAsnMs0YIXbxZz0YZnKnJrkaDJGJIFLH7XgREihLRWBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:26:49.407132Z","bundle_sha256":"4f42130b69d606bc6feab0d9d6490d8ec5e71218e22f3a084913f5cfacbd7cc0"}}