{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2UM6CLPNL2A2LDFWDIXXY76426","short_pith_number":"pith:2UM6CLPN","schema_version":"1.0","canonical_sha256":"d519e12ded5e81a58cb61a2f7c7fdcd78c81fd8054408ee363531e0037f1ac30","source":{"kind":"arxiv","id":"2211.04153","version":2},"attestation_state":"computed","paper":{"title":"Solution to a problem of Katona on counting cliques of weighted graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Carl Feghali, Peter Borg, R\\'emi Pellerin","submitted_at":"2022-11-08T10:50:37Z","abstract_excerpt":"A subset $I$ of the vertex set $V(G)$ of a graph $G$ is called a $k$-clique independent set of $G$ if no $k$ vertices in $I$ form a $k$-clique of $G$. An independent set is a $2$-clique independent set. Let $\\pi_k(G)$ denote the number of $k$-cliques of $G$. For a function $w: V(G) \\rightarrow \\{0, 1, 2, \\dots\\}$, let $G(w)$ be the graph obtained from $G$ by replacing each vertex $v$ by a $w(v)$-clique $K^v$ and making each vertex of $K^u$ adjacent to each vertex of $K^v$ for each edge $\\{u,v\\}$ of $G$. For an integer $m \\geq 1$, consider any $w$ with $\\sum_{v \\in V(G)} w(v) = m$. For $U \\subs"},"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":"2211.04153","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-08T10:50:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"254a0999baa328f4cd793316c969c3fe0fd8e62406267b708a97732686929851","abstract_canon_sha256":"44e5f1e7b5c37e8911f5e2cb667f3de9a228d230ded0ace0a7f04a76543c515c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:29:09.336556Z","signature_b64":"aTYSZ4WKaoaZtEOhQ3JZZhe3X+ccz9J15ZDXB6QUlWO7LrK7kPDyhTYVd4f+3sjElP88L+ut0dRc8d01wbB9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d519e12ded5e81a58cb61a2f7c7fdcd78c81fd8054408ee363531e0037f1ac30","last_reissued_at":"2026-07-05T07:29:09.336008Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:29:09.336008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solution to a problem of Katona on counting cliques of weighted graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Carl Feghali, Peter Borg, R\\'emi Pellerin","submitted_at":"2022-11-08T10:50:37Z","abstract_excerpt":"A subset $I$ of the vertex set $V(G)$ of a graph $G$ is called a $k$-clique independent set of $G$ if no $k$ vertices in $I$ form a $k$-clique of $G$. An independent set is a $2$-clique independent set. Let $\\pi_k(G)$ denote the number of $k$-cliques of $G$. For a function $w: V(G) \\rightarrow \\{0, 1, 2, \\dots\\}$, let $G(w)$ be the graph obtained from $G$ by replacing each vertex $v$ by a $w(v)$-clique $K^v$ and making each vertex of $K^u$ adjacent to each vertex of $K^v$ for each edge $\\{u,v\\}$ of $G$. For an integer $m \\geq 1$, consider any $w$ with $\\sum_{v \\in V(G)} w(v) = m$. For $U \\subs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.04153","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.04153/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2211.04153","created_at":"2026-07-05T07:29:09.336069+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.04153v2","created_at":"2026-07-05T07:29:09.336069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04153","created_at":"2026-07-05T07:29:09.336069+00:00"},{"alias_kind":"pith_short_12","alias_value":"2UM6CLPNL2A2","created_at":"2026-07-05T07:29:09.336069+00:00"},{"alias_kind":"pith_short_16","alias_value":"2UM6CLPNL2A2LDFW","created_at":"2026-07-05T07:29:09.336069+00:00"},{"alias_kind":"pith_short_8","alias_value":"2UM6CLPN","created_at":"2026-07-05T07:29:09.336069+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/2UM6CLPNL2A2LDFWDIXXY76426","json":"https://pith.science/pith/2UM6CLPNL2A2LDFWDIXXY76426.json","graph_json":"https://pith.science/api/pith-number/2UM6CLPNL2A2LDFWDIXXY76426/graph.json","events_json":"https://pith.science/api/pith-number/2UM6CLPNL2A2LDFWDIXXY76426/events.json","paper":"https://pith.science/paper/2UM6CLPN"},"agent_actions":{"view_html":"https://pith.science/pith/2UM6CLPNL2A2LDFWDIXXY76426","download_json":"https://pith.science/pith/2UM6CLPNL2A2LDFWDIXXY76426.json","view_paper":"https://pith.science/paper/2UM6CLPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.04153&json=true","fetch_graph":"https://pith.science/api/pith-number/2UM6CLPNL2A2LDFWDIXXY76426/graph.json","fetch_events":"https://pith.science/api/pith-number/2UM6CLPNL2A2LDFWDIXXY76426/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2UM6CLPNL2A2LDFWDIXXY76426/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2UM6CLPNL2A2LDFWDIXXY76426/action/storage_attestation","attest_author":"https://pith.science/pith/2UM6CLPNL2A2LDFWDIXXY76426/action/author_attestation","sign_citation":"https://pith.science/pith/2UM6CLPNL2A2LDFWDIXXY76426/action/citation_signature","submit_replication":"https://pith.science/pith/2UM6CLPNL2A2LDFWDIXXY76426/action/replication_record"}},"created_at":"2026-07-05T07:29:09.336069+00:00","updated_at":"2026-07-05T07:29:09.336069+00:00"}