{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WMRHJ2VWPCK7O42DA7B4DIVU6L","short_pith_number":"pith:WMRHJ2VW","schema_version":"1.0","canonical_sha256":"b32274eab67895f7734307c3c1a2b4f2d4ad08ec1096bc19cbe1ab6588090233","source":{"kind":"arxiv","id":"1607.00476","version":3},"attestation_state":"computed","paper":{"title":"Equimatchable Claw-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Didem G\\\"oz\\\"upek, Hadi Alizadeh, Mordechai Shalom, Saieed Akbari, T{\\i}naz Ekim","submitted_at":"2016-07-02T07:52:52Z","abstract_excerpt":"A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide, to the best of our knowledge, the first characterization of claw-free equimatchable graphs by identifying the equimatchable claw-free graph families. This characterization implies an efficient recognition algorithm."},"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":"1607.00476","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-02T07:52:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f8de59e8d2cc320d56e5fbb15a9992e2e4c0ea2f22bcddacb691a97b5ef658b1","abstract_canon_sha256":"92e91a0c6be2bb4e74e4abecd86c6c160aa04d196199796f7713934c53ea63ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:53.348097Z","signature_b64":"k/LM+A7uz4cqiHWhcBC4GrTfmEsUB+72C3/y5HJrs0XMt9IPcI3V8UKnuiJRbuH8MiZ9mP1Tk9BUJCOJP0b6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b32274eab67895f7734307c3c1a2b4f2d4ad08ec1096bc19cbe1ab6588090233","last_reissued_at":"2026-05-18T00:09:53.347389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:53.347389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equimatchable Claw-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Didem G\\\"oz\\\"upek, Hadi Alizadeh, Mordechai Shalom, Saieed Akbari, T{\\i}naz Ekim","submitted_at":"2016-07-02T07:52:52Z","abstract_excerpt":"A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide, to the best of our knowledge, the first characterization of claw-free equimatchable graphs by identifying the equimatchable claw-free graph families. This characterization implies an efficient recognition algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00476","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.00476","created_at":"2026-05-18T00:09:53.347494+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.00476v3","created_at":"2026-05-18T00:09:53.347494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00476","created_at":"2026-05-18T00:09:53.347494+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMRHJ2VWPCK7","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMRHJ2VWPCK7O42D","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMRHJ2VW","created_at":"2026-05-18T12:30:48.956258+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/WMRHJ2VWPCK7O42DA7B4DIVU6L","json":"https://pith.science/pith/WMRHJ2VWPCK7O42DA7B4DIVU6L.json","graph_json":"https://pith.science/api/pith-number/WMRHJ2VWPCK7O42DA7B4DIVU6L/graph.json","events_json":"https://pith.science/api/pith-number/WMRHJ2VWPCK7O42DA7B4DIVU6L/events.json","paper":"https://pith.science/paper/WMRHJ2VW"},"agent_actions":{"view_html":"https://pith.science/pith/WMRHJ2VWPCK7O42DA7B4DIVU6L","download_json":"https://pith.science/pith/WMRHJ2VWPCK7O42DA7B4DIVU6L.json","view_paper":"https://pith.science/paper/WMRHJ2VW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.00476&json=true","fetch_graph":"https://pith.science/api/pith-number/WMRHJ2VWPCK7O42DA7B4DIVU6L/graph.json","fetch_events":"https://pith.science/api/pith-number/WMRHJ2VWPCK7O42DA7B4DIVU6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMRHJ2VWPCK7O42DA7B4DIVU6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMRHJ2VWPCK7O42DA7B4DIVU6L/action/storage_attestation","attest_author":"https://pith.science/pith/WMRHJ2VWPCK7O42DA7B4DIVU6L/action/author_attestation","sign_citation":"https://pith.science/pith/WMRHJ2VWPCK7O42DA7B4DIVU6L/action/citation_signature","submit_replication":"https://pith.science/pith/WMRHJ2VWPCK7O42DA7B4DIVU6L/action/replication_record"}},"created_at":"2026-05-18T00:09:53.347494+00:00","updated_at":"2026-05-18T00:09:53.347494+00:00"}