{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:H5HV6KMFVVALSFWTNFLIRV3LF4","short_pith_number":"pith:H5HV6KMF","schema_version":"1.0","canonical_sha256":"3f4f5f2985ad40b916d3695688d76b2f29e58ef540797ea80cc646fc50684fc2","source":{"kind":"arxiv","id":"2506.08557","version":1},"attestation_state":"computed","paper":{"title":"On the maximal matchings of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kai Deng, Lingjuan Shi, Wei Li","submitted_at":"2025-06-10T08:25:49Z","abstract_excerpt":"An independent edge set of graph $G$ is a matching, and is maximal if it is not a proper subset of any other matching of $G$. The number of all the maximal matchings of $G$ is denoted by $\\Psi(G)$. In this paper, an algorithm to count $\\Psi(T)$ for a tree $T$ is given. We show that for any tree $T$ with $n$ vertices, $\\Psi(T)\\geq\\lceil\\frac{n}{2}\\rceil$, and the tree which obtained the lower bound is characterized."},"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":"2506.08557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-10T08:25:49Z","cross_cats_sorted":[],"title_canon_sha256":"6ebcd199d71bd95a9ebd92391a3c696c25a9140ac8335b10d95f2ce9e025c662","abstract_canon_sha256":"ccee416105c3dc240bfc6348cd4c92387cb9456b3d8ec26abc8b08e1003aa13d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:09.668530Z","signature_b64":"x4mmZchXchPmaloZDIt9xABqJk88XwAc5popVwofNVLYLqKIrerbl5DHRZ72fNHJb60rlpExvnZf774z6/7RDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f4f5f2985ad40b916d3695688d76b2f29e58ef540797ea80cc646fc50684fc2","last_reissued_at":"2026-07-05T11:19:09.668055Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:09.668055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximal matchings of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kai Deng, Lingjuan Shi, Wei Li","submitted_at":"2025-06-10T08:25:49Z","abstract_excerpt":"An independent edge set of graph $G$ is a matching, and is maximal if it is not a proper subset of any other matching of $G$. The number of all the maximal matchings of $G$ is denoted by $\\Psi(G)$. In this paper, an algorithm to count $\\Psi(T)$ for a tree $T$ is given. We show that for any tree $T$ with $n$ vertices, $\\Psi(T)\\geq\\lceil\\frac{n}{2}\\rceil$, and the tree which obtained the lower bound is characterized."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.08557","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.08557/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":"2506.08557","created_at":"2026-07-05T11:19:09.668108+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.08557v1","created_at":"2026-07-05T11:19:09.668108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08557","created_at":"2026-07-05T11:19:09.668108+00:00"},{"alias_kind":"pith_short_12","alias_value":"H5HV6KMFVVAL","created_at":"2026-07-05T11:19:09.668108+00:00"},{"alias_kind":"pith_short_16","alias_value":"H5HV6KMFVVALSFWT","created_at":"2026-07-05T11:19:09.668108+00:00"},{"alias_kind":"pith_short_8","alias_value":"H5HV6KMF","created_at":"2026-07-05T11:19:09.668108+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/H5HV6KMFVVALSFWTNFLIRV3LF4","json":"https://pith.science/pith/H5HV6KMFVVALSFWTNFLIRV3LF4.json","graph_json":"https://pith.science/api/pith-number/H5HV6KMFVVALSFWTNFLIRV3LF4/graph.json","events_json":"https://pith.science/api/pith-number/H5HV6KMFVVALSFWTNFLIRV3LF4/events.json","paper":"https://pith.science/paper/H5HV6KMF"},"agent_actions":{"view_html":"https://pith.science/pith/H5HV6KMFVVALSFWTNFLIRV3LF4","download_json":"https://pith.science/pith/H5HV6KMFVVALSFWTNFLIRV3LF4.json","view_paper":"https://pith.science/paper/H5HV6KMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.08557&json=true","fetch_graph":"https://pith.science/api/pith-number/H5HV6KMFVVALSFWTNFLIRV3LF4/graph.json","fetch_events":"https://pith.science/api/pith-number/H5HV6KMFVVALSFWTNFLIRV3LF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H5HV6KMFVVALSFWTNFLIRV3LF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H5HV6KMFVVALSFWTNFLIRV3LF4/action/storage_attestation","attest_author":"https://pith.science/pith/H5HV6KMFVVALSFWTNFLIRV3LF4/action/author_attestation","sign_citation":"https://pith.science/pith/H5HV6KMFVVALSFWTNFLIRV3LF4/action/citation_signature","submit_replication":"https://pith.science/pith/H5HV6KMFVVALSFWTNFLIRV3LF4/action/replication_record"}},"created_at":"2026-07-05T11:19:09.668108+00:00","updated_at":"2026-07-05T11:19:09.668108+00:00"}