{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TW6KZQOVDWTZDDONJXSBPBM2QU","short_pith_number":"pith:TW6KZQOV","canonical_record":{"source":{"id":"1710.08236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T12:39:38Z","cross_cats_sorted":[],"title_canon_sha256":"b9fb4b9c2b444fbf84e25362fa55cb21239ae94407728bcf0294dc60ee2a35b4","abstract_canon_sha256":"6c884df025458a94f2c6faa37db1ff427cb314b82fca30a990118f9840f70ed4"},"schema_version":"1.0"},"canonical_sha256":"9dbcacc1d51da7918dcd4de417859a85216e73e1ce3bcd4bd2b3d62c033da2b7","source":{"kind":"arxiv","id":"1710.08236","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08236","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08236v1","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08236","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"pith_short_12","alias_value":"TW6KZQOVDWTZ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TW6KZQOVDWTZDDON","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TW6KZQOV","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TW6KZQOVDWTZDDONJXSBPBM2QU","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T12:39:38Z","cross_cats_sorted":[],"title_canon_sha256":"b9fb4b9c2b444fbf84e25362fa55cb21239ae94407728bcf0294dc60ee2a35b4","abstract_canon_sha256":"6c884df025458a94f2c6faa37db1ff427cb314b82fca30a990118f9840f70ed4"},"schema_version":"1.0"},"canonical_sha256":"9dbcacc1d51da7918dcd4de417859a85216e73e1ce3bcd4bd2b3d62c033da2b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:16.912371Z","signature_b64":"oXSlT8iwF/GxbPgD+R/pz0dW/U1n3MPJ/w9CbNzDoayerUgdVXaYidEz8u3Y1MdK8cNWtFaWhxFrN6p7EmIgCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dbcacc1d51da7918dcd4de417859a85216e73e1ce3bcd4bd2b3d62c033da2b7","last_reissued_at":"2026-05-18T00:32:16.911834Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:16.911834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08236","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:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q42YkXxujAjzwraAeuFtv1DCcJ/MF1Xv7UQQk6zYSaG6w02PNoAdVlAB3EYhhc2+ipQ6CHbJ+vhQLMO6zcmOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:03:28.679139Z"},"content_sha256":"f1a5af593169005fed90b3c94fc5516a7b920dedafc916f42d1193376a2aab05","schema_version":"1.0","event_id":"sha256:f1a5af593169005fed90b3c94fc5516a7b920dedafc916f42d1193376a2aab05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TW6KZQOVDWTZDDONJXSBPBM2QU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On some hard and some tractable cases of the maximum acyclic matching problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Rautenbach, M. F\\\"urst","submitted_at":"2017-10-23T12:39:38Z","abstract_excerpt":"Three well-studied types of subgraph-restricted matchings are induced matchings, uniquely restricted matchings, and acyclic matchings. While it is hard to determine the maximum size of a matching of each of these types, whether some given graph has a maximum matching that is induced or has a maximum matching that is uniquely restricted, can both be decided efficiently. In contrast to that we show that deciding whether a given bipartite graph of maximum degree at most four has a maximum matching that is acyclic is NP-complete. Furthermore, we show that maximum weight acyclic matchings can be de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08236","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:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gBEHNQIg4eLHS40wJTg/gDP2fe8RGizodxedYhZFcJBkQbRjQ6jOH5IT2Nwz8c2BfxK/+P7CpGCT8iHtfqWjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:03:28.679516Z"},"content_sha256":"149b49fdf690efd53811fef8aef4c6910e06a46c0bd9304175ecd56c8d171a5a","schema_version":"1.0","event_id":"sha256:149b49fdf690efd53811fef8aef4c6910e06a46c0bd9304175ecd56c8d171a5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TW6KZQOVDWTZDDONJXSBPBM2QU/bundle.json","state_url":"https://pith.science/pith/TW6KZQOVDWTZDDONJXSBPBM2QU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TW6KZQOVDWTZDDONJXSBPBM2QU/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-01T06:03:28Z","links":{"resolver":"https://pith.science/pith/TW6KZQOVDWTZDDONJXSBPBM2QU","bundle":"https://pith.science/pith/TW6KZQOVDWTZDDONJXSBPBM2QU/bundle.json","state":"https://pith.science/pith/TW6KZQOVDWTZDDONJXSBPBM2QU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TW6KZQOVDWTZDDONJXSBPBM2QU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TW6KZQOVDWTZDDONJXSBPBM2QU","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":"6c884df025458a94f2c6faa37db1ff427cb314b82fca30a990118f9840f70ed4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T12:39:38Z","title_canon_sha256":"b9fb4b9c2b444fbf84e25362fa55cb21239ae94407728bcf0294dc60ee2a35b4"},"schema_version":"1.0","source":{"id":"1710.08236","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08236","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08236v1","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08236","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"pith_short_12","alias_value":"TW6KZQOVDWTZ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TW6KZQOVDWTZDDON","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TW6KZQOV","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:149b49fdf690efd53811fef8aef4c6910e06a46c0bd9304175ecd56c8d171a5a","target":"graph","created_at":"2026-05-18T00:32:16Z","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":"Three well-studied types of subgraph-restricted matchings are induced matchings, uniquely restricted matchings, and acyclic matchings. While it is hard to determine the maximum size of a matching of each of these types, whether some given graph has a maximum matching that is induced or has a maximum matching that is uniquely restricted, can both be decided efficiently. In contrast to that we show that deciding whether a given bipartite graph of maximum degree at most four has a maximum matching that is acyclic is NP-complete. Furthermore, we show that maximum weight acyclic matchings can be de","authors_text":"D. Rautenbach, M. F\\\"urst","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T12:39:38Z","title":"On some hard and some tractable cases of the maximum acyclic matching problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08236","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:f1a5af593169005fed90b3c94fc5516a7b920dedafc916f42d1193376a2aab05","target":"record","created_at":"2026-05-18T00:32:16Z","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":"6c884df025458a94f2c6faa37db1ff427cb314b82fca30a990118f9840f70ed4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T12:39:38Z","title_canon_sha256":"b9fb4b9c2b444fbf84e25362fa55cb21239ae94407728bcf0294dc60ee2a35b4"},"schema_version":"1.0","source":{"id":"1710.08236","kind":"arxiv","version":1}},"canonical_sha256":"9dbcacc1d51da7918dcd4de417859a85216e73e1ce3bcd4bd2b3d62c033da2b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9dbcacc1d51da7918dcd4de417859a85216e73e1ce3bcd4bd2b3d62c033da2b7","first_computed_at":"2026-05-18T00:32:16.911834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:16.911834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oXSlT8iwF/GxbPgD+R/pz0dW/U1n3MPJ/w9CbNzDoayerUgdVXaYidEz8u3Y1MdK8cNWtFaWhxFrN6p7EmIgCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:16.912371Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08236","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1a5af593169005fed90b3c94fc5516a7b920dedafc916f42d1193376a2aab05","sha256:149b49fdf690efd53811fef8aef4c6910e06a46c0bd9304175ecd56c8d171a5a"],"state_sha256":"80d51eaf70e949f68a11afa3319790b143d0e5b6accddb27583da553f2e86ffc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eLg0ZXREMBZa5VgSpt5ApgfL9FyjaeC+0HszcO7Q0SpWaaN+czGeiItRM3WdgfS585F7sFKvC3iO8cDFyYtiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:03:28.681617Z","bundle_sha256":"be3ad3a3a1c87670a559cf07589977a26deff12fee825283c78f751318803d09"}}