{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WRUDICU3WFMSR6I5L65U2JRTDD","short_pith_number":"pith:WRUDICU3","schema_version":"1.0","canonical_sha256":"b468340a9bb15928f91d5fbb4d263318e8fcf6ca7beb624e441a708856a844ff","source":{"kind":"arxiv","id":"1305.4317","version":1},"attestation_state":"computed","paper":{"title":"The least eigenvalue of graphs whose complements are unicyclic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fei-Fei Zhang, Xiao-Xin Li, Yi Wang, Yi-Zheng Fan","submitted_at":"2013-05-19T01:50:42Z","abstract_excerpt":"A graph in a certain graph class is called minimizing if the least eigenvalue of the adjacency matrix of the graph attains the minimum among all graphs in that class. Bell {\\it et al.} have characterized the minimizing graphs in the class of connected graphs of order $n$ and size $m$, whose complements are either disconnected or contain a clique of order at least $n/2$. In this paper we discuss the minimizing graphs of a special class of graphs of order $n$ whose complements are connected and contains exactly one cycle (namely the the class $\\mathscr {U}^{c}_{n}$ of graphs whose complements ar"},"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":"1305.4317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-19T01:50:42Z","cross_cats_sorted":[],"title_canon_sha256":"dcf7bcac5f73dbed92a92f32009be1718143fade7fe0ea7ff961bd5ee2ea7cc8","abstract_canon_sha256":"5b09bcd709626a7a2791a3e3d68ab4699a12e5909bb4c5e6a400fb7814919580"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:24.105447Z","signature_b64":"c1VPfP8N6VOUVoaJbt1NL1oR92sLpVXsI59rfNGngLCHaGFl2Du7OAR2EYEZb3/oUdz3It6Ks6eLyY3V6p+CAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b468340a9bb15928f91d5fbb4d263318e8fcf6ca7beb624e441a708856a844ff","last_reissued_at":"2026-05-18T03:25:24.104822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:24.104822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The least eigenvalue of graphs whose complements are unicyclic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fei-Fei Zhang, Xiao-Xin Li, Yi Wang, Yi-Zheng Fan","submitted_at":"2013-05-19T01:50:42Z","abstract_excerpt":"A graph in a certain graph class is called minimizing if the least eigenvalue of the adjacency matrix of the graph attains the minimum among all graphs in that class. Bell {\\it et al.} have characterized the minimizing graphs in the class of connected graphs of order $n$ and size $m$, whose complements are either disconnected or contain a clique of order at least $n/2$. In this paper we discuss the minimizing graphs of a special class of graphs of order $n$ whose complements are connected and contains exactly one cycle (namely the the class $\\mathscr {U}^{c}_{n}$ of graphs whose complements ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4317","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":"1305.4317","created_at":"2026-05-18T03:25:24.104926+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.4317v1","created_at":"2026-05-18T03:25:24.104926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4317","created_at":"2026-05-18T03:25:24.104926+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRUDICU3WFMS","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRUDICU3WFMSR6I5","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRUDICU3","created_at":"2026-05-18T12:28:04.890932+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/WRUDICU3WFMSR6I5L65U2JRTDD","json":"https://pith.science/pith/WRUDICU3WFMSR6I5L65U2JRTDD.json","graph_json":"https://pith.science/api/pith-number/WRUDICU3WFMSR6I5L65U2JRTDD/graph.json","events_json":"https://pith.science/api/pith-number/WRUDICU3WFMSR6I5L65U2JRTDD/events.json","paper":"https://pith.science/paper/WRUDICU3"},"agent_actions":{"view_html":"https://pith.science/pith/WRUDICU3WFMSR6I5L65U2JRTDD","download_json":"https://pith.science/pith/WRUDICU3WFMSR6I5L65U2JRTDD.json","view_paper":"https://pith.science/paper/WRUDICU3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.4317&json=true","fetch_graph":"https://pith.science/api/pith-number/WRUDICU3WFMSR6I5L65U2JRTDD/graph.json","fetch_events":"https://pith.science/api/pith-number/WRUDICU3WFMSR6I5L65U2JRTDD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRUDICU3WFMSR6I5L65U2JRTDD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRUDICU3WFMSR6I5L65U2JRTDD/action/storage_attestation","attest_author":"https://pith.science/pith/WRUDICU3WFMSR6I5L65U2JRTDD/action/author_attestation","sign_citation":"https://pith.science/pith/WRUDICU3WFMSR6I5L65U2JRTDD/action/citation_signature","submit_replication":"https://pith.science/pith/WRUDICU3WFMSR6I5L65U2JRTDD/action/replication_record"}},"created_at":"2026-05-18T03:25:24.104926+00:00","updated_at":"2026-05-18T03:25:24.104926+00:00"}