{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3CESDXHVIC4KAOFX4ZWV2JOJK6","short_pith_number":"pith:3CESDXHV","canonical_record":{"source":{"id":"1511.08772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-27T19:39:05Z","cross_cats_sorted":[],"title_canon_sha256":"3f12236aa2904805e570782edf4a8ecd318cea269e7e80b6c65f857563e2e813","abstract_canon_sha256":"71c1c3b765905e4bc9184b95ad10122e4a0cfbc137f64a5ba87709bce6695622"},"schema_version":"1.0"},"canonical_sha256":"d88921dcf540b8a038b7e66d5d25c957a776ff20968ade2c04940c3ba862aea1","source":{"kind":"arxiv","id":"1511.08772","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08772","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08772v1","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08772","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"3CESDXHVIC4K","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3CESDXHVIC4KAOFX","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3CESDXHV","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3CESDXHVIC4KAOFX4ZWV2JOJK6","target":"record","payload":{"canonical_record":{"source":{"id":"1511.08772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-27T19:39:05Z","cross_cats_sorted":[],"title_canon_sha256":"3f12236aa2904805e570782edf4a8ecd318cea269e7e80b6c65f857563e2e813","abstract_canon_sha256":"71c1c3b765905e4bc9184b95ad10122e4a0cfbc137f64a5ba87709bce6695622"},"schema_version":"1.0"},"canonical_sha256":"d88921dcf540b8a038b7e66d5d25c957a776ff20968ade2c04940c3ba862aea1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:48.137731Z","signature_b64":"ER5oaC3wXtV34epunf886KG3LA9IaXEDxQg/R97pHkrIymWijPI2iGHRwyIKktk6VAkq2hi3fAofMPlRXTC0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d88921dcf540b8a038b7e66d5d25c957a776ff20968ade2c04940c3ba862aea1","last_reissued_at":"2026-05-18T01:25:48.137233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:48.137233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.08772","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-18T01:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fGGyTcfh4ZeaV9X1zM1AXPptO6y5LxTvupMP8Ktj28+kxij9fZZizrcilH+Q90dquDFO37wJjAeO8KZSmPr/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:51:05.922744Z"},"content_sha256":"e4119c8bded7abf626e86cbff67760852d633bb0b731ca2dd423ee7c870dc6a7","schema_version":"1.0","event_id":"sha256:e4119c8bded7abf626e86cbff67760852d633bb0b731ca2dd423ee7c870dc6a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3CESDXHVIC4KAOFX4ZWV2JOJK6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cliques in the union of $C_4$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abeer Othman, Eli Berger","submitted_at":"2015-11-27T19:39:05Z","abstract_excerpt":"Let $B$ and $R$ be two simple graphs with vertex set $V$, and let $G(B,R)$ be the simple graph with vertex set $V$, in which two vertices are adjacent if they are adjacent in at least one of $B$ and $R$. We prove that if $B$ and $R$ are two $C_4$-free graphs on the same vertex set $V$ and $G(B,R)$ is the complete graph, then there exists an $B$-clique $X$, an $R$-clique $Y$ and a clique $Z$ in $B$ and $R$, such that $V=X\\cup Y\\cup Z$. Further, if $x\\in Z$ then $x$ is one of the vertices of some double $C_5$ in $G(B,R)$. In particular, if also $G(B,R)$ does not contains a double $C_5$, then $V$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08772","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-18T01:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IOC5ehohbGO4Q0dFCpW0mekuOsRqm2FA/+IeeQPKhIfFlsMExkNzwTpmwszmW1VnRNd+Czu5kBIKp2knAklBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:51:05.923082Z"},"content_sha256":"d9c12d1a66be1474e42dbe20b947ac7794fd18d9602cd080b0db3348003224dd","schema_version":"1.0","event_id":"sha256:d9c12d1a66be1474e42dbe20b947ac7794fd18d9602cd080b0db3348003224dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3CESDXHVIC4KAOFX4ZWV2JOJK6/bundle.json","state_url":"https://pith.science/pith/3CESDXHVIC4KAOFX4ZWV2JOJK6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3CESDXHVIC4KAOFX4ZWV2JOJK6/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-06-02T08:51:05Z","links":{"resolver":"https://pith.science/pith/3CESDXHVIC4KAOFX4ZWV2JOJK6","bundle":"https://pith.science/pith/3CESDXHVIC4KAOFX4ZWV2JOJK6/bundle.json","state":"https://pith.science/pith/3CESDXHVIC4KAOFX4ZWV2JOJK6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3CESDXHVIC4KAOFX4ZWV2JOJK6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3CESDXHVIC4KAOFX4ZWV2JOJK6","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":"71c1c3b765905e4bc9184b95ad10122e4a0cfbc137f64a5ba87709bce6695622","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-27T19:39:05Z","title_canon_sha256":"3f12236aa2904805e570782edf4a8ecd318cea269e7e80b6c65f857563e2e813"},"schema_version":"1.0","source":{"id":"1511.08772","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08772","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08772v1","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08772","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"3CESDXHVIC4K","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3CESDXHVIC4KAOFX","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3CESDXHV","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:d9c12d1a66be1474e42dbe20b947ac7794fd18d9602cd080b0db3348003224dd","target":"graph","created_at":"2026-05-18T01:25:48Z","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":"Let $B$ and $R$ be two simple graphs with vertex set $V$, and let $G(B,R)$ be the simple graph with vertex set $V$, in which two vertices are adjacent if they are adjacent in at least one of $B$ and $R$. We prove that if $B$ and $R$ are two $C_4$-free graphs on the same vertex set $V$ and $G(B,R)$ is the complete graph, then there exists an $B$-clique $X$, an $R$-clique $Y$ and a clique $Z$ in $B$ and $R$, such that $V=X\\cup Y\\cup Z$. Further, if $x\\in Z$ then $x$ is one of the vertices of some double $C_5$ in $G(B,R)$. In particular, if also $G(B,R)$ does not contains a double $C_5$, then $V$","authors_text":"Abeer Othman, Eli Berger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-27T19:39:05Z","title":"Cliques in the union of $C_4$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08772","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:e4119c8bded7abf626e86cbff67760852d633bb0b731ca2dd423ee7c870dc6a7","target":"record","created_at":"2026-05-18T01:25:48Z","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":"71c1c3b765905e4bc9184b95ad10122e4a0cfbc137f64a5ba87709bce6695622","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-27T19:39:05Z","title_canon_sha256":"3f12236aa2904805e570782edf4a8ecd318cea269e7e80b6c65f857563e2e813"},"schema_version":"1.0","source":{"id":"1511.08772","kind":"arxiv","version":1}},"canonical_sha256":"d88921dcf540b8a038b7e66d5d25c957a776ff20968ade2c04940c3ba862aea1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d88921dcf540b8a038b7e66d5d25c957a776ff20968ade2c04940c3ba862aea1","first_computed_at":"2026-05-18T01:25:48.137233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:48.137233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ER5oaC3wXtV34epunf886KG3LA9IaXEDxQg/R97pHkrIymWijPI2iGHRwyIKktk6VAkq2hi3fAofMPlRXTC0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:48.137731Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.08772","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4119c8bded7abf626e86cbff67760852d633bb0b731ca2dd423ee7c870dc6a7","sha256:d9c12d1a66be1474e42dbe20b947ac7794fd18d9602cd080b0db3348003224dd"],"state_sha256":"d176c0ed6a400c5785328de46c9f5958b310d18c9f6c6b78c446442eff25c4c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b3/b5K5+U7r7nCEHv7RONVRt1o547f63nTXROP39LXr4siiBbjUz7LxfePLMwcJE4zmSgYMw816V60YvY20vBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:51:05.924957Z","bundle_sha256":"6e20b531df5e1c374f533a40959a105ec5ca5901ee6b1fee4a1370aecd00fe18"}}