{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6V6Y4GVBXUXZEFJM5PHBV5NQ6L","short_pith_number":"pith:6V6Y4GVB","canonical_record":{"source":{"id":"1702.05874","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-20T06:35:24Z","cross_cats_sorted":[],"title_canon_sha256":"18efeab7af9fe7fe4bbb803453594eea440c68d88fb041c5ec1b34782d984009","abstract_canon_sha256":"31eaf1c14df57a12f14e92328e72d5f4c19059d0bb7a530d7bc02b09552d86a7"},"schema_version":"1.0"},"canonical_sha256":"f57d8e1aa1bd2f92152cebce1af5b0f2d0e997bc46409152a4f252dd2934165c","source":{"kind":"arxiv","id":"1702.05874","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05874","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05874v2","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05874","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"6V6Y4GVBXUXZ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6V6Y4GVBXUXZEFJM","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6V6Y4GVB","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6V6Y4GVBXUXZEFJM5PHBV5NQ6L","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05874","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-20T06:35:24Z","cross_cats_sorted":[],"title_canon_sha256":"18efeab7af9fe7fe4bbb803453594eea440c68d88fb041c5ec1b34782d984009","abstract_canon_sha256":"31eaf1c14df57a12f14e92328e72d5f4c19059d0bb7a530d7bc02b09552d86a7"},"schema_version":"1.0"},"canonical_sha256":"f57d8e1aa1bd2f92152cebce1af5b0f2d0e997bc46409152a4f252dd2934165c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:34.760304Z","signature_b64":"aluFbLySNtYeCieMo2GcQDKcL37wju3Fg5ZEcmJoiuv6rY/e6LzA3DFaMdyL+rWQh6UG9Ts8OjPVIyW0ECqjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f57d8e1aa1bd2f92152cebce1af5b0f2d0e997bc46409152a4f252dd2934165c","last_reissued_at":"2026-05-18T00:14:34.759706Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:34.759706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05874","source_version":2,"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:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8kdrMelNlr4zeZH+eoL8oSGhYrcUwmlGSZ5w2U7ZebI1Jhi8i0u/Cbg9y+oEunpKcVbPNO9dppklDXhdGYaeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T20:40:01.486674Z"},"content_sha256":"ddd2d6390b737eb74df8e3d6142713eeb4e2bab33d6b99898da3d7f5e37107bd","schema_version":"1.0","event_id":"sha256:ddd2d6390b737eb74df8e3d6142713eeb4e2bab33d6b99898da3d7f5e37107bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6V6Y4GVBXUXZEFJM5PHBV5NQ6L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of All $(g,f)$-Factor Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongliang Lu","submitted_at":"2017-02-20T06:35:24Z","abstract_excerpt":"Let $G$ be a graph with vertex set $V$ and let $g, f : V\\rightarrow \\mathbb{Z}^+$ be two functions such that $g\\le f$. We say that $G$ has all $(g, f )$-factors if $G$ has an $h$-factor for every $h: V\\rightarrow \\mathbb{Z}^+$ such that $g(v)\\le h(v)\\le f (v)$ for every $v\\in V$ and $\\sum_{v\\in{V}}h(v)\\equiv 0\\pmod 2$. Two decades ago, Niessen derived from Tutte's $f$-factor theorem a similar characterization for the property of graphs having all $(g, f )$-factors and asked whether there is a polynomial time algorithm for testing whether a graph $G$ has all $(g, f )$-factors (A characterizatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05874","kind":"arxiv","version":2},"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:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6z1o0q/K9d5O2Xi6ZvcYM307CcH0fut3GLSjflg0pmA3xyUqmQWpEtIqC4icTJwvVVPs13JQ8CC7MAQRjOCnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T20:40:01.487008Z"},"content_sha256":"25657ab955a529701ecb82914ac762b8952aadf4ad2ea61e4d1f3472718ccbb4","schema_version":"1.0","event_id":"sha256:25657ab955a529701ecb82914ac762b8952aadf4ad2ea61e4d1f3472718ccbb4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6V6Y4GVBXUXZEFJM5PHBV5NQ6L/bundle.json","state_url":"https://pith.science/pith/6V6Y4GVBXUXZEFJM5PHBV5NQ6L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6V6Y4GVBXUXZEFJM5PHBV5NQ6L/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-19T20:40:01Z","links":{"resolver":"https://pith.science/pith/6V6Y4GVBXUXZEFJM5PHBV5NQ6L","bundle":"https://pith.science/pith/6V6Y4GVBXUXZEFJM5PHBV5NQ6L/bundle.json","state":"https://pith.science/pith/6V6Y4GVBXUXZEFJM5PHBV5NQ6L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6V6Y4GVBXUXZEFJM5PHBV5NQ6L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6V6Y4GVBXUXZEFJM5PHBV5NQ6L","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":"31eaf1c14df57a12f14e92328e72d5f4c19059d0bb7a530d7bc02b09552d86a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-20T06:35:24Z","title_canon_sha256":"18efeab7af9fe7fe4bbb803453594eea440c68d88fb041c5ec1b34782d984009"},"schema_version":"1.0","source":{"id":"1702.05874","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05874","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05874v2","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05874","created_at":"2026-05-18T00:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"6V6Y4GVBXUXZ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6V6Y4GVBXUXZEFJM","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6V6Y4GVB","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:25657ab955a529701ecb82914ac762b8952aadf4ad2ea61e4d1f3472718ccbb4","target":"graph","created_at":"2026-05-18T00:14:34Z","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 $G$ be a graph with vertex set $V$ and let $g, f : V\\rightarrow \\mathbb{Z}^+$ be two functions such that $g\\le f$. We say that $G$ has all $(g, f )$-factors if $G$ has an $h$-factor for every $h: V\\rightarrow \\mathbb{Z}^+$ such that $g(v)\\le h(v)\\le f (v)$ for every $v\\in V$ and $\\sum_{v\\in{V}}h(v)\\equiv 0\\pmod 2$. Two decades ago, Niessen derived from Tutte's $f$-factor theorem a similar characterization for the property of graphs having all $(g, f )$-factors and asked whether there is a polynomial time algorithm for testing whether a graph $G$ has all $(g, f )$-factors (A characterizatio","authors_text":"Hongliang Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-20T06:35:24Z","title":"The Complexity of All $(g,f)$-Factor Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05874","kind":"arxiv","version":2},"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:ddd2d6390b737eb74df8e3d6142713eeb4e2bab33d6b99898da3d7f5e37107bd","target":"record","created_at":"2026-05-18T00:14:34Z","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":"31eaf1c14df57a12f14e92328e72d5f4c19059d0bb7a530d7bc02b09552d86a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-20T06:35:24Z","title_canon_sha256":"18efeab7af9fe7fe4bbb803453594eea440c68d88fb041c5ec1b34782d984009"},"schema_version":"1.0","source":{"id":"1702.05874","kind":"arxiv","version":2}},"canonical_sha256":"f57d8e1aa1bd2f92152cebce1af5b0f2d0e997bc46409152a4f252dd2934165c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f57d8e1aa1bd2f92152cebce1af5b0f2d0e997bc46409152a4f252dd2934165c","first_computed_at":"2026-05-18T00:14:34.759706Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:34.759706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aluFbLySNtYeCieMo2GcQDKcL37wju3Fg5ZEcmJoiuv6rY/e6LzA3DFaMdyL+rWQh6UG9Ts8OjPVIyW0ECqjBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:34.760304Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05874","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ddd2d6390b737eb74df8e3d6142713eeb4e2bab33d6b99898da3d7f5e37107bd","sha256:25657ab955a529701ecb82914ac762b8952aadf4ad2ea61e4d1f3472718ccbb4"],"state_sha256":"91111172dee60d2e3b0ff58e17de68dfc398ac3ced75c2c58ffb4805e073c506"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9gWOhOD1LC2i+voyYKfnFPDP4WzlERnSPnBes70ZUQv7ykT9kpdNltDdezl+uQOXqaonqlGBeSa2jwvCiQ6bDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-19T20:40:01.488927Z","bundle_sha256":"7baaade400faff956031c64e9f88bc8f554c2434032f7f0cc7443bc6a7917c3e"}}