{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XHAMSIPUZBBBPOQPI6XLVBRMFC","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":"75fedd384d5943c929e533ec92d4b53a1a19aa2c5cafaf7ebe57fb788aa3797a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-07T17:50:03Z","title_canon_sha256":"da145c882962991ab91c12bf3db3669747add0e286c07dc4d9ac74ef82fb19b7"},"schema_version":"1.0","source":{"id":"1604.02088","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02088","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02088v2","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02088","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"pith_short_12","alias_value":"XHAMSIPUZBBB","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XHAMSIPUZBBBPOQP","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XHAMSIPU","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:8c06391444e7bcbfef9d545b83ea61ce0ea8553f8289c99ad0d76e97f017fb3d","target":"graph","created_at":"2026-05-18T01:17:16Z","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":"Let $G$ be a graph of order $n$ and size $m$, and let $\\mathrm{mc}_{k}\\left( G\\right) $ be the maximum size of a $k$-cut of $G.$ It is shown that \\[ \\mathrm{mc}_{k}\\left( G\\right) \\leq\\frac{k-1}{k}\\left( m-\\frac{\\mu_{\\min }\\left( G\\right) n}{2}\\right) , \\] where $\\mu_{\\min}\\left( G\\right) $ is the smallest eigenvalue of the adjacency matrix of $G.$\n  An infinite class of graphs forcing equality in this bound is constructed.","authors_text":"V. Nikiforov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-07T17:50:03Z","title":"Max k-cut and the smallest eigenvalue"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02088","kind":"arxiv","version":2},"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:6953fbef76381274100bd1881b8c4f6c7b8bbb806c03172a40f0ddadfa732056","target":"record","created_at":"2026-05-18T01:17:16Z","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":"75fedd384d5943c929e533ec92d4b53a1a19aa2c5cafaf7ebe57fb788aa3797a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-07T17:50:03Z","title_canon_sha256":"da145c882962991ab91c12bf3db3669747add0e286c07dc4d9ac74ef82fb19b7"},"schema_version":"1.0","source":{"id":"1604.02088","kind":"arxiv","version":2}},"canonical_sha256":"b9c0c921f4c84217ba0f47aeba862c28b596de6d8f47bc3614f932a48e42f035","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9c0c921f4c84217ba0f47aeba862c28b596de6d8f47bc3614f932a48e42f035","first_computed_at":"2026-05-18T01:17:16.552902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:16.552902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v37zban+8bl1em9h5fPkSJ9CHWB21uO5igAH4McqtwJmVSOS9b0+oHPlf2RVvzyuTSK+Y608uWUHfCM8KfVdCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:16.553654Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02088","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6953fbef76381274100bd1881b8c4f6c7b8bbb806c03172a40f0ddadfa732056","sha256:8c06391444e7bcbfef9d545b83ea61ce0ea8553f8289c99ad0d76e97f017fb3d"],"state_sha256":"4001058ce45a5c186822a4f6dcad07a3db3546262b0316a0b21b4b71126c15c3"}