{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LQ3OMK4LUNC7GSXW7OBZFJBCEC","short_pith_number":"pith:LQ3OMK4L","schema_version":"1.0","canonical_sha256":"5c36e62b8ba345f34af6fb8392a42220b9ef957b5431668444f0d201552fdc18","source":{"kind":"arxiv","id":"1307.6443","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.6443","created_at":"2026-05-18T03:17:36.507112+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.6443v1","created_at":"2026-05-18T03:17:36.507112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6443","created_at":"2026-05-18T03:17:36.507112+00:00"},{"alias_kind":"pith_short_12","alias_value":"LQ3OMK4LUNC7","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LQ3OMK4LUNC7GSXW","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LQ3OMK4L","created_at":"2026-05-18T12:27:51.066281+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/LQ3OMK4LUNC7GSXW7OBZFJBCEC","json":"https://pith.science/pith/LQ3OMK4LUNC7GSXW7OBZFJBCEC.json","graph_json":"https://pith.science/api/pith-number/LQ3OMK4LUNC7GSXW7OBZFJBCEC/graph.json","events_json":"https://pith.science/api/pith-number/LQ3OMK4LUNC7GSXW7OBZFJBCEC/events.json","paper":"https://pith.science/paper/LQ3OMK4L"},"agent_actions":{"view_html":"https://pith.science/pith/LQ3OMK4LUNC7GSXW7OBZFJBCEC","download_json":"https://pith.science/pith/LQ3OMK4LUNC7GSXW7OBZFJBCEC.json","view_paper":"https://pith.science/paper/LQ3OMK4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.6443&json=true","fetch_graph":"https://pith.science/api/pith-number/LQ3OMK4LUNC7GSXW7OBZFJBCEC/graph.json","fetch_events":"https://pith.science/api/pith-number/LQ3OMK4LUNC7GSXW7OBZFJBCEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LQ3OMK4LUNC7GSXW7OBZFJBCEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LQ3OMK4LUNC7GSXW7OBZFJBCEC/action/storage_attestation","attest_author":"https://pith.science/pith/LQ3OMK4LUNC7GSXW7OBZFJBCEC/action/author_attestation","sign_citation":"https://pith.science/pith/LQ3OMK4LUNC7GSXW7OBZFJBCEC/action/citation_signature","submit_replication":"https://pith.science/pith/LQ3OMK4LUNC7GSXW7OBZFJBCEC/action/replication_record"}},"created_at":"2026-05-18T03:17:36.507112+00:00","updated_at":"2026-05-18T03:17:36.507112+00:00"}