{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4NDCIVSFVZ4SAMJ6DFDVCTB4LQ","short_pith_number":"pith:4NDCIVSF","schema_version":"1.0","canonical_sha256":"e346245645ae7920313e1947514c3c5c0174afc7c667fa5d3a3f3eba6e5a6c8e","source":{"kind":"arxiv","id":"1403.6210","version":2},"attestation_state":"computed","paper":{"title":"Clique Vectors of $k$-Connected Chordal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Afshin Goodarzi","submitted_at":"2014-03-25T02:31:23Z","abstract_excerpt":"The clique vector $\\mathfrak{c}(G)$ of a graph $G$ is the sequence $(c_1, c_2, \\ldots,c_d)$ in $\\mathbb{N}^d$, where $c_i$ is the number of cliques in $G$ with $i$ vertices and $d$ is the largest cardinality of a clique in $G$. In this note, we use tools from commutative algebra to characterize all possible clique vectors of $k$-connected chordal graphs."},"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":"1403.6210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-25T02:31:23Z","cross_cats_sorted":[],"title_canon_sha256":"cc05917e7593e3c665401c2f9d9a60e244103e063b5ba6d029fc90997c7ecde0","abstract_canon_sha256":"65f589729311d9ab72d34c27d1a5846b1a47cfded0c25bb347405f26394f6f7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:32.118083Z","signature_b64":"y119TP1bULJK816u+zSFVc+U8LkmgcIDtg7vlYyzDPbHo/rBGpspunVf1alaw2myIU1BjyvSpS+sP/PVlUzHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e346245645ae7920313e1947514c3c5c0174afc7c667fa5d3a3f3eba6e5a6c8e","last_reissued_at":"2026-05-18T02:30:32.117501Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:32.117501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clique Vectors of $k$-Connected Chordal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Afshin Goodarzi","submitted_at":"2014-03-25T02:31:23Z","abstract_excerpt":"The clique vector $\\mathfrak{c}(G)$ of a graph $G$ is the sequence $(c_1, c_2, \\ldots,c_d)$ in $\\mathbb{N}^d$, where $c_i$ is the number of cliques in $G$ with $i$ vertices and $d$ is the largest cardinality of a clique in $G$. In this note, we use tools from commutative algebra to characterize all possible clique vectors of $k$-connected chordal graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6210","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":""},"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":"1403.6210","created_at":"2026-05-18T02:30:32.117590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.6210v2","created_at":"2026-05-18T02:30:32.117590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6210","created_at":"2026-05-18T02:30:32.117590+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NDCIVSFVZ4S","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NDCIVSFVZ4SAMJ6","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NDCIVSF","created_at":"2026-05-18T12:28:14.216126+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/4NDCIVSFVZ4SAMJ6DFDVCTB4LQ","json":"https://pith.science/pith/4NDCIVSFVZ4SAMJ6DFDVCTB4LQ.json","graph_json":"https://pith.science/api/pith-number/4NDCIVSFVZ4SAMJ6DFDVCTB4LQ/graph.json","events_json":"https://pith.science/api/pith-number/4NDCIVSFVZ4SAMJ6DFDVCTB4LQ/events.json","paper":"https://pith.science/paper/4NDCIVSF"},"agent_actions":{"view_html":"https://pith.science/pith/4NDCIVSFVZ4SAMJ6DFDVCTB4LQ","download_json":"https://pith.science/pith/4NDCIVSFVZ4SAMJ6DFDVCTB4LQ.json","view_paper":"https://pith.science/paper/4NDCIVSF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.6210&json=true","fetch_graph":"https://pith.science/api/pith-number/4NDCIVSFVZ4SAMJ6DFDVCTB4LQ/graph.json","fetch_events":"https://pith.science/api/pith-number/4NDCIVSFVZ4SAMJ6DFDVCTB4LQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NDCIVSFVZ4SAMJ6DFDVCTB4LQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NDCIVSFVZ4SAMJ6DFDVCTB4LQ/action/storage_attestation","attest_author":"https://pith.science/pith/4NDCIVSFVZ4SAMJ6DFDVCTB4LQ/action/author_attestation","sign_citation":"https://pith.science/pith/4NDCIVSFVZ4SAMJ6DFDVCTB4LQ/action/citation_signature","submit_replication":"https://pith.science/pith/4NDCIVSFVZ4SAMJ6DFDVCTB4LQ/action/replication_record"}},"created_at":"2026-05-18T02:30:32.117590+00:00","updated_at":"2026-05-18T02:30:32.117590+00:00"}