{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PMGQKWDFPYVVSEIHJVLK22QMWI","short_pith_number":"pith:PMGQKWDF","schema_version":"1.0","canonical_sha256":"7b0d0558657e2b5911074d56ad6a0cb209855b35c01d50fe108cbf071ec9b281","source":{"kind":"arxiv","id":"2605.27173","version":1},"attestation_state":"computed","paper":{"title":"Sufficient conditions for fractional $k$-factor-critical graphs with minimum degree to be $k$-factor-critical","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiaxu Zhong, Yong Lu","submitted_at":"2026-05-26T15:28:22Z","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"},"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":"2605.27173","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-26T15:28:22Z","cross_cats_sorted":[],"title_canon_sha256":"c31b10d47ef8c4a75abb7117160542bc139e0065a0ed2f30d25ba2c5feebfeab","abstract_canon_sha256":"0b347f528366058191708b9429fdbd62d5ba9cb72bddbfa65260d91790dd7534"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T02:05:46.344939Z","signature_b64":"adRmlEw5f9Zm5lOlgoIx7V6oq9lFzbfurrtu4LXWR2lQd7PqZ16NQskKckhtbo5u3qpTgZ6oJBrOLxYkC1DbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b0d0558657e2b5911074d56ad6a0cb209855b35c01d50fe108cbf071ec9b281","last_reissued_at":"2026-05-27T02:05:46.344114Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T02:05:46.344114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sufficient conditions for fractional $k$-factor-critical graphs with minimum degree to be $k$-factor-critical","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiaxu Zhong, Yong Lu","submitted_at":"2026-05-26T15:28:22Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27173","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.27173/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.27173","created_at":"2026-05-27T02:05:46.344248+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.27173v1","created_at":"2026-05-27T02:05:46.344248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27173","created_at":"2026-05-27T02:05:46.344248+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMGQKWDFPYVV","created_at":"2026-05-27T02:05:46.344248+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMGQKWDFPYVVSEIH","created_at":"2026-05-27T02:05:46.344248+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMGQKWDF","created_at":"2026-05-27T02:05:46.344248+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/PMGQKWDFPYVVSEIHJVLK22QMWI","json":"https://pith.science/pith/PMGQKWDFPYVVSEIHJVLK22QMWI.json","graph_json":"https://pith.science/api/pith-number/PMGQKWDFPYVVSEIHJVLK22QMWI/graph.json","events_json":"https://pith.science/api/pith-number/PMGQKWDFPYVVSEIHJVLK22QMWI/events.json","paper":"https://pith.science/paper/PMGQKWDF"},"agent_actions":{"view_html":"https://pith.science/pith/PMGQKWDFPYVVSEIHJVLK22QMWI","download_json":"https://pith.science/pith/PMGQKWDFPYVVSEIHJVLK22QMWI.json","view_paper":"https://pith.science/paper/PMGQKWDF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.27173&json=true","fetch_graph":"https://pith.science/api/pith-number/PMGQKWDFPYVVSEIHJVLK22QMWI/graph.json","fetch_events":"https://pith.science/api/pith-number/PMGQKWDFPYVVSEIHJVLK22QMWI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMGQKWDFPYVVSEIHJVLK22QMWI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMGQKWDFPYVVSEIHJVLK22QMWI/action/storage_attestation","attest_author":"https://pith.science/pith/PMGQKWDFPYVVSEIHJVLK22QMWI/action/author_attestation","sign_citation":"https://pith.science/pith/PMGQKWDFPYVVSEIHJVLK22QMWI/action/citation_signature","submit_replication":"https://pith.science/pith/PMGQKWDFPYVVSEIHJVLK22QMWI/action/replication_record"}},"created_at":"2026-05-27T02:05:46.344248+00:00","updated_at":"2026-05-27T02:05:46.344248+00:00"}