{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ILAS53BCIUB2YG5BVESX5EDUSX","short_pith_number":"pith:ILAS53BC","canonical_record":{"source":{"id":"1011.4359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-19T08:01:06Z","cross_cats_sorted":[],"title_canon_sha256":"41c57f143d8d66c53f61625414bb86907ecd6b355f87f6c79bfce5cc737be96e","abstract_canon_sha256":"38ab57bd2bc6c9f325263ee19ea4c78f3ebb2d4533daaa39de501e9ba7b59385"},"schema_version":"1.0"},"canonical_sha256":"42c12eec224503ac1ba1a9257e907495d3e74061933568018ce19df5c0a246fd","source":{"kind":"arxiv","id":"1011.4359","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4359","created_at":"2026-05-18T04:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4359v1","created_at":"2026-05-18T04:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4359","created_at":"2026-05-18T04:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"ILAS53BCIUB2","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"ILAS53BCIUB2YG5B","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"ILAS53BC","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ILAS53BCIUB2YG5BVESX5EDUSX","target":"record","payload":{"canonical_record":{"source":{"id":"1011.4359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-19T08:01:06Z","cross_cats_sorted":[],"title_canon_sha256":"41c57f143d8d66c53f61625414bb86907ecd6b355f87f6c79bfce5cc737be96e","abstract_canon_sha256":"38ab57bd2bc6c9f325263ee19ea4c78f3ebb2d4533daaa39de501e9ba7b59385"},"schema_version":"1.0"},"canonical_sha256":"42c12eec224503ac1ba1a9257e907495d3e74061933568018ce19df5c0a246fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:14.356575Z","signature_b64":"HyzRX4UNrrpS7aZ8Z/RLs846a7sXdxpbgyC94C+ppiyOuE4MEZXKlybffz/nIXzVyTFQCQfLGWqrp8exSfjsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42c12eec224503ac1ba1a9257e907495d3e74061933568018ce19df5c0a246fd","last_reissued_at":"2026-05-18T04:35:14.355916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:14.355916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.4359","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-18T04:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vltLU4ckqjhsWRvhqqVEbcNjgA1u0gk9in5lVWOTOdZ/yYtnBo3HEkRiuDF++NLp2CGwZWVlGeYba055uWTvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:27:23.777507Z"},"content_sha256":"fdbfb9e36446b03ec4ba0dc6e596e059def4a391f7b7a59c3732103405e6b72f","schema_version":"1.0","event_id":"sha256:fdbfb9e36446b03ec4ba0dc6e596e059def4a391f7b7a59c3732103405e6b72f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ILAS53BCIUB2YG5BVESX5EDUSX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bipartite graphs with a perfect matching and digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dingjun Lou, Zan-Bo Zhang","submitted_at":"2010-11-19T08:01:06Z","abstract_excerpt":"In this paper, we introduce a corresponding between bipartite graphs with a perfect matching and digraphs, which implicates an equivalent relation between the extendibility of bipartite graphs and the strongly connectivity of digraphs. Such an equivalent relation explains the similar results on $k$-extendable bipartite graphs and $k$-strong digraphs. We also study the relation among $k$-extendable bipartite graphs, $k$-strong digraphs and combinatorial matrices. For bipartite graphs that are not 1-extendable and digraphs that are not strong, we prove that the elementary components and strong c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4359","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-18T04:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LFz5OqsgCEwFaVFNmm0v6XqJQzlRUKt7khRHPKORhcMSo0GdRCvukYhrDjhOKK2mjCPO9Ml02kQ0AkVmmYz4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:27:23.778231Z"},"content_sha256":"33e1acc3aa87f19fe84e4ac5f7a39ed4dcf1017defd4b6d15907cdf8d58ce677","schema_version":"1.0","event_id":"sha256:33e1acc3aa87f19fe84e4ac5f7a39ed4dcf1017defd4b6d15907cdf8d58ce677"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ILAS53BCIUB2YG5BVESX5EDUSX/bundle.json","state_url":"https://pith.science/pith/ILAS53BCIUB2YG5BVESX5EDUSX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ILAS53BCIUB2YG5BVESX5EDUSX/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-31T13:27:23Z","links":{"resolver":"https://pith.science/pith/ILAS53BCIUB2YG5BVESX5EDUSX","bundle":"https://pith.science/pith/ILAS53BCIUB2YG5BVESX5EDUSX/bundle.json","state":"https://pith.science/pith/ILAS53BCIUB2YG5BVESX5EDUSX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ILAS53BCIUB2YG5BVESX5EDUSX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ILAS53BCIUB2YG5BVESX5EDUSX","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":"38ab57bd2bc6c9f325263ee19ea4c78f3ebb2d4533daaa39de501e9ba7b59385","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-19T08:01:06Z","title_canon_sha256":"41c57f143d8d66c53f61625414bb86907ecd6b355f87f6c79bfce5cc737be96e"},"schema_version":"1.0","source":{"id":"1011.4359","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4359","created_at":"2026-05-18T04:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4359v1","created_at":"2026-05-18T04:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4359","created_at":"2026-05-18T04:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"ILAS53BCIUB2","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"ILAS53BCIUB2YG5B","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"ILAS53BC","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:33e1acc3aa87f19fe84e4ac5f7a39ed4dcf1017defd4b6d15907cdf8d58ce677","target":"graph","created_at":"2026-05-18T04:35:14Z","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 introduce a corresponding between bipartite graphs with a perfect matching and digraphs, which implicates an equivalent relation between the extendibility of bipartite graphs and the strongly connectivity of digraphs. Such an equivalent relation explains the similar results on $k$-extendable bipartite graphs and $k$-strong digraphs. We also study the relation among $k$-extendable bipartite graphs, $k$-strong digraphs and combinatorial matrices. For bipartite graphs that are not 1-extendable and digraphs that are not strong, we prove that the elementary components and strong c","authors_text":"Dingjun Lou, Zan-Bo Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-19T08:01:06Z","title":"Bipartite graphs with a perfect matching and digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4359","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:fdbfb9e36446b03ec4ba0dc6e596e059def4a391f7b7a59c3732103405e6b72f","target":"record","created_at":"2026-05-18T04:35:14Z","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":"38ab57bd2bc6c9f325263ee19ea4c78f3ebb2d4533daaa39de501e9ba7b59385","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-19T08:01:06Z","title_canon_sha256":"41c57f143d8d66c53f61625414bb86907ecd6b355f87f6c79bfce5cc737be96e"},"schema_version":"1.0","source":{"id":"1011.4359","kind":"arxiv","version":1}},"canonical_sha256":"42c12eec224503ac1ba1a9257e907495d3e74061933568018ce19df5c0a246fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42c12eec224503ac1ba1a9257e907495d3e74061933568018ce19df5c0a246fd","first_computed_at":"2026-05-18T04:35:14.355916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:35:14.355916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HyzRX4UNrrpS7aZ8Z/RLs846a7sXdxpbgyC94C+ppiyOuE4MEZXKlybffz/nIXzVyTFQCQfLGWqrp8exSfjsCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:35:14.356575Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.4359","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdbfb9e36446b03ec4ba0dc6e596e059def4a391f7b7a59c3732103405e6b72f","sha256:33e1acc3aa87f19fe84e4ac5f7a39ed4dcf1017defd4b6d15907cdf8d58ce677"],"state_sha256":"72f45e1e4ae1323d2972845bb3f097ad18f6d91b7d7cc89bf99001ee2e8ed9d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mXoynStdTpQRKLicudfx3n44IW6mBEU9CX0z5GfFnsYTh++gI5e9fA0BzoEnq3stabEQ95BVC0bes9DdEHPIBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T13:27:23.782098Z","bundle_sha256":"6a01c7aa49ea8635b359f1c4d67ff195e43c1b9148676ae0067cd65de120b69a"}}