{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y5GZEXSAM62QGMP6ZGO47TPITX","short_pith_number":"pith:Y5GZEXSA","schema_version":"1.0","canonical_sha256":"c74d925e4067b50331fec99dcfcde89dda8f74259b645432bb504c5dedd700ee","source":{"kind":"arxiv","id":"1712.04228","version":1},"attestation_state":"computed","paper":{"title":"On some Graphs with a Unique Perfect Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"D. Rautenbach, F. Maffray, M. F\\\"urst, S. Chaplick","submitted_at":"2017-12-12T11:03:37Z","abstract_excerpt":"We show that deciding whether a given graph $G$ of size $m$ has a unique perfect matching as well as finding that matching, if it exists, can be done in time $O(m)$ if $G$ is either a cograph, or a split graph, or an interval graph, or claw-free. Furthermore, we provide a constructive characterization of the claw-free graphs with a unique perfect matching."},"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":"1712.04228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-12T11:03:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"28ca6f8445eaaf2dc25b1be15a7018e5125f7c62be80caae1db3e0f801471989","abstract_canon_sha256":"6ba3a5a591d48e2b5b92808c97ea1268a61359606e0bafd1e7fec6fac840e663"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:08.729124Z","signature_b64":"9QCyJiqxhMeid0VVAWReUv0xPnL0mB5leHUt0ChQFJ+E+/HGzbiKVkdJxPIL4GouF8PZa3+tKuV4/99UQWn3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c74d925e4067b50331fec99dcfcde89dda8f74259b645432bb504c5dedd700ee","last_reissued_at":"2026-05-18T00:28:08.728356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:08.728356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On some Graphs with a Unique Perfect Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"D. Rautenbach, F. Maffray, M. F\\\"urst, S. Chaplick","submitted_at":"2017-12-12T11:03:37Z","abstract_excerpt":"We show that deciding whether a given graph $G$ of size $m$ has a unique perfect matching as well as finding that matching, if it exists, can be done in time $O(m)$ if $G$ is either a cograph, or a split graph, or an interval graph, or claw-free. Furthermore, we provide a constructive characterization of the claw-free graphs with a unique perfect matching."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04228","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":"1712.04228","created_at":"2026-05-18T00:28:08.728474+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.04228v1","created_at":"2026-05-18T00:28:08.728474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04228","created_at":"2026-05-18T00:28:08.728474+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5GZEXSAM62Q","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5GZEXSAM62QGMP6","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5GZEXSA","created_at":"2026-05-18T12:31:56.362134+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/Y5GZEXSAM62QGMP6ZGO47TPITX","json":"https://pith.science/pith/Y5GZEXSAM62QGMP6ZGO47TPITX.json","graph_json":"https://pith.science/api/pith-number/Y5GZEXSAM62QGMP6ZGO47TPITX/graph.json","events_json":"https://pith.science/api/pith-number/Y5GZEXSAM62QGMP6ZGO47TPITX/events.json","paper":"https://pith.science/paper/Y5GZEXSA"},"agent_actions":{"view_html":"https://pith.science/pith/Y5GZEXSAM62QGMP6ZGO47TPITX","download_json":"https://pith.science/pith/Y5GZEXSAM62QGMP6ZGO47TPITX.json","view_paper":"https://pith.science/paper/Y5GZEXSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.04228&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5GZEXSAM62QGMP6ZGO47TPITX/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5GZEXSAM62QGMP6ZGO47TPITX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5GZEXSAM62QGMP6ZGO47TPITX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5GZEXSAM62QGMP6ZGO47TPITX/action/storage_attestation","attest_author":"https://pith.science/pith/Y5GZEXSAM62QGMP6ZGO47TPITX/action/author_attestation","sign_citation":"https://pith.science/pith/Y5GZEXSAM62QGMP6ZGO47TPITX/action/citation_signature","submit_replication":"https://pith.science/pith/Y5GZEXSAM62QGMP6ZGO47TPITX/action/replication_record"}},"created_at":"2026-05-18T00:28:08.728474+00:00","updated_at":"2026-05-18T00:28:08.728474+00:00"}