{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZW3TKVERAFQYPD4CFD5TP4RXUM","short_pith_number":"pith:ZW3TKVER","schema_version":"1.0","canonical_sha256":"cdb73554910161878f8228fb37f237a31b2513df11d01d367a9d1ef88584af7c","source":{"kind":"arxiv","id":"1909.10406","version":2},"attestation_state":"computed","paper":{"title":"2-Matching Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Julianne Vega","submitted_at":"2019-09-23T14:59:42Z","abstract_excerpt":"A $2$-matching complex is a simplicial complex which captures the relationship between $2$-matchings of a graph. In this paper, we will use discrete Morse Theory and the Matching Tree Algorithm to prove homotopical results. We will consider a class of graphs for which the homotopy type of the $2$-matching complex transforms from a sphere to a point with the addition of leaves. We end the paper by defining $k$-matching sequences and looking at the $1$- and $2$-matching complexes of wheel graphs and perfect caterpillar graphs."},"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":"1909.10406","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-09-23T14:59:42Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"d5c3335149324bbff9dcc41406593e13368cc394b4a5e5d4a3ea6b9af1b19e92","abstract_canon_sha256":"251cb12fbefc2cd8f640a1d890ddecd9e8018cc28fc9e41481fb147899da0e43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:10:36.959014Z","signature_b64":"VpkxHHqSHZiEhSGb93awThPN2LiWyo03gRYaQ03fHchCGPElu6ekn+UoLBsgCkt559ial+bhwq23AjMxHH+0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdb73554910161878f8228fb37f237a31b2513df11d01d367a9d1ef88584af7c","last_reissued_at":"2026-07-05T02:10:36.958567Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:10:36.958567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"2-Matching Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Julianne Vega","submitted_at":"2019-09-23T14:59:42Z","abstract_excerpt":"A $2$-matching complex is a simplicial complex which captures the relationship between $2$-matchings of a graph. In this paper, we will use discrete Morse Theory and the Matching Tree Algorithm to prove homotopical results. We will consider a class of graphs for which the homotopy type of the $2$-matching complex transforms from a sphere to a point with the addition of leaves. We end the paper by defining $k$-matching sequences and looking at the $1$- and $2$-matching complexes of wheel graphs and perfect caterpillar graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.10406","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.10406/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1909.10406","created_at":"2026-07-05T02:10:36.958634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.10406v2","created_at":"2026-07-05T02:10:36.958634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.10406","created_at":"2026-07-05T02:10:36.958634+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZW3TKVERAFQY","created_at":"2026-07-05T02:10:36.958634+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZW3TKVERAFQYPD4C","created_at":"2026-07-05T02:10:36.958634+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZW3TKVER","created_at":"2026-07-05T02:10:36.958634+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/ZW3TKVERAFQYPD4CFD5TP4RXUM","json":"https://pith.science/pith/ZW3TKVERAFQYPD4CFD5TP4RXUM.json","graph_json":"https://pith.science/api/pith-number/ZW3TKVERAFQYPD4CFD5TP4RXUM/graph.json","events_json":"https://pith.science/api/pith-number/ZW3TKVERAFQYPD4CFD5TP4RXUM/events.json","paper":"https://pith.science/paper/ZW3TKVER"},"agent_actions":{"view_html":"https://pith.science/pith/ZW3TKVERAFQYPD4CFD5TP4RXUM","download_json":"https://pith.science/pith/ZW3TKVERAFQYPD4CFD5TP4RXUM.json","view_paper":"https://pith.science/paper/ZW3TKVER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.10406&json=true","fetch_graph":"https://pith.science/api/pith-number/ZW3TKVERAFQYPD4CFD5TP4RXUM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZW3TKVERAFQYPD4CFD5TP4RXUM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZW3TKVERAFQYPD4CFD5TP4RXUM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZW3TKVERAFQYPD4CFD5TP4RXUM/action/storage_attestation","attest_author":"https://pith.science/pith/ZW3TKVERAFQYPD4CFD5TP4RXUM/action/author_attestation","sign_citation":"https://pith.science/pith/ZW3TKVERAFQYPD4CFD5TP4RXUM/action/citation_signature","submit_replication":"https://pith.science/pith/ZW3TKVERAFQYPD4CFD5TP4RXUM/action/replication_record"}},"created_at":"2026-07-05T02:10:36.958634+00:00","updated_at":"2026-07-05T02:10:36.958634+00:00"}