{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LQ3OMK4LUNC7GSXW7OBZFJBCEC","short_pith_number":"pith:LQ3OMK4L","canonical_record":{"source":{"id":"1307.6443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-24T14:58:00Z","cross_cats_sorted":[],"title_canon_sha256":"31e12ed8e8f6ad3363975bd2daae40eef9c3423d90bccd534ad553b7155baed9","abstract_canon_sha256":"7a837663be1b9f470e7e9e49e19160dbf96de549dc2145f6f9faea8bbb2ccc30"},"schema_version":"1.0"},"canonical_sha256":"5c36e62b8ba345f34af6fb8392a42220b9ef957b5431668444f0d201552fdc18","source":{"kind":"arxiv","id":"1307.6443","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6443","created_at":"2026-05-18T03:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6443v1","created_at":"2026-05-18T03:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6443","created_at":"2026-05-18T03:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"LQ3OMK4LUNC7","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LQ3OMK4LUNC7GSXW","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LQ3OMK4L","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LQ3OMK4LUNC7GSXW7OBZFJBCEC","target":"record","payload":{"canonical_record":{"source":{"id":"1307.6443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-24T14:58:00Z","cross_cats_sorted":[],"title_canon_sha256":"31e12ed8e8f6ad3363975bd2daae40eef9c3423d90bccd534ad553b7155baed9","abstract_canon_sha256":"7a837663be1b9f470e7e9e49e19160dbf96de549dc2145f6f9faea8bbb2ccc30"},"schema_version":"1.0"},"canonical_sha256":"5c36e62b8ba345f34af6fb8392a42220b9ef957b5431668444f0d201552fdc18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:36.507524Z","signature_b64":"Uah8hCYOVaZgU5KwKv66KupIm6u5zDmLB/oYR2B58gJq+Cpdk5ZyXmhJdP3HNAGTSztiC6RzL3tYe7zR8FvJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c36e62b8ba345f34af6fb8392a42220b9ef957b5431668444f0d201552fdc18","last_reissued_at":"2026-05-18T03:17:36.507015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:36.507015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.6443","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-18T03:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HnHu5vIHig/yCb+6bCiTJF55WVSpOkJG7rWzt044JS1zlNqTD9vMEok6M7q1yOjZ7Gy6b3rA9TJ0Zc7uylZhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:11:03.316782Z"},"content_sha256":"ae60ff1df264981c9918db72a7da2b7ee1239a46e4dc4712cd1c52f105da0ec1","schema_version":"1.0","event_id":"sha256:ae60ff1df264981c9918db72a7da2b7ee1239a46e4dc4712cd1c52f105da0ec1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LQ3OMK4LUNC7GSXW7OBZFJBCEC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clique numbers of graph unions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Juba Ziani, Maria Chudnovsky","submitted_at":"2013-07-24T14:58:00Z","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$. For $X \\subseteq V$, we denote by $B|X$ the subgraph of $B$ induced by $X$; let $R|X$ and $G(B,R)|X$ be defined similarly. We say that the pair $(B,R)$ is {\\em additive} if for every $X \\subseteq V$, the sum of the clique numbers of $B|X$ and $R|X$ is at least the clique number of $G(B,R)|X$. In this paper we give a necessary and sufficient characterization of additive pairs of graphs. This is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6443","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-18T03:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SCrG+CjAqZa6UP6YhLuxzI78uvzMTf3S5QOpeJa/k3R5iZM6mAXPPUWPyIymCtMWrsknuF6LSJ1Avz31cF2ABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:11:03.317117Z"},"content_sha256":"4145446456f8cc2346753c89b227c3fac5ddf6e31a0856b99b92e35709ec5d54","schema_version":"1.0","event_id":"sha256:4145446456f8cc2346753c89b227c3fac5ddf6e31a0856b99b92e35709ec5d54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQ3OMK4LUNC7GSXW7OBZFJBCEC/bundle.json","state_url":"https://pith.science/pith/LQ3OMK4LUNC7GSXW7OBZFJBCEC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQ3OMK4LUNC7GSXW7OBZFJBCEC/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-20T14:11:03Z","links":{"resolver":"https://pith.science/pith/LQ3OMK4LUNC7GSXW7OBZFJBCEC","bundle":"https://pith.science/pith/LQ3OMK4LUNC7GSXW7OBZFJBCEC/bundle.json","state":"https://pith.science/pith/LQ3OMK4LUNC7GSXW7OBZFJBCEC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQ3OMK4LUNC7GSXW7OBZFJBCEC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LQ3OMK4LUNC7GSXW7OBZFJBCEC","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":"7a837663be1b9f470e7e9e49e19160dbf96de549dc2145f6f9faea8bbb2ccc30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-24T14:58:00Z","title_canon_sha256":"31e12ed8e8f6ad3363975bd2daae40eef9c3423d90bccd534ad553b7155baed9"},"schema_version":"1.0","source":{"id":"1307.6443","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6443","created_at":"2026-05-18T03:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6443v1","created_at":"2026-05-18T03:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6443","created_at":"2026-05-18T03:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"LQ3OMK4LUNC7","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LQ3OMK4LUNC7GSXW","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LQ3OMK4L","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:4145446456f8cc2346753c89b227c3fac5ddf6e31a0856b99b92e35709ec5d54","target":"graph","created_at":"2026-05-18T03:17:36Z","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$. For $X \\subseteq V$, we denote by $B|X$ the subgraph of $B$ induced by $X$; let $R|X$ and $G(B,R)|X$ be defined similarly. We say that the pair $(B,R)$ is {\\em additive} if for every $X \\subseteq V$, the sum of the clique numbers of $B|X$ and $R|X$ is at least the clique number of $G(B,R)|X$. In this paper we give a necessary and sufficient characterization of additive pairs of graphs. This is","authors_text":"Juba Ziani, Maria Chudnovsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-24T14:58:00Z","title":"Clique numbers of graph unions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6443","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:ae60ff1df264981c9918db72a7da2b7ee1239a46e4dc4712cd1c52f105da0ec1","target":"record","created_at":"2026-05-18T03:17:36Z","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":"7a837663be1b9f470e7e9e49e19160dbf96de549dc2145f6f9faea8bbb2ccc30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-24T14:58:00Z","title_canon_sha256":"31e12ed8e8f6ad3363975bd2daae40eef9c3423d90bccd534ad553b7155baed9"},"schema_version":"1.0","source":{"id":"1307.6443","kind":"arxiv","version":1}},"canonical_sha256":"5c36e62b8ba345f34af6fb8392a42220b9ef957b5431668444f0d201552fdc18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c36e62b8ba345f34af6fb8392a42220b9ef957b5431668444f0d201552fdc18","first_computed_at":"2026-05-18T03:17:36.507015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:36.507015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uah8hCYOVaZgU5KwKv66KupIm6u5zDmLB/oYR2B58gJq+Cpdk5ZyXmhJdP3HNAGTSztiC6RzL3tYe7zR8FvJAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:36.507524Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.6443","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae60ff1df264981c9918db72a7da2b7ee1239a46e4dc4712cd1c52f105da0ec1","sha256:4145446456f8cc2346753c89b227c3fac5ddf6e31a0856b99b92e35709ec5d54"],"state_sha256":"ecceef2a48a3fe08a739c975ce664643f215511d3110214c0ea13f983263ae48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rq/S7H1+PWfMBr8V4f9yYc6z8ba1Fo3yAy7q1e6RX7ZBue24r5FoNNkPEBMKQZCD/bbjXs08pfCYpjvW41b6Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T14:11:03.319100Z","bundle_sha256":"30e4e358e7ab97a333872f1bb41866c8bdb7242f3f4c43063708d2d60292036a"}}