{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WRUDICU3WFMSR6I5L65U2JRTDD","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":"5b09bcd709626a7a2791a3e3d68ab4699a12e5909bb4c5e6a400fb7814919580","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-19T01:50:42Z","title_canon_sha256":"dcf7bcac5f73dbed92a92f32009be1718143fade7fe0ea7ff961bd5ee2ea7cc8"},"schema_version":"1.0","source":{"id":"1305.4317","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4317","created_at":"2026-05-18T03:25:24Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4317v1","created_at":"2026-05-18T03:25:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4317","created_at":"2026-05-18T03:25:24Z"},{"alias_kind":"pith_short_12","alias_value":"WRUDICU3WFMS","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WRUDICU3WFMSR6I5","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WRUDICU3","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:eb0cccd7bd1fb9b72b664bcb7f4802dbedecc8fd1bf64224e17b587ea0ce47b2","target":"graph","created_at":"2026-05-18T03:25:24Z","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":"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","authors_text":"Fei-Fei Zhang, Xiao-Xin Li, Yi Wang, Yi-Zheng Fan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-19T01:50:42Z","title":"The least eigenvalue of graphs whose complements are unicyclic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4317","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:bf8eacd4bda6a38512cd147d1c9c67144bf60458496ae39b61168c3a9d18698c","target":"record","created_at":"2026-05-18T03:25:24Z","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":"5b09bcd709626a7a2791a3e3d68ab4699a12e5909bb4c5e6a400fb7814919580","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-19T01:50:42Z","title_canon_sha256":"dcf7bcac5f73dbed92a92f32009be1718143fade7fe0ea7ff961bd5ee2ea7cc8"},"schema_version":"1.0","source":{"id":"1305.4317","kind":"arxiv","version":1}},"canonical_sha256":"b468340a9bb15928f91d5fbb4d263318e8fcf6ca7beb624e441a708856a844ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b468340a9bb15928f91d5fbb4d263318e8fcf6ca7beb624e441a708856a844ff","first_computed_at":"2026-05-18T03:25:24.104822Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:24.104822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c1VPfP8N6VOUVoaJbt1NL1oR92sLpVXsI59rfNGngLCHaGFl2Du7OAR2EYEZb3/oUdz3It6Ks6eLyY3V6p+CAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:24.105447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4317","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf8eacd4bda6a38512cd147d1c9c67144bf60458496ae39b61168c3a9d18698c","sha256:eb0cccd7bd1fb9b72b664bcb7f4802dbedecc8fd1bf64224e17b587ea0ce47b2"],"state_sha256":"0eb00f92ce5b3510755616b94ef335a2c35df618fc740ad2296da97d3d390117"}