{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FVU34OB2QZBX6YBKADET5GI7BF","short_pith_number":"pith:FVU34OB2","canonical_record":{"source":{"id":"1606.04608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-15T01:23:52Z","cross_cats_sorted":[],"title_canon_sha256":"37be039ae9c20ff3d6ed19ab7066708afabea3eadf591866365630822119c97b","abstract_canon_sha256":"19ff7531704c4805186c377b5d9b095afaa74c7b2b14be99505bb7c2bfd16e9a"},"schema_version":"1.0"},"canonical_sha256":"2d69be383a86437f602a00c93e991f0944052a27ea0df876f1948805effaa2d2","source":{"kind":"arxiv","id":"1606.04608","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04608","created_at":"2026-05-18T01:12:24Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04608v1","created_at":"2026-05-18T01:12:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04608","created_at":"2026-05-18T01:12:24Z"},{"alias_kind":"pith_short_12","alias_value":"FVU34OB2QZBX","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVU34OB2QZBX6YBK","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVU34OB2","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FVU34OB2QZBX6YBKADET5GI7BF","target":"record","payload":{"canonical_record":{"source":{"id":"1606.04608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-15T01:23:52Z","cross_cats_sorted":[],"title_canon_sha256":"37be039ae9c20ff3d6ed19ab7066708afabea3eadf591866365630822119c97b","abstract_canon_sha256":"19ff7531704c4805186c377b5d9b095afaa74c7b2b14be99505bb7c2bfd16e9a"},"schema_version":"1.0"},"canonical_sha256":"2d69be383a86437f602a00c93e991f0944052a27ea0df876f1948805effaa2d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:24.703220Z","signature_b64":"s5I0A2wvEKehfr1lZuHFzRjXIUPRe7MEojlH/d/nOFkU/n04ohKOLts5wVOaDQQPvWKq9SW9AjpU8/Pix1ERBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d69be383a86437f602a00c93e991f0944052a27ea0df876f1948805effaa2d2","last_reissued_at":"2026-05-18T01:12:24.702895Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:24.702895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.04608","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JznYf+M1NSr7iBNc743z0M0uzn/qD9ujHcPCE9aFjxJAl/M8tOLjk8GD3Y/nLt1qMRdCEYmhIx+GzFpMzFh8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:14:25.366826Z"},"content_sha256":"8c0f56679d3662d5b5c66d60b2c7623c9fe54e431b80a84589ef74e53856ce90","schema_version":"1.0","event_id":"sha256:8c0f56679d3662d5b5c66d60b2c7623c9fe54e431b80a84589ef74e53856ce90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FVU34OB2QZBX6YBKADET5GI7BF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Degree Condition for a Graph to have $(a,b)$-Parity Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haodong Liu, Hongliang Lu","submitted_at":"2016-06-15T01:23:52Z","abstract_excerpt":"Let $a,b,n$ be three positive integers such that $a\\equiv b\\pmod 2$ and $n\\geq b(a+b)(a+b+2)/(2a)$. Let $G$ be a graph of order $n$ with minimum degree at least $a+b/a-1$. We show that $G$ has an $(a,b)$-parity factor, if $max\\{d_G(u),d_G(v)\\}\\geq \\frac{an}{a+b}$ for any two nonadjacent vertices $u,v$ of $G$. It is an extension of Nishimura's results for the existence of $k$-factors (\\emph{J. Graph Theory}, \\textbf{16} (1992), 141--151) and generalizes Li and Cai's result in some senses (\\emph{J. Graph Theory}, \\textbf{27} (1998), 1--6). These conditions are tight."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04608","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t1yvlV2IhXSS7WttbuaDXteFZZFYiFiplAW/XGGejD+ZGu16RPCqsvrmV+xlUa6x5xPdIrxmyhkH0csuAOxuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:14:25.367456Z"},"content_sha256":"4ef7617ac241535d1945ac48280dde442ce6cd9b6fd83d7529a3ae5768d0d5d8","schema_version":"1.0","event_id":"sha256:4ef7617ac241535d1945ac48280dde442ce6cd9b6fd83d7529a3ae5768d0d5d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVU34OB2QZBX6YBKADET5GI7BF/bundle.json","state_url":"https://pith.science/pith/FVU34OB2QZBX6YBKADET5GI7BF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVU34OB2QZBX6YBKADET5GI7BF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T01:14:25Z","links":{"resolver":"https://pith.science/pith/FVU34OB2QZBX6YBKADET5GI7BF","bundle":"https://pith.science/pith/FVU34OB2QZBX6YBKADET5GI7BF/bundle.json","state":"https://pith.science/pith/FVU34OB2QZBX6YBKADET5GI7BF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVU34OB2QZBX6YBKADET5GI7BF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FVU34OB2QZBX6YBKADET5GI7BF","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":"19ff7531704c4805186c377b5d9b095afaa74c7b2b14be99505bb7c2bfd16e9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-15T01:23:52Z","title_canon_sha256":"37be039ae9c20ff3d6ed19ab7066708afabea3eadf591866365630822119c97b"},"schema_version":"1.0","source":{"id":"1606.04608","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04608","created_at":"2026-05-18T01:12:24Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04608v1","created_at":"2026-05-18T01:12:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04608","created_at":"2026-05-18T01:12:24Z"},{"alias_kind":"pith_short_12","alias_value":"FVU34OB2QZBX","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVU34OB2QZBX6YBK","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVU34OB2","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:4ef7617ac241535d1945ac48280dde442ce6cd9b6fd83d7529a3ae5768d0d5d8","target":"graph","created_at":"2026-05-18T01:12: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":"Let $a,b,n$ be three positive integers such that $a\\equiv b\\pmod 2$ and $n\\geq b(a+b)(a+b+2)/(2a)$. Let $G$ be a graph of order $n$ with minimum degree at least $a+b/a-1$. We show that $G$ has an $(a,b)$-parity factor, if $max\\{d_G(u),d_G(v)\\}\\geq \\frac{an}{a+b}$ for any two nonadjacent vertices $u,v$ of $G$. It is an extension of Nishimura's results for the existence of $k$-factors (\\emph{J. Graph Theory}, \\textbf{16} (1992), 141--151) and generalizes Li and Cai's result in some senses (\\emph{J. Graph Theory}, \\textbf{27} (1998), 1--6). These conditions are tight.","authors_text":"Haodong Liu, Hongliang Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-15T01:23:52Z","title":"A Degree Condition for a Graph to have $(a,b)$-Parity Factors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04608","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:8c0f56679d3662d5b5c66d60b2c7623c9fe54e431b80a84589ef74e53856ce90","target":"record","created_at":"2026-05-18T01:12: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":"19ff7531704c4805186c377b5d9b095afaa74c7b2b14be99505bb7c2bfd16e9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-15T01:23:52Z","title_canon_sha256":"37be039ae9c20ff3d6ed19ab7066708afabea3eadf591866365630822119c97b"},"schema_version":"1.0","source":{"id":"1606.04608","kind":"arxiv","version":1}},"canonical_sha256":"2d69be383a86437f602a00c93e991f0944052a27ea0df876f1948805effaa2d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d69be383a86437f602a00c93e991f0944052a27ea0df876f1948805effaa2d2","first_computed_at":"2026-05-18T01:12:24.702895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:24.702895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s5I0A2wvEKehfr1lZuHFzRjXIUPRe7MEojlH/d/nOFkU/n04ohKOLts5wVOaDQQPvWKq9SW9AjpU8/Pix1ERBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:24.703220Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.04608","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c0f56679d3662d5b5c66d60b2c7623c9fe54e431b80a84589ef74e53856ce90","sha256:4ef7617ac241535d1945ac48280dde442ce6cd9b6fd83d7529a3ae5768d0d5d8"],"state_sha256":"1470d33bf9d97c594bb61a802c07ac3222296190960c0e5d9bd6b07f49edd45e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4eDI72JYqt1Id85D4HmihtO1HHGNe7CcMx2K4CHc0jqA0uFVaUP78njTvoQu8sNRxk16cwowrVwL5ipyF9lYBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:14:25.370250Z","bundle_sha256":"3563bb62b8ff230bd52725543d5064d3b2ab38078c439f4f9b3b5640ffd9e748"}}