{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PHTDVVGB4D527LSGMZDBHPFRUY","short_pith_number":"pith:PHTDVVGB","canonical_record":{"source":{"id":"1307.0168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-30T01:57:39Z","cross_cats_sorted":[],"title_canon_sha256":"6f84ea653050298aa7ca8a6f46c0a20b1b018552100060e280e4e8d4d7fa3e91","abstract_canon_sha256":"f7e9c082bd040e472a096f497c537de4f619a7b50db58c2ae6db1c054e536e4b"},"schema_version":"1.0"},"canonical_sha256":"79e63ad4c1e0fbafae46664613bcb1a627e479d156a62acbd52e47d93f2711bd","source":{"kind":"arxiv","id":"1307.0168","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0168","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0168v1","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0168","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"pith_short_12","alias_value":"PHTDVVGB4D52","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PHTDVVGB4D527LSG","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PHTDVVGB","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PHTDVVGB4D527LSGMZDBHPFRUY","target":"record","payload":{"canonical_record":{"source":{"id":"1307.0168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-30T01:57:39Z","cross_cats_sorted":[],"title_canon_sha256":"6f84ea653050298aa7ca8a6f46c0a20b1b018552100060e280e4e8d4d7fa3e91","abstract_canon_sha256":"f7e9c082bd040e472a096f497c537de4f619a7b50db58c2ae6db1c054e536e4b"},"schema_version":"1.0"},"canonical_sha256":"79e63ad4c1e0fbafae46664613bcb1a627e479d156a62acbd52e47d93f2711bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:34.115020Z","signature_b64":"Qjxyw4kl0AcIyWvO2wq166T5PssJ1v2s39xX4TRsykGwKF6Kz2zTN4MiWZIMx+B420cddpAWkdUcvn3YwDlHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79e63ad4c1e0fbafae46664613bcb1a627e479d156a62acbd52e47d93f2711bd","last_reissued_at":"2026-05-18T03:19:34.114450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:34.114450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.0168","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:19:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oGF6y++Y8sLq4vkO868t+UNMAI/wRBHj+cKBDjbDfbpkNQh3JdELzjjyassKWEomUI1WghKh13+dMdocF/F4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:44:46.003693Z"},"content_sha256":"a0379bb738fae50549855f1892ffa50a51f5c23f9d1123bdffcb270d5ed0eae7","schema_version":"1.0","event_id":"sha256:a0379bb738fae50549855f1892ffa50a51f5c23f9d1123bdffcb270d5ed0eae7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PHTDVVGB4D527LSGMZDBHPFRUY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Algebraic Connectivity and the Clique Number of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiao-Dong Zhang, Ya-Lei Jin","submitted_at":"2013-06-30T01:57:39Z","abstract_excerpt":"This paper investigates some relationship between the algebraic connectivity and the clique number of graphs. We characterize all extremal graphs which have the maximum and minimum the algebraic connectivity among all graphs of order $n$ with the clique number $r$, respectively. In turn, an upper and lower bounds for the clique number of a graph in terms of the algebraic connectivity are obtained. Moreover, a spectral version of the Erd\\H{o}s-Stone theorem in terms of the algebraic connectivity of graphs is presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0168","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:19:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UC40xSlEeyjVtwP2IZ7vVmu8idJ10POxPR7J1lQUz/ydY1xQuRiAtbbO5e0sLzMPM5pgst1UbgnKxBhogafNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:44:46.004449Z"},"content_sha256":"7f9c44fab3da07f74d2e7363f2606ba2b5ce70e7e55556b789d502a308711811","schema_version":"1.0","event_id":"sha256:7f9c44fab3da07f74d2e7363f2606ba2b5ce70e7e55556b789d502a308711811"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PHTDVVGB4D527LSGMZDBHPFRUY/bundle.json","state_url":"https://pith.science/pith/PHTDVVGB4D527LSGMZDBHPFRUY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PHTDVVGB4D527LSGMZDBHPFRUY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T01:44:46Z","links":{"resolver":"https://pith.science/pith/PHTDVVGB4D527LSGMZDBHPFRUY","bundle":"https://pith.science/pith/PHTDVVGB4D527LSGMZDBHPFRUY/bundle.json","state":"https://pith.science/pith/PHTDVVGB4D527LSGMZDBHPFRUY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PHTDVVGB4D527LSGMZDBHPFRUY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PHTDVVGB4D527LSGMZDBHPFRUY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f7e9c082bd040e472a096f497c537de4f619a7b50db58c2ae6db1c054e536e4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-30T01:57:39Z","title_canon_sha256":"6f84ea653050298aa7ca8a6f46c0a20b1b018552100060e280e4e8d4d7fa3e91"},"schema_version":"1.0","source":{"id":"1307.0168","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0168","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0168v1","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0168","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"pith_short_12","alias_value":"PHTDVVGB4D52","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PHTDVVGB4D527LSG","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PHTDVVGB","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:7f9c44fab3da07f74d2e7363f2606ba2b5ce70e7e55556b789d502a308711811","target":"graph","created_at":"2026-05-18T03:19:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This paper investigates some relationship between the algebraic connectivity and the clique number of graphs. We characterize all extremal graphs which have the maximum and minimum the algebraic connectivity among all graphs of order $n$ with the clique number $r$, respectively. In turn, an upper and lower bounds for the clique number of a graph in terms of the algebraic connectivity are obtained. Moreover, a spectral version of the Erd\\H{o}s-Stone theorem in terms of the algebraic connectivity of graphs is presented.","authors_text":"Xiao-Dong Zhang, Ya-Lei Jin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-30T01:57:39Z","title":"The Algebraic Connectivity and the Clique Number of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0168","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a0379bb738fae50549855f1892ffa50a51f5c23f9d1123bdffcb270d5ed0eae7","target":"record","created_at":"2026-05-18T03:19:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f7e9c082bd040e472a096f497c537de4f619a7b50db58c2ae6db1c054e536e4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-30T01:57:39Z","title_canon_sha256":"6f84ea653050298aa7ca8a6f46c0a20b1b018552100060e280e4e8d4d7fa3e91"},"schema_version":"1.0","source":{"id":"1307.0168","kind":"arxiv","version":1}},"canonical_sha256":"79e63ad4c1e0fbafae46664613bcb1a627e479d156a62acbd52e47d93f2711bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79e63ad4c1e0fbafae46664613bcb1a627e479d156a62acbd52e47d93f2711bd","first_computed_at":"2026-05-18T03:19:34.114450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:34.114450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qjxyw4kl0AcIyWvO2wq166T5PssJ1v2s39xX4TRsykGwKF6Kz2zTN4MiWZIMx+B420cddpAWkdUcvn3YwDlHAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:34.115020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.0168","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0379bb738fae50549855f1892ffa50a51f5c23f9d1123bdffcb270d5ed0eae7","sha256:7f9c44fab3da07f74d2e7363f2606ba2b5ce70e7e55556b789d502a308711811"],"state_sha256":"0366ab34a6df12c42643c1fa9e7597f0937498b1b84db7bb7aa4027ff316e35e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i17ODH81U6X2MfmkimnM0DAAVAD5vqzzB5jNwuz5sxINrGRnSiXDn6x80r62Ai1o1DDt75zL6W2+I5sc3EQgBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T01:44:46.008573Z","bundle_sha256":"ca0138da8d295bc81e169f423f313882ed8c9d8c82702a3c1c3fd96f9205c871"}}