{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5Y7DJ76XJITSCTPI45CJE7AMZ7","short_pith_number":"pith:5Y7DJ76X","canonical_record":{"source":{"id":"1708.00582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-02T02:42:43Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"5d2b6952e1f9b1a990c090cb6801b6dba6f969346959d36b9ebeadc4561bb86b","abstract_canon_sha256":"9b0815823c19b53f2ac3855b2187a2a548f2df88d4d325d63736557a1c100084"},"schema_version":"1.0"},"canonical_sha256":"ee3e34ffd74a27214de8e744927c0ccff67794ad2852e22ab11db1479fc8bf8d","source":{"kind":"arxiv","id":"1708.00582","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00582","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00582v1","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00582","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"pith_short_12","alias_value":"5Y7DJ76XJITS","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5Y7DJ76XJITSCTPI","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5Y7DJ76X","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5Y7DJ76XJITSCTPI45CJE7AMZ7","target":"record","payload":{"canonical_record":{"source":{"id":"1708.00582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-02T02:42:43Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"5d2b6952e1f9b1a990c090cb6801b6dba6f969346959d36b9ebeadc4561bb86b","abstract_canon_sha256":"9b0815823c19b53f2ac3855b2187a2a548f2df88d4d325d63736557a1c100084"},"schema_version":"1.0"},"canonical_sha256":"ee3e34ffd74a27214de8e744927c0ccff67794ad2852e22ab11db1479fc8bf8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:45.336145Z","signature_b64":"6Z3FDlxEJbLvtpH5VS3YUMnZBbFRfz1UUjVOJCdwwpYeu6xL5Fi0C7iokM5aPCxtsakn/WlppE5Z1xkxiREyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee3e34ffd74a27214de8e744927c0ccff67794ad2852e22ab11db1479fc8bf8d","last_reissued_at":"2026-05-18T00:38:45.335711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:45.335711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.00582","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-18T00:38:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XQtpGofwZornd8iN+EHkWDS+jMbIzRa3fMn1CLTNchlO9wIUaTlqFO219cNe6nNDS0EaVHZTYvcHYNMbLrjHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:06:06.111372Z"},"content_sha256":"c6b308fba932b75dee48098b07e8a8d3c7e835b2d22a692ebf0147b8feec9e1c","schema_version":"1.0","event_id":"sha256:c6b308fba932b75dee48098b07e8a8d3c7e835b2d22a692ebf0147b8feec9e1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5Y7DJ76XJITSCTPI45CJE7AMZ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Excluded $t$-factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-matchings, and Matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Kenjiro Takazawa","submitted_at":"2017-08-02T02:42:43Z","abstract_excerpt":"We propose a framework for optimal $t$-matchings excluding the prescribed $t$-factors in bipartite graphs. The proposed framework is a generalization of the nonbipartite matching problem and includes several problems, such as the triangle-free $2$-matching, square-free $2$-matching, even factor, and arborescence problems. In this paper, we demonstrate a unified understanding of these problems by commonly extending previous important results. We solve our problem under a reasonable assumption, which is sufficiently broad to include the specific problems listed above. We first present a min-max "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00582","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-18T00:38:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zEBSwWUxvlunc3wAorKUNS/8GLvqbc1kbZzrm8ltLlD9QET0S2twjzSRb4OYWbzRRuxtfKdaveOcqcHz9iK9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:06:06.111923Z"},"content_sha256":"9c65ad1c753bd0cdf74a2c1fd48da749f989bc6c0e2a6e2224ba92d62787fc0e","schema_version":"1.0","event_id":"sha256:9c65ad1c753bd0cdf74a2c1fd48da749f989bc6c0e2a6e2224ba92d62787fc0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5Y7DJ76XJITSCTPI45CJE7AMZ7/bundle.json","state_url":"https://pith.science/pith/5Y7DJ76XJITSCTPI45CJE7AMZ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5Y7DJ76XJITSCTPI45CJE7AMZ7/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-05T06:06:06Z","links":{"resolver":"https://pith.science/pith/5Y7DJ76XJITSCTPI45CJE7AMZ7","bundle":"https://pith.science/pith/5Y7DJ76XJITSCTPI45CJE7AMZ7/bundle.json","state":"https://pith.science/pith/5Y7DJ76XJITSCTPI45CJE7AMZ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5Y7DJ76XJITSCTPI45CJE7AMZ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5Y7DJ76XJITSCTPI45CJE7AMZ7","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":"9b0815823c19b53f2ac3855b2187a2a548f2df88d4d325d63736557a1c100084","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-02T02:42:43Z","title_canon_sha256":"5d2b6952e1f9b1a990c090cb6801b6dba6f969346959d36b9ebeadc4561bb86b"},"schema_version":"1.0","source":{"id":"1708.00582","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00582","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00582v1","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00582","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"pith_short_12","alias_value":"5Y7DJ76XJITS","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5Y7DJ76XJITSCTPI","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5Y7DJ76X","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:9c65ad1c753bd0cdf74a2c1fd48da749f989bc6c0e2a6e2224ba92d62787fc0e","target":"graph","created_at":"2026-05-18T00:38:45Z","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":"We propose a framework for optimal $t$-matchings excluding the prescribed $t$-factors in bipartite graphs. The proposed framework is a generalization of the nonbipartite matching problem and includes several problems, such as the triangle-free $2$-matching, square-free $2$-matching, even factor, and arborescence problems. In this paper, we demonstrate a unified understanding of these problems by commonly extending previous important results. We solve our problem under a reasonable assumption, which is sufficiently broad to include the specific problems listed above. We first present a min-max ","authors_text":"Kenjiro Takazawa","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-02T02:42:43Z","title":"Excluded $t$-factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-matchings, and Matroids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00582","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:c6b308fba932b75dee48098b07e8a8d3c7e835b2d22a692ebf0147b8feec9e1c","target":"record","created_at":"2026-05-18T00:38:45Z","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":"9b0815823c19b53f2ac3855b2187a2a548f2df88d4d325d63736557a1c100084","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-02T02:42:43Z","title_canon_sha256":"5d2b6952e1f9b1a990c090cb6801b6dba6f969346959d36b9ebeadc4561bb86b"},"schema_version":"1.0","source":{"id":"1708.00582","kind":"arxiv","version":1}},"canonical_sha256":"ee3e34ffd74a27214de8e744927c0ccff67794ad2852e22ab11db1479fc8bf8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee3e34ffd74a27214de8e744927c0ccff67794ad2852e22ab11db1479fc8bf8d","first_computed_at":"2026-05-18T00:38:45.335711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:45.335711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6Z3FDlxEJbLvtpH5VS3YUMnZBbFRfz1UUjVOJCdwwpYeu6xL5Fi0C7iokM5aPCxtsakn/WlppE5Z1xkxiREyCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:45.336145Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00582","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6b308fba932b75dee48098b07e8a8d3c7e835b2d22a692ebf0147b8feec9e1c","sha256:9c65ad1c753bd0cdf74a2c1fd48da749f989bc6c0e2a6e2224ba92d62787fc0e"],"state_sha256":"3fb263ffbbdeda6934efaa64063e6a9988bb01bbcb0035298ccb2bfce445074e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o5hP7PvPp5VGT0xV8w5UYDQYAQBW/C+U/BH4ICiZMCFGLvvjjTJhBdj48Fh4isRqSLGamjxp07GdVOn5C1PiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:06:06.115006Z","bundle_sha256":"b4e52a8b108860783f1be692cad5de6298c3683842d99156321e4849777b8e41"}}