{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EPIWV4QM6DPUJY5EKH2NHZICKP","short_pith_number":"pith:EPIWV4QM","schema_version":"1.0","canonical_sha256":"23d16af20cf0df44e3a451f4d3e50253c9e91880785d47cdb325b070f90ed42d","source":{"kind":"arxiv","id":"2111.02734","version":1},"attestation_state":"computed","paper":{"title":"Spectral radius and clique partitions of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Edwin R. van Dam, Jiang Zhou","submitted_at":"2021-11-04T10:38:56Z","abstract_excerpt":"We give lower bounds on the size and total size of clique partitions of a graph in terms of its spectral radius and minimum degree, and derive a spectral upper bound for the maximum number of edge-disjoint $t$-cliques. The extremal graphs attaining the bounds are exactly the block graphs of Steiner $2$-designs and the regular graphs with $K_t$-decompositions, respectively."},"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":"2111.02734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-11-04T10:38:56Z","cross_cats_sorted":[],"title_canon_sha256":"96d90879b9b2fa1eb196e1bc700f81b1b51648c17447567144b2dd25ba0e3c11","abstract_canon_sha256":"ac38839c7e74bb788ad301f69322ab13a687ef56389eb49d53c911413e48f626"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:29:08.026548Z","signature_b64":"3fyt4X5CNXBQbxdBMghO8RAlGh1wcQrDltqyYKtmSMdjt/l55ZlmjT+NAQZ3sG3JvvMFa9gLMxUs2A0P/NM2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23d16af20cf0df44e3a451f4d3e50253c9e91880785d47cdb325b070f90ed42d","last_reissued_at":"2026-07-05T03:29:08.025086Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:29:08.025086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral radius and clique partitions of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Edwin R. van Dam, Jiang Zhou","submitted_at":"2021-11-04T10:38:56Z","abstract_excerpt":"We give lower bounds on the size and total size of clique partitions of a graph in terms of its spectral radius and minimum degree, and derive a spectral upper bound for the maximum number of edge-disjoint $t$-cliques. The extremal graphs attaining the bounds are exactly the block graphs of Steiner $2$-designs and the regular graphs with $K_t$-decompositions, respectively."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.02734","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.02734/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":"2111.02734","created_at":"2026-07-05T03:29:08.025157+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.02734v1","created_at":"2026-07-05T03:29:08.025157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.02734","created_at":"2026-07-05T03:29:08.025157+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPIWV4QM6DPU","created_at":"2026-07-05T03:29:08.025157+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPIWV4QM6DPUJY5E","created_at":"2026-07-05T03:29:08.025157+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPIWV4QM","created_at":"2026-07-05T03:29:08.025157+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/EPIWV4QM6DPUJY5EKH2NHZICKP","json":"https://pith.science/pith/EPIWV4QM6DPUJY5EKH2NHZICKP.json","graph_json":"https://pith.science/api/pith-number/EPIWV4QM6DPUJY5EKH2NHZICKP/graph.json","events_json":"https://pith.science/api/pith-number/EPIWV4QM6DPUJY5EKH2NHZICKP/events.json","paper":"https://pith.science/paper/EPIWV4QM"},"agent_actions":{"view_html":"https://pith.science/pith/EPIWV4QM6DPUJY5EKH2NHZICKP","download_json":"https://pith.science/pith/EPIWV4QM6DPUJY5EKH2NHZICKP.json","view_paper":"https://pith.science/paper/EPIWV4QM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.02734&json=true","fetch_graph":"https://pith.science/api/pith-number/EPIWV4QM6DPUJY5EKH2NHZICKP/graph.json","fetch_events":"https://pith.science/api/pith-number/EPIWV4QM6DPUJY5EKH2NHZICKP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPIWV4QM6DPUJY5EKH2NHZICKP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPIWV4QM6DPUJY5EKH2NHZICKP/action/storage_attestation","attest_author":"https://pith.science/pith/EPIWV4QM6DPUJY5EKH2NHZICKP/action/author_attestation","sign_citation":"https://pith.science/pith/EPIWV4QM6DPUJY5EKH2NHZICKP/action/citation_signature","submit_replication":"https://pith.science/pith/EPIWV4QM6DPUJY5EKH2NHZICKP/action/replication_record"}},"created_at":"2026-07-05T03:29:08.025157+00:00","updated_at":"2026-07-05T03:29:08.025157+00:00"}