{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Q6L7X2FFEM27KL3QFZWQFQJUCC","short_pith_number":"pith:Q6L7X2FF","schema_version":"1.0","canonical_sha256":"8797fbe8a52335f52f702e6d02c1341082c12ec3825dd5cd0550b60c93159b2f","source":{"kind":"arxiv","id":"1507.01613","version":1},"attestation_state":"computed","paper":{"title":"A note on the clique number of complete $k$-partite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Boris Brimkov","submitted_at":"2015-07-06T20:13:00Z","abstract_excerpt":"In this note, we show that a complete $k$-partite graph is the only graph with clique number $k$ among all degree-equivalent simple graphs. This result gives a lower bound on the clique number, which is sharper than existing bounds on a large family of 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":"1507.01613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-06T20:13:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4861f7b8d0c25928ff479ec2750dc4125ec44fbd2af73fa096c5883572ead677","abstract_canon_sha256":"3bbdab7efa04a43a3c716f6e090f4e51df136695f87ad2e51048b8ef705d5e49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:12.896450Z","signature_b64":"6suEvTX0qokJ0TNIl5KVCON/YBiFiye4tzm/mWwK8wjsBVaX2BTiWtveYUuyAJT1eRYpdHH6emjvEGoHKelQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8797fbe8a52335f52f702e6d02c1341082c12ec3825dd5cd0550b60c93159b2f","last_reissued_at":"2026-05-18T01:37:12.895803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:12.895803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on the clique number of complete $k$-partite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Boris Brimkov","submitted_at":"2015-07-06T20:13:00Z","abstract_excerpt":"In this note, we show that a complete $k$-partite graph is the only graph with clique number $k$ among all degree-equivalent simple graphs. This result gives a lower bound on the clique number, which is sharper than existing bounds on a large family of graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01613","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":"1507.01613","created_at":"2026-05-18T01:37:12.895904+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01613v1","created_at":"2026-05-18T01:37:12.895904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01613","created_at":"2026-05-18T01:37:12.895904+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q6L7X2FFEM27","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q6L7X2FFEM27KL3Q","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q6L7X2FF","created_at":"2026-05-18T12:29:37.295048+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/Q6L7X2FFEM27KL3QFZWQFQJUCC","json":"https://pith.science/pith/Q6L7X2FFEM27KL3QFZWQFQJUCC.json","graph_json":"https://pith.science/api/pith-number/Q6L7X2FFEM27KL3QFZWQFQJUCC/graph.json","events_json":"https://pith.science/api/pith-number/Q6L7X2FFEM27KL3QFZWQFQJUCC/events.json","paper":"https://pith.science/paper/Q6L7X2FF"},"agent_actions":{"view_html":"https://pith.science/pith/Q6L7X2FFEM27KL3QFZWQFQJUCC","download_json":"https://pith.science/pith/Q6L7X2FFEM27KL3QFZWQFQJUCC.json","view_paper":"https://pith.science/paper/Q6L7X2FF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01613&json=true","fetch_graph":"https://pith.science/api/pith-number/Q6L7X2FFEM27KL3QFZWQFQJUCC/graph.json","fetch_events":"https://pith.science/api/pith-number/Q6L7X2FFEM27KL3QFZWQFQJUCC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q6L7X2FFEM27KL3QFZWQFQJUCC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q6L7X2FFEM27KL3QFZWQFQJUCC/action/storage_attestation","attest_author":"https://pith.science/pith/Q6L7X2FFEM27KL3QFZWQFQJUCC/action/author_attestation","sign_citation":"https://pith.science/pith/Q6L7X2FFEM27KL3QFZWQFQJUCC/action/citation_signature","submit_replication":"https://pith.science/pith/Q6L7X2FFEM27KL3QFZWQFQJUCC/action/replication_record"}},"created_at":"2026-05-18T01:37:12.895904+00:00","updated_at":"2026-05-18T01:37:12.895904+00:00"}