{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PUG4PJFSFCWT2UBLQ7BEWIEGUS","short_pith_number":"pith:PUG4PJFS","canonical_record":{"source":{"id":"1612.08828","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-12-28T09:04:07Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d3b6716763771f952938a670760f7d7dabfb57281597afef779de0e3d4bc3698","abstract_canon_sha256":"2ab2f7afb0b2d5a16624c149636c3258d6619fbc770e8d5f279bf104375ea524"},"schema_version":"1.0"},"canonical_sha256":"7d0dc7a4b228ad3d502b87c24b2086a48d66532ee50530dcab17118e8ba6cab4","source":{"kind":"arxiv","id":"1612.08828","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08828","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08828v3","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08828","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"PUG4PJFSFCWT","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PUG4PJFSFCWT2UBL","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PUG4PJFS","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PUG4PJFSFCWT2UBLQ7BEWIEGUS","target":"record","payload":{"canonical_record":{"source":{"id":"1612.08828","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-12-28T09:04:07Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d3b6716763771f952938a670760f7d7dabfb57281597afef779de0e3d4bc3698","abstract_canon_sha256":"2ab2f7afb0b2d5a16624c149636c3258d6619fbc770e8d5f279bf104375ea524"},"schema_version":"1.0"},"canonical_sha256":"7d0dc7a4b228ad3d502b87c24b2086a48d66532ee50530dcab17118e8ba6cab4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:08.395197Z","signature_b64":"rqEpboCQS6k4qa3vb111q5YOmWToEPmOLHSseboy6viiTMd7LxJT9DA5bn07ij+4xfn4kY/9c18R+eDpCZ9rCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d0dc7a4b228ad3d502b87c24b2086a48d66532ee50530dcab17118e8ba6cab4","last_reissued_at":"2026-05-18T00:26:08.394561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:08.394561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.08828","source_version":3,"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:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"elOMN9PTCvp0hVBy94nN2AVl1FvNZ+BfWS0pv7wwquYqaDPtpt7ht7wt8Rpi0s+ujqsJRVkGnKephyO8k/I3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:57:57.045391Z"},"content_sha256":"a975564ca4c6e3b7177d24163379ae66498278921c81c8c9b2ce70a9ac0e66e5","schema_version":"1.0","event_id":"sha256:a975564ca4c6e3b7177d24163379ae66498278921c81c8c9b2ce70a9ac0e66e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PUG4PJFSFCWT2UBLQ7BEWIEGUS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Making Bipartite Graphs DM-irreducible","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jun Kato, Krist\\'of B\\'erczi, Satoru Iwata, Yutaro Yamaguchi","submitted_at":"2016-12-28T09:04:07Z","abstract_excerpt":"The Dulmage--Mendelsohn decomposition (or the DM-decomposition) gives a unique partition of the vertex set of a bipartite graph reflecting the structure of all the maximum matchings therein. A bipartite graph is said to be DM-irreducible if its DM-decomposition consists of a single component.\n  In this paper, we focus on the problem of making a given bipartite graph DM-irreducible by adding edges. When the input bipartite graph is balanced (i.e., both sides have the same number of vertices) and has a perfect matching, this problem is equivalent to making a directed graph strongly connected by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08828","kind":"arxiv","version":3},"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:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tb3UEn5kNnGX4DtJZW6696TdaeDRIbRQ3G9P3Y0LTPnJEPEnAQGT99TiQn+J/V4vD+BKcWtha1JSYJE0UXzIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:57:57.045736Z"},"content_sha256":"72ebcc1e5345afa1504ea90263a6b7aabc8398cdd028153c9e380f12812693ad","schema_version":"1.0","event_id":"sha256:72ebcc1e5345afa1504ea90263a6b7aabc8398cdd028153c9e380f12812693ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PUG4PJFSFCWT2UBLQ7BEWIEGUS/bundle.json","state_url":"https://pith.science/pith/PUG4PJFSFCWT2UBLQ7BEWIEGUS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PUG4PJFSFCWT2UBLQ7BEWIEGUS/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-02T04:57:57Z","links":{"resolver":"https://pith.science/pith/PUG4PJFSFCWT2UBLQ7BEWIEGUS","bundle":"https://pith.science/pith/PUG4PJFSFCWT2UBLQ7BEWIEGUS/bundle.json","state":"https://pith.science/pith/PUG4PJFSFCWT2UBLQ7BEWIEGUS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PUG4PJFSFCWT2UBLQ7BEWIEGUS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PUG4PJFSFCWT2UBLQ7BEWIEGUS","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":"2ab2f7afb0b2d5a16624c149636c3258d6619fbc770e8d5f279bf104375ea524","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-12-28T09:04:07Z","title_canon_sha256":"d3b6716763771f952938a670760f7d7dabfb57281597afef779de0e3d4bc3698"},"schema_version":"1.0","source":{"id":"1612.08828","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08828","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08828v3","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08828","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"PUG4PJFSFCWT","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PUG4PJFSFCWT2UBL","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PUG4PJFS","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:72ebcc1e5345afa1504ea90263a6b7aabc8398cdd028153c9e380f12812693ad","target":"graph","created_at":"2026-05-18T00:26:08Z","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":"The Dulmage--Mendelsohn decomposition (or the DM-decomposition) gives a unique partition of the vertex set of a bipartite graph reflecting the structure of all the maximum matchings therein. A bipartite graph is said to be DM-irreducible if its DM-decomposition consists of a single component.\n  In this paper, we focus on the problem of making a given bipartite graph DM-irreducible by adding edges. When the input bipartite graph is balanced (i.e., both sides have the same number of vertices) and has a perfect matching, this problem is equivalent to making a directed graph strongly connected by ","authors_text":"Jun Kato, Krist\\'of B\\'erczi, Satoru Iwata, Yutaro Yamaguchi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-12-28T09:04:07Z","title":"Making Bipartite Graphs DM-irreducible"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08828","kind":"arxiv","version":3},"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:a975564ca4c6e3b7177d24163379ae66498278921c81c8c9b2ce70a9ac0e66e5","target":"record","created_at":"2026-05-18T00:26:08Z","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":"2ab2f7afb0b2d5a16624c149636c3258d6619fbc770e8d5f279bf104375ea524","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-12-28T09:04:07Z","title_canon_sha256":"d3b6716763771f952938a670760f7d7dabfb57281597afef779de0e3d4bc3698"},"schema_version":"1.0","source":{"id":"1612.08828","kind":"arxiv","version":3}},"canonical_sha256":"7d0dc7a4b228ad3d502b87c24b2086a48d66532ee50530dcab17118e8ba6cab4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d0dc7a4b228ad3d502b87c24b2086a48d66532ee50530dcab17118e8ba6cab4","first_computed_at":"2026-05-18T00:26:08.394561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:08.394561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rqEpboCQS6k4qa3vb111q5YOmWToEPmOLHSseboy6viiTMd7LxJT9DA5bn07ij+4xfn4kY/9c18R+eDpCZ9rCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:08.395197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.08828","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a975564ca4c6e3b7177d24163379ae66498278921c81c8c9b2ce70a9ac0e66e5","sha256:72ebcc1e5345afa1504ea90263a6b7aabc8398cdd028153c9e380f12812693ad"],"state_sha256":"aeec93d4967757d91aafc5b7bb5e253e99fb7f909e02621f1f2b84f60b2d3477"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kw5td8VhWscgVRR7nrLC9LjcOC56/2JKcmm1PyJiYa1reZEhcUG7u5Oy+PxKWksr/qTpaGMDLoESgFEGZ9NuAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:57:57.047634Z","bundle_sha256":"b97783d30f26b4d8ddd91f7d1fe9104d060565af74a667f2a15f0788985fd4ff"}}