{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IOZBBFLLA7XSTMACQ2CBCXTWE2","short_pith_number":"pith:IOZBBFLL","canonical_record":{"source":{"id":"1809.05260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-14T05:20:25Z","cross_cats_sorted":[],"title_canon_sha256":"39e1a6f18f5cd6433f0329b09dc60b18df5dcdb4ff3b7af173d1ee85fa9d12bf","abstract_canon_sha256":"c9251be7ab36a8c91c3b274ae8653b05402a53209427a7c66562e783d2639566"},"schema_version":"1.0"},"canonical_sha256":"43b210956b07ef29b0028684115e7626a122775cd84c86716f78859688f542aa","source":{"kind":"arxiv","id":"1809.05260","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05260","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05260v1","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05260","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"pith_short_12","alias_value":"IOZBBFLLA7XS","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IOZBBFLLA7XSTMAC","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IOZBBFLL","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IOZBBFLLA7XSTMACQ2CBCXTWE2","target":"record","payload":{"canonical_record":{"source":{"id":"1809.05260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-14T05:20:25Z","cross_cats_sorted":[],"title_canon_sha256":"39e1a6f18f5cd6433f0329b09dc60b18df5dcdb4ff3b7af173d1ee85fa9d12bf","abstract_canon_sha256":"c9251be7ab36a8c91c3b274ae8653b05402a53209427a7c66562e783d2639566"},"schema_version":"1.0"},"canonical_sha256":"43b210956b07ef29b0028684115e7626a122775cd84c86716f78859688f542aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:44.218267Z","signature_b64":"mprJzz8LFbtQGvbpo3N1ENAb2SZ4Sa2rMXzIrZ39MqJI5AYB+hCgvXA5u62LXEwv/9LoCkL45NLLBaq5C3OxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43b210956b07ef29b0028684115e7626a122775cd84c86716f78859688f542aa","last_reissued_at":"2026-05-18T00:05:44.217712Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:44.217712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.05260","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-18T00:05:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKvtL7nXlwQZdveMDzcEWsJRCGiu9GLxqMjBfIhgpiFhLfRuia3Mdpf9NeoODK96SLWCqO7TyzSUIWX1G132AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:29:57.258664Z"},"content_sha256":"0ef5484c1c6f160e79d11c98e0c1e631c3bf4135b48c0090c2b22714b3bca688","schema_version":"1.0","event_id":"sha256:0ef5484c1c6f160e79d11c98e0c1e631c3bf4135b48c0090c2b22714b3bca688"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IOZBBFLLA7XSTMACQ2CBCXTWE2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp conditions for the existence of an even $[a,b]$-factor in a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eun-Kyung Cho, Jeong Rye Park, Jong Yoon Hyun, Suil O","submitted_at":"2018-09-14T05:20:25Z","abstract_excerpt":"Let $a$ and $b$ be positive integers. An even $[a,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that for every vertex $v \\in V(G)$, $d_H(v)$ is even and $a \\le d_H(v) \\le b$. Matsuda conjectured that if $G$ is an $n$-vertex 2-edge-connected graph such that $n \\ge 2a+b+\\frac{a^2-3a}b - 2$, $\\delta(G) \\ge a$, and $\\sigma_2(G) \\ge \\frac{2an}{a+b}$, then $G$ has an even $[a,b]$-factor. In this paper, we provide counterexamples, which are highly connected. Furthermore, we give sharp sufficient conditions for a graph to have an even $[a,b]$-factor. For even $an$, we conjecture a lower bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05260","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-18T00:05:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O6k5kVH8DC18Q6omGxcMpfVwv6Ugt6lhuRCLWO27Myqi8t+erBkqFIQV1BrqFWLFtI7SPvhvHa7n3GCTUI0HBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:29:57.259237Z"},"content_sha256":"58fbc176d57ceed09922840c83824a25771b3f4adb319f7693b19ea9e5cc5202","schema_version":"1.0","event_id":"sha256:58fbc176d57ceed09922840c83824a25771b3f4adb319f7693b19ea9e5cc5202"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IOZBBFLLA7XSTMACQ2CBCXTWE2/bundle.json","state_url":"https://pith.science/pith/IOZBBFLLA7XSTMACQ2CBCXTWE2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IOZBBFLLA7XSTMACQ2CBCXTWE2/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-27T02:29:57Z","links":{"resolver":"https://pith.science/pith/IOZBBFLLA7XSTMACQ2CBCXTWE2","bundle":"https://pith.science/pith/IOZBBFLLA7XSTMACQ2CBCXTWE2/bundle.json","state":"https://pith.science/pith/IOZBBFLLA7XSTMACQ2CBCXTWE2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IOZBBFLLA7XSTMACQ2CBCXTWE2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IOZBBFLLA7XSTMACQ2CBCXTWE2","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":"c9251be7ab36a8c91c3b274ae8653b05402a53209427a7c66562e783d2639566","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-14T05:20:25Z","title_canon_sha256":"39e1a6f18f5cd6433f0329b09dc60b18df5dcdb4ff3b7af173d1ee85fa9d12bf"},"schema_version":"1.0","source":{"id":"1809.05260","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05260","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05260v1","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05260","created_at":"2026-05-18T00:05:44Z"},{"alias_kind":"pith_short_12","alias_value":"IOZBBFLLA7XS","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IOZBBFLLA7XSTMAC","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IOZBBFLL","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:58fbc176d57ceed09922840c83824a25771b3f4adb319f7693b19ea9e5cc5202","target":"graph","created_at":"2026-05-18T00:05:44Z","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$ and $b$ be positive integers. An even $[a,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that for every vertex $v \\in V(G)$, $d_H(v)$ is even and $a \\le d_H(v) \\le b$. Matsuda conjectured that if $G$ is an $n$-vertex 2-edge-connected graph such that $n \\ge 2a+b+\\frac{a^2-3a}b - 2$, $\\delta(G) \\ge a$, and $\\sigma_2(G) \\ge \\frac{2an}{a+b}$, then $G$ has an even $[a,b]$-factor. In this paper, we provide counterexamples, which are highly connected. Furthermore, we give sharp sufficient conditions for a graph to have an even $[a,b]$-factor. For even $an$, we conjecture a lower bo","authors_text":"Eun-Kyung Cho, Jeong Rye Park, Jong Yoon Hyun, Suil O","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-14T05:20:25Z","title":"Sharp conditions for the existence of an even $[a,b]$-factor in a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05260","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:0ef5484c1c6f160e79d11c98e0c1e631c3bf4135b48c0090c2b22714b3bca688","target":"record","created_at":"2026-05-18T00:05:44Z","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":"c9251be7ab36a8c91c3b274ae8653b05402a53209427a7c66562e783d2639566","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-14T05:20:25Z","title_canon_sha256":"39e1a6f18f5cd6433f0329b09dc60b18df5dcdb4ff3b7af173d1ee85fa9d12bf"},"schema_version":"1.0","source":{"id":"1809.05260","kind":"arxiv","version":1}},"canonical_sha256":"43b210956b07ef29b0028684115e7626a122775cd84c86716f78859688f542aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43b210956b07ef29b0028684115e7626a122775cd84c86716f78859688f542aa","first_computed_at":"2026-05-18T00:05:44.217712Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:44.217712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mprJzz8LFbtQGvbpo3N1ENAb2SZ4Sa2rMXzIrZ39MqJI5AYB+hCgvXA5u62LXEwv/9LoCkL45NLLBaq5C3OxCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:44.218267Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.05260","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ef5484c1c6f160e79d11c98e0c1e631c3bf4135b48c0090c2b22714b3bca688","sha256:58fbc176d57ceed09922840c83824a25771b3f4adb319f7693b19ea9e5cc5202"],"state_sha256":"51cc866c3c7b974b3e68d89d4770e586195936ede7d15579e52e07d3a7f0bf93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ob1BYE67c3H3uzWVkwOwrt11lxhAWTwm+5xbc9cwZryBnPptJWIHI0Fh3U16jfrVsuz0TFLyqEOIIcnYEgBjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T02:29:57.261339Z","bundle_sha256":"cb76e1d928e17d02303a6cc33839b8c20327d7a30466e6d1ba9b8dd7f64b7a6a"}}