{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DM5X4GKWC7Q4CJ744CJR5OP3EC","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":"073eeda251d04a4fb513f923222a78a4fdb83255951b188972d1cb07ae136e03","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-30T12:00:32Z","title_canon_sha256":"5227813711313908a4dac33eb6d5c6fa3fc5925c0b1b8dc1d07c79d20db70f00"},"schema_version":"1.0","source":{"id":"2606.00691","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00691","created_at":"2026-06-02T01:04:02Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00691v1","created_at":"2026-06-02T01:04:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00691","created_at":"2026-06-02T01:04:02Z"},{"alias_kind":"pith_short_12","alias_value":"DM5X4GKWC7Q4","created_at":"2026-06-02T01:04:02Z"},{"alias_kind":"pith_short_16","alias_value":"DM5X4GKWC7Q4CJ74","created_at":"2026-06-02T01:04:02Z"},{"alias_kind":"pith_short_8","alias_value":"DM5X4GKW","created_at":"2026-06-02T01:04:02Z"}],"graph_snapshots":[{"event_id":"sha256:190b4c695eb49bb8651b5706bc983d6cfb4b2f28dfe3c96f4f69c50e09ed75d7","target":"graph","created_at":"2026-06-02T01:04:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.00691/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We solve, for all sufficiently large even orders, the problem proposed by Chen et al. on sharp $A_\\alpha$-spectral conditions for the existence of odd $[1,b]$-factors when $\\alpha>1/2$. Chen et al. showed that every connected graph of even order $n$ with no odd $[1,b]$-factor has $A_\\alpha$-spectral radius at most $\\max_{1\\le s\\le k}\\rho_\\alpha(G_s)$, where $G_s=K_s\\nabla\\left(K_{n-(b+1)s-1}\\cup(bs+1)K_1\\right)$ and $k=\\lfloor(n-2)/(b+1)\\rfloor$. Thus the problem reduces to finding the graph with the largest $A_\\alpha$-spectral radius among these obstruction graphs. We prove that, for every $\\","authors_text":"Silin Huang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-30T12:00:32Z","title":"Sharp $A_\\alpha$-Spectral Conditions for Odd $[1,b]$-Factors When $\\alpha>1/2$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00691","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:77ee271835d7e0614c4b26551a7373fbd26820635c3af4eb4a1c75a3c3038bcb","target":"record","created_at":"2026-06-02T01:04:02Z","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":"073eeda251d04a4fb513f923222a78a4fdb83255951b188972d1cb07ae136e03","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-30T12:00:32Z","title_canon_sha256":"5227813711313908a4dac33eb6d5c6fa3fc5925c0b1b8dc1d07c79d20db70f00"},"schema_version":"1.0","source":{"id":"2606.00691","kind":"arxiv","version":1}},"canonical_sha256":"1b3b7e195617e1c127fce0931eb9fb208ccd1da95662b74e6bcd0a224b10021c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b3b7e195617e1c127fce0931eb9fb208ccd1da95662b74e6bcd0a224b10021c","first_computed_at":"2026-06-02T01:04:02.820846Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:04:02.820846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ES+mJNOSrjLyuALyF3kGvX85zKd+CutlscXJ8WLumoDON/6fUNoXBzTvReClRAwg+PfmGiVPw7s5JjKXHhbVBA==","signature_status":"signed_v1","signed_at":"2026-06-02T01:04:02.821298Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.00691","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77ee271835d7e0614c4b26551a7373fbd26820635c3af4eb4a1c75a3c3038bcb","sha256:190b4c695eb49bb8651b5706bc983d6cfb4b2f28dfe3c96f4f69c50e09ed75d7"],"state_sha256":"e87a118692855c5bcdfe44f00688e0ef7478ef36adf736254ca464c1ebde8c03"}