{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PMGQKWDFPYVVSEIHJVLK22QMWI","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":"0b347f528366058191708b9429fdbd62d5ba9cb72bddbfa65260d91790dd7534","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-26T15:28:22Z","title_canon_sha256":"c31b10d47ef8c4a75abb7117160542bc139e0065a0ed2f30d25ba2c5feebfeab"},"schema_version":"1.0","source":{"id":"2605.27173","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.27173","created_at":"2026-05-27T02:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"2605.27173v1","created_at":"2026-05-27T02:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27173","created_at":"2026-05-27T02:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"PMGQKWDFPYVV","created_at":"2026-05-27T02:05:46Z"},{"alias_kind":"pith_short_16","alias_value":"PMGQKWDFPYVVSEIH","created_at":"2026-05-27T02:05:46Z"},{"alias_kind":"pith_short_8","alias_value":"PMGQKWDF","created_at":"2026-05-27T02:05:46Z"}],"graph_snapshots":[{"event_id":"sha256:1c52a11509d0391c74487896909776504e9b933f02a5b1eb13cdd20989da5070","target":"graph","created_at":"2026-05-27T02:05:46Z","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/2605.27173/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $G$ is called $k$-factor-critical if after deleting any $k$ vertices the remaining subgraph still has a perfect matching. Fan and Lin [Adv. in Appl. Math. 174 (2026) 103019] posed an adjacency spectral condition for a graph with minimum degree to be $k$-factor-critical. A graph $G$ is fractional $k$-factor-critical if after deleting any $k$ vertices the remaining subgraph still has a fractional perfect matching. Clearly, the fractional $k$-factor-criticality of a graph is a necessary property for a graph to be $k$-factor-critical. Jia, Fan and Liu [Discrete Appl. Math. 386 (2026) 255-2","authors_text":"Jiaxu Zhong, Yong Lu","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-26T15:28:22Z","title":"Sufficient conditions for fractional $k$-factor-critical graphs with minimum degree to be $k$-factor-critical"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27173","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:df929eeaafc2290c19d2c66f150ecc84fbcac8e6872cb745e1ebece510cbd060","target":"record","created_at":"2026-05-27T02:05:46Z","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":"0b347f528366058191708b9429fdbd62d5ba9cb72bddbfa65260d91790dd7534","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-26T15:28:22Z","title_canon_sha256":"c31b10d47ef8c4a75abb7117160542bc139e0065a0ed2f30d25ba2c5feebfeab"},"schema_version":"1.0","source":{"id":"2605.27173","kind":"arxiv","version":1}},"canonical_sha256":"7b0d0558657e2b5911074d56ad6a0cb209855b35c01d50fe108cbf071ec9b281","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b0d0558657e2b5911074d56ad6a0cb209855b35c01d50fe108cbf071ec9b281","first_computed_at":"2026-05-27T02:05:46.344114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T02:05:46.344114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"adRmlEw5f9Zm5lOlgoIx7V6oq9lFzbfurrtu4LXWR2lQd7PqZ16NQskKckhtbo5u3qpTgZ6oJBrOLxYkC1DbBQ==","signature_status":"signed_v1","signed_at":"2026-05-27T02:05:46.344939Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.27173","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df929eeaafc2290c19d2c66f150ecc84fbcac8e6872cb745e1ebece510cbd060","sha256:1c52a11509d0391c74487896909776504e9b933f02a5b1eb13cdd20989da5070"],"state_sha256":"3a63fe0a86d1b09cdf806252b2f4a713d1ae63f51f3518988d4ffe6c2b703726"}