{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OTOHHJTNY5GXPZKZZDY3WSVBPM","short_pith_number":"pith:OTOHHJTN","canonical_record":{"source":{"id":"1612.08904","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-28T14:56:45Z","cross_cats_sorted":[],"title_canon_sha256":"3b2c2e672ba79b5b6ea3d54c99596ab23c2add46c0906e7a6d96c3f9be9c6608","abstract_canon_sha256":"db0a2aa155fe1cb93ba0ae7327b27b66d1e9177925e7225ef083ef13f4e20186"},"schema_version":"1.0"},"canonical_sha256":"74dc73a66dc74d77e559c8f1bb4aa17b2169016a7c0871e5a570835950333f6a","source":{"kind":"arxiv","id":"1612.08904","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08904","created_at":"2026-05-18T00:38:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08904v2","created_at":"2026-05-18T00:38:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08904","created_at":"2026-05-18T00:38:46Z"},{"alias_kind":"pith_short_12","alias_value":"OTOHHJTNY5GX","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OTOHHJTNY5GXPZKZ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OTOHHJTN","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OTOHHJTNY5GXPZKZZDY3WSVBPM","target":"record","payload":{"canonical_record":{"source":{"id":"1612.08904","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-28T14:56:45Z","cross_cats_sorted":[],"title_canon_sha256":"3b2c2e672ba79b5b6ea3d54c99596ab23c2add46c0906e7a6d96c3f9be9c6608","abstract_canon_sha256":"db0a2aa155fe1cb93ba0ae7327b27b66d1e9177925e7225ef083ef13f4e20186"},"schema_version":"1.0"},"canonical_sha256":"74dc73a66dc74d77e559c8f1bb4aa17b2169016a7c0871e5a570835950333f6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:46.324337Z","signature_b64":"QP7DINnWjoRjnEp1BvtAeBzQDYsKzyhn5ajsAiRPw8X118xspPDy4yeb8/r0RCKjCdfx2WiMkCeBB/ZfEtPZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74dc73a66dc74d77e559c8f1bb4aa17b2169016a7c0871e5a570835950333f6a","last_reissued_at":"2026-05-18T00:38:46.323581Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:46.323581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.08904","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:38:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYb4Lk0crnFlhy+Nb61ulTcfI5X3O7G1QT3qxa2pzKhprLyOQgX6BLyVZjX/nkbkuK6JyiH+y8IKQnQTpj9oDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:14:21.095925Z"},"content_sha256":"4ca3dbe6b2a6f81ce84f96ab13007b0586dfa607e9f847169234b78b0772af58","schema_version":"1.0","event_id":"sha256:4ca3dbe6b2a6f81ce84f96ab13007b0586dfa607e9f847169234b78b0772af58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OTOHHJTNY5GXPZKZZDY3WSVBPM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On directed 2-factors in digraphs and 2-factors containing perfect matchings in bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuya Chiba, Tomoki Yamashita","submitted_at":"2016-12-28T14:56:45Z","abstract_excerpt":"In this paper, we give the following result: If $D$ is a digraph of order $n$, and if $d_{D}^{+}(u) + d_{D}^{-}(v) \\ge n$ for every two distinct vertices $u$ and $v$ with $(u, v) \\notin A(D)$, then $D$ has a directed $2$-factor with exactly $k$ directed cycles of length at least $3$, where $n \\ge 12k+3$. This result is equivalent to the following result: If $G$ is a balanced bipartite graph of order $2n$ with partite sets $X$ and $Y$, and if $d_{G}(x)+d_{G}(y) \\ge n + 2$ for every two vertices $x \\in X$ and $y \\in Y$ with $xy \\notin E(G)$, then for every perfect matching $M$, $G$ has a $2$-fac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08904","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:38:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xM5+5gz0U/maS7pYq5PB2tJO+H749Yif7WO+gMsBsdhrdGZmbLE46sUyzfNMsf5/uxxnnkQEWUl2DrdNgEQZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:14:21.096804Z"},"content_sha256":"b36546e5c8278b8e570f7a853e4773c95e3b8eb8022e6b64cf365c5ce865650a","schema_version":"1.0","event_id":"sha256:b36546e5c8278b8e570f7a853e4773c95e3b8eb8022e6b64cf365c5ce865650a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTOHHJTNY5GXPZKZZDY3WSVBPM/bundle.json","state_url":"https://pith.science/pith/OTOHHJTNY5GXPZKZZDY3WSVBPM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTOHHJTNY5GXPZKZZDY3WSVBPM/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-05-31T05:14:21Z","links":{"resolver":"https://pith.science/pith/OTOHHJTNY5GXPZKZZDY3WSVBPM","bundle":"https://pith.science/pith/OTOHHJTNY5GXPZKZZDY3WSVBPM/bundle.json","state":"https://pith.science/pith/OTOHHJTNY5GXPZKZZDY3WSVBPM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTOHHJTNY5GXPZKZZDY3WSVBPM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OTOHHJTNY5GXPZKZZDY3WSVBPM","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":"db0a2aa155fe1cb93ba0ae7327b27b66d1e9177925e7225ef083ef13f4e20186","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-28T14:56:45Z","title_canon_sha256":"3b2c2e672ba79b5b6ea3d54c99596ab23c2add46c0906e7a6d96c3f9be9c6608"},"schema_version":"1.0","source":{"id":"1612.08904","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08904","created_at":"2026-05-18T00:38:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08904v2","created_at":"2026-05-18T00:38:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08904","created_at":"2026-05-18T00:38:46Z"},{"alias_kind":"pith_short_12","alias_value":"OTOHHJTNY5GX","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OTOHHJTNY5GXPZKZ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OTOHHJTN","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:b36546e5c8278b8e570f7a853e4773c95e3b8eb8022e6b64cf365c5ce865650a","target":"graph","created_at":"2026-05-18T00:38: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"},"paper":{"abstract_excerpt":"In this paper, we give the following result: If $D$ is a digraph of order $n$, and if $d_{D}^{+}(u) + d_{D}^{-}(v) \\ge n$ for every two distinct vertices $u$ and $v$ with $(u, v) \\notin A(D)$, then $D$ has a directed $2$-factor with exactly $k$ directed cycles of length at least $3$, where $n \\ge 12k+3$. This result is equivalent to the following result: If $G$ is a balanced bipartite graph of order $2n$ with partite sets $X$ and $Y$, and if $d_{G}(x)+d_{G}(y) \\ge n + 2$ for every two vertices $x \\in X$ and $y \\in Y$ with $xy \\notin E(G)$, then for every perfect matching $M$, $G$ has a $2$-fac","authors_text":"Shuya Chiba, Tomoki Yamashita","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-28T14:56:45Z","title":"On directed 2-factors in digraphs and 2-factors containing perfect matchings in bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08904","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:4ca3dbe6b2a6f81ce84f96ab13007b0586dfa607e9f847169234b78b0772af58","target":"record","created_at":"2026-05-18T00:38: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":"db0a2aa155fe1cb93ba0ae7327b27b66d1e9177925e7225ef083ef13f4e20186","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-28T14:56:45Z","title_canon_sha256":"3b2c2e672ba79b5b6ea3d54c99596ab23c2add46c0906e7a6d96c3f9be9c6608"},"schema_version":"1.0","source":{"id":"1612.08904","kind":"arxiv","version":2}},"canonical_sha256":"74dc73a66dc74d77e559c8f1bb4aa17b2169016a7c0871e5a570835950333f6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74dc73a66dc74d77e559c8f1bb4aa17b2169016a7c0871e5a570835950333f6a","first_computed_at":"2026-05-18T00:38:46.323581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:46.323581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QP7DINnWjoRjnEp1BvtAeBzQDYsKzyhn5ajsAiRPw8X118xspPDy4yeb8/r0RCKjCdfx2WiMkCeBB/ZfEtPZCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:46.324337Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.08904","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ca3dbe6b2a6f81ce84f96ab13007b0586dfa607e9f847169234b78b0772af58","sha256:b36546e5c8278b8e570f7a853e4773c95e3b8eb8022e6b64cf365c5ce865650a"],"state_sha256":"385d833f1b3d21aa80fc7891a810be35ec73cce350d753b5fa230d03686bb354"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FrLY97tthsgyjZQp8LimNVgS9YpEsDvZoNljmYAWFuB9yVVQvka/nQd+k0AN/cN21ZUjWwJ7RVC8ibu8/a/fCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:14:21.101422Z","bundle_sha256":"1a6bc4a329fe777354928abf3573884384ddace7b82777b0f800ada5bc63915f"}}