{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:P6ORU2CL6DRJXMOIJ2ZML2ZTU7","short_pith_number":"pith:P6ORU2CL","canonical_record":{"source":{"id":"1812.06448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-16T11:46:09Z","cross_cats_sorted":[],"title_canon_sha256":"8d5ffa78cd9437317b4047d178d9cc1c85c7927352d8c71738ac3bcb60724c2a","abstract_canon_sha256":"b5c488a432ddec637eb0c2f5b396693283429003f04a71de7ddb6a56bbeaf265"},"schema_version":"1.0"},"canonical_sha256":"7f9d1a684bf0e29bb1c84eb2c5eb33a7fec19753ba03a2ae4c3f7d12e99a9ce0","source":{"kind":"arxiv","id":"1812.06448","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06448","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06448v1","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06448","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"P6ORU2CL6DRJ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P6ORU2CL6DRJXMOI","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P6ORU2CL","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:P6ORU2CL6DRJXMOIJ2ZML2ZTU7","target":"record","payload":{"canonical_record":{"source":{"id":"1812.06448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-16T11:46:09Z","cross_cats_sorted":[],"title_canon_sha256":"8d5ffa78cd9437317b4047d178d9cc1c85c7927352d8c71738ac3bcb60724c2a","abstract_canon_sha256":"b5c488a432ddec637eb0c2f5b396693283429003f04a71de7ddb6a56bbeaf265"},"schema_version":"1.0"},"canonical_sha256":"7f9d1a684bf0e29bb1c84eb2c5eb33a7fec19753ba03a2ae4c3f7d12e99a9ce0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:10.217339Z","signature_b64":"21+N0HhmrBHF7gYwzmzDIkbx0nRht37LSwy90k51FYlfvcFnJT4FpgL77a/8MX3JUnOz39Yr48H3xZYXygfOAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f9d1a684bf0e29bb1c84eb2c5eb33a7fec19753ba03a2ae4c3f7d12e99a9ce0","last_reissued_at":"2026-05-17T23:58:10.216849Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:10.216849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.06448","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-17T23:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XPqykjAti3so+EVCxmc+RuBN3PS2Bij8cOG0OwOm0iUGKyWdM3HxFwaHaJPdvAsg/4Hc0lr9qxRxg+gxwZHCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:25:25.795877Z"},"content_sha256":"eb77e29d01d081042f68038941b219921fa8c8069ca9f4228fa47ae2e621072e","schema_version":"1.0","event_id":"sha256:eb77e29d01d081042f68038941b219921fa8c8069ca9f4228fa47ae2e621072e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:P6ORU2CL6DRJXMOIJ2ZML2ZTU7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partitioning the power set of $[n]$ into $C_k$-free parts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'as Gy\\'arf\\'as, Eben Blaisdell, Robert A. Krueger, Ronen Wdowinski","submitted_at":"2018-12-16T11:46:09Z","abstract_excerpt":"We show that for $n \\geq 3, n\\ne 5$, in any partition of $\\mathcal{P}(n)$, the set of all subsets of $[n]=\\{1,2,\\dots,n\\}$, into $2^{n-2}-1$ parts, some part must contain a triangle --- three different subsets $A,B,C\\subseteq [n]$ such that $A\\cap B$, $A\\cap C$, and $B\\cap C$ have distinct representatives. This is sharp, since by placing two complementary pairs of sets into each partition class, we have a partition into $2^{n-2}$ triangle-free parts. We also address a more general Ramsey-type problem: for a given graph $G$, find (estimate) $f(n,G)$, the smallest number of colors needed for a c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06448","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-17T23:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M1lmT/il2cqTfyIG0xD+R+ZMRp1tzKXQWVgTwtvZV/NC/dk2rL8QUetnEfbJsDLqZMV6IbWKrisuzZwbu0KRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:25:25.796683Z"},"content_sha256":"a19b95bffa74bb72803fe64fe08e9496eaed453c18299e2917f246c95ee392f9","schema_version":"1.0","event_id":"sha256:a19b95bffa74bb72803fe64fe08e9496eaed453c18299e2917f246c95ee392f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6ORU2CL6DRJXMOIJ2ZML2ZTU7/bundle.json","state_url":"https://pith.science/pith/P6ORU2CL6DRJXMOIJ2ZML2ZTU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6ORU2CL6DRJXMOIJ2ZML2ZTU7/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-31T23:25:25Z","links":{"resolver":"https://pith.science/pith/P6ORU2CL6DRJXMOIJ2ZML2ZTU7","bundle":"https://pith.science/pith/P6ORU2CL6DRJXMOIJ2ZML2ZTU7/bundle.json","state":"https://pith.science/pith/P6ORU2CL6DRJXMOIJ2ZML2ZTU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6ORU2CL6DRJXMOIJ2ZML2ZTU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:P6ORU2CL6DRJXMOIJ2ZML2ZTU7","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":"b5c488a432ddec637eb0c2f5b396693283429003f04a71de7ddb6a56bbeaf265","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-16T11:46:09Z","title_canon_sha256":"8d5ffa78cd9437317b4047d178d9cc1c85c7927352d8c71738ac3bcb60724c2a"},"schema_version":"1.0","source":{"id":"1812.06448","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06448","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06448v1","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06448","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"P6ORU2CL6DRJ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P6ORU2CL6DRJXMOI","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P6ORU2CL","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:a19b95bffa74bb72803fe64fe08e9496eaed453c18299e2917f246c95ee392f9","target":"graph","created_at":"2026-05-17T23:58:10Z","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 show that for $n \\geq 3, n\\ne 5$, in any partition of $\\mathcal{P}(n)$, the set of all subsets of $[n]=\\{1,2,\\dots,n\\}$, into $2^{n-2}-1$ parts, some part must contain a triangle --- three different subsets $A,B,C\\subseteq [n]$ such that $A\\cap B$, $A\\cap C$, and $B\\cap C$ have distinct representatives. This is sharp, since by placing two complementary pairs of sets into each partition class, we have a partition into $2^{n-2}$ triangle-free parts. We also address a more general Ramsey-type problem: for a given graph $G$, find (estimate) $f(n,G)$, the smallest number of colors needed for a c","authors_text":"Andr\\'as Gy\\'arf\\'as, Eben Blaisdell, Robert A. Krueger, Ronen Wdowinski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-16T11:46:09Z","title":"Partitioning the power set of $[n]$ into $C_k$-free parts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06448","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:eb77e29d01d081042f68038941b219921fa8c8069ca9f4228fa47ae2e621072e","target":"record","created_at":"2026-05-17T23:58:10Z","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":"b5c488a432ddec637eb0c2f5b396693283429003f04a71de7ddb6a56bbeaf265","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-16T11:46:09Z","title_canon_sha256":"8d5ffa78cd9437317b4047d178d9cc1c85c7927352d8c71738ac3bcb60724c2a"},"schema_version":"1.0","source":{"id":"1812.06448","kind":"arxiv","version":1}},"canonical_sha256":"7f9d1a684bf0e29bb1c84eb2c5eb33a7fec19753ba03a2ae4c3f7d12e99a9ce0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f9d1a684bf0e29bb1c84eb2c5eb33a7fec19753ba03a2ae4c3f7d12e99a9ce0","first_computed_at":"2026-05-17T23:58:10.216849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:10.216849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"21+N0HhmrBHF7gYwzmzDIkbx0nRht37LSwy90k51FYlfvcFnJT4FpgL77a/8MX3JUnOz39Yr48H3xZYXygfOAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:10.217339Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.06448","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb77e29d01d081042f68038941b219921fa8c8069ca9f4228fa47ae2e621072e","sha256:a19b95bffa74bb72803fe64fe08e9496eaed453c18299e2917f246c95ee392f9"],"state_sha256":"c2f6b135301fe8531861db86c2901581c9e60f61724e2a7d8ac8a897b188210e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fl31+kezbQ4miLoXiBuccKgMjbd1k9wTh2yd4OxjG38i4KzhWQkt1baCrHXh+K6oRyoIozROs4CJQ07GC4jFAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:25:25.800846Z","bundle_sha256":"59aeab40b3c5df669c243dbc1314499e0319c605bc406a76809063fdb81ab7fd"}}