{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:JPRUFTHANK3ACGUZQBEFAMYWCX","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":"abd82d8fa0f1528edc57d60f35aa7fc45ca07fcea574c9359f5e67d9130104a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-10T10:53:14Z","title_canon_sha256":"fd2054b586265af98689dc24496fb6f8ce2b83b6a696baf5fc2cf9ebb390771e"},"schema_version":"1.0","source":{"id":"2506.08687","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.08687","created_at":"2026-07-05T11:19:11Z"},{"alias_kind":"arxiv_version","alias_value":"2506.08687v1","created_at":"2026-07-05T11:19:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08687","created_at":"2026-07-05T11:19:11Z"},{"alias_kind":"pith_short_12","alias_value":"JPRUFTHANK3A","created_at":"2026-07-05T11:19:11Z"},{"alias_kind":"pith_short_16","alias_value":"JPRUFTHANK3ACGUZ","created_at":"2026-07-05T11:19:11Z"},{"alias_kind":"pith_short_8","alias_value":"JPRUFTHA","created_at":"2026-07-05T11:19:11Z"}],"graph_snapshots":[{"event_id":"sha256:53063d69f19f2fec2c65541a199c1b97b05e3c5d403ae7fa7bff20078a5da348","target":"graph","created_at":"2026-07-05T11:19:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.08687/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A matching of graph $G$ is maximal if it cannot be expanded by adding any edge to create a larger matching. In this paper, for a hexagonal ring $H$ with $n$ hexagons, we show that the number of maximal matchings of $H$ equals to the trace of the product of $n$ matrices, each of which is $S$, $L$, or $R$ according to the type of the connection mode of $H$. Finally, we extend this conclusion to arbitrary polygon rings and provide an algorithm to determine the transition matrices of polygon chains (rings).","authors_text":"Chengqi Li, Jinhui Yin, Lingjuan Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-10T10:53:14Z","title":"The number of maximal matchings in polygon rings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.08687","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:9e0b9ffdbd25635112197e74c6c2bb2d7135664e04fa41bec679529d548cfeb7","target":"record","created_at":"2026-07-05T11:19:11Z","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":"abd82d8fa0f1528edc57d60f35aa7fc45ca07fcea574c9359f5e67d9130104a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-10T10:53:14Z","title_canon_sha256":"fd2054b586265af98689dc24496fb6f8ce2b83b6a696baf5fc2cf9ebb390771e"},"schema_version":"1.0","source":{"id":"2506.08687","kind":"arxiv","version":1}},"canonical_sha256":"4be342cce06ab6011a99804850331615e546799a6a2c79f0ad2d9308d8afb8f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4be342cce06ab6011a99804850331615e546799a6a2c79f0ad2d9308d8afb8f8","first_computed_at":"2026-07-05T11:19:11.895445Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:19:11.895445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H6Va36kgV3cNmjrG/LX0uGr+egH28F7yDd5+Hq5H1pe8GlLiVrygFA6MQsuv42e301l6rNOi06OL0TY10pssAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:19:11.895913Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.08687","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e0b9ffdbd25635112197e74c6c2bb2d7135664e04fa41bec679529d548cfeb7","sha256:53063d69f19f2fec2c65541a199c1b97b05e3c5d403ae7fa7bff20078a5da348"],"state_sha256":"12d290cbf39207ff6e334d50aa8fb14b4988bf8d2c6e7bed9a3433c948de6980"}