{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:P6ORU2CL6DRJXMOIJ2ZML2ZTU7","short_pith_number":"pith:P6ORU2CL","schema_version":"1.0","canonical_sha256":"7f9d1a684bf0e29bb1c84eb2c5eb33a7fec19753ba03a2ae4c3f7d12e99a9ce0","source":{"kind":"arxiv","id":"1812.06448","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.06448","created_at":"2026-05-17T23:58:10.216912+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.06448v1","created_at":"2026-05-17T23:58:10.216912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06448","created_at":"2026-05-17T23:58:10.216912+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6ORU2CL6DRJ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6ORU2CL6DRJXMOI","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6ORU2CL","created_at":"2026-05-18T12:32:43.782077+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/P6ORU2CL6DRJXMOIJ2ZML2ZTU7","json":"https://pith.science/pith/P6ORU2CL6DRJXMOIJ2ZML2ZTU7.json","graph_json":"https://pith.science/api/pith-number/P6ORU2CL6DRJXMOIJ2ZML2ZTU7/graph.json","events_json":"https://pith.science/api/pith-number/P6ORU2CL6DRJXMOIJ2ZML2ZTU7/events.json","paper":"https://pith.science/paper/P6ORU2CL"},"agent_actions":{"view_html":"https://pith.science/pith/P6ORU2CL6DRJXMOIJ2ZML2ZTU7","download_json":"https://pith.science/pith/P6ORU2CL6DRJXMOIJ2ZML2ZTU7.json","view_paper":"https://pith.science/paper/P6ORU2CL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.06448&json=true","fetch_graph":"https://pith.science/api/pith-number/P6ORU2CL6DRJXMOIJ2ZML2ZTU7/graph.json","fetch_events":"https://pith.science/api/pith-number/P6ORU2CL6DRJXMOIJ2ZML2ZTU7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6ORU2CL6DRJXMOIJ2ZML2ZTU7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6ORU2CL6DRJXMOIJ2ZML2ZTU7/action/storage_attestation","attest_author":"https://pith.science/pith/P6ORU2CL6DRJXMOIJ2ZML2ZTU7/action/author_attestation","sign_citation":"https://pith.science/pith/P6ORU2CL6DRJXMOIJ2ZML2ZTU7/action/citation_signature","submit_replication":"https://pith.science/pith/P6ORU2CL6DRJXMOIJ2ZML2ZTU7/action/replication_record"}},"created_at":"2026-05-17T23:58:10.216912+00:00","updated_at":"2026-05-17T23:58:10.216912+00:00"}