{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ILAS53BCIUB2YG5BVESX5EDUSX","short_pith_number":"pith:ILAS53BC","schema_version":"1.0","canonical_sha256":"42c12eec224503ac1ba1a9257e907495d3e74061933568018ce19df5c0a246fd","source":{"kind":"arxiv","id":"1011.4359","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.4359","created_at":"2026-05-18T04:35:14.356011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.4359v1","created_at":"2026-05-18T04:35:14.356011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4359","created_at":"2026-05-18T04:35:14.356011+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILAS53BCIUB2","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILAS53BCIUB2YG5B","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILAS53BC","created_at":"2026-05-18T12:26:09.077623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ILAS53BCIUB2YG5BVESX5EDUSX","json":"https://pith.science/pith/ILAS53BCIUB2YG5BVESX5EDUSX.json","graph_json":"https://pith.science/api/pith-number/ILAS53BCIUB2YG5BVESX5EDUSX/graph.json","events_json":"https://pith.science/api/pith-number/ILAS53BCIUB2YG5BVESX5EDUSX/events.json","paper":"https://pith.science/paper/ILAS53BC"},"agent_actions":{"view_html":"https://pith.science/pith/ILAS53BCIUB2YG5BVESX5EDUSX","download_json":"https://pith.science/pith/ILAS53BCIUB2YG5BVESX5EDUSX.json","view_paper":"https://pith.science/paper/ILAS53BC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.4359&json=true","fetch_graph":"https://pith.science/api/pith-number/ILAS53BCIUB2YG5BVESX5EDUSX/graph.json","fetch_events":"https://pith.science/api/pith-number/ILAS53BCIUB2YG5BVESX5EDUSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILAS53BCIUB2YG5BVESX5EDUSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILAS53BCIUB2YG5BVESX5EDUSX/action/storage_attestation","attest_author":"https://pith.science/pith/ILAS53BCIUB2YG5BVESX5EDUSX/action/author_attestation","sign_citation":"https://pith.science/pith/ILAS53BCIUB2YG5BVESX5EDUSX/action/citation_signature","submit_replication":"https://pith.science/pith/ILAS53BCIUB2YG5BVESX5EDUSX/action/replication_record"}},"created_at":"2026-05-18T04:35:14.356011+00:00","updated_at":"2026-05-18T04:35:14.356011+00:00"}