{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:KOTTD6SMSQMJFAHTW57UQDD2WR","short_pith_number":"pith:KOTTD6SM","schema_version":"1.0","canonical_sha256":"53a731fa4c94189280f3b77f480c7ab44495fc31e0e997b6b61bfc0ebd974647","source":{"kind":"arxiv","id":"2009.05785","version":1},"attestation_state":"computed","paper":{"title":"Number of Triangulations of a M\\\"obius Strip","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bazier-Matte V\\'eronique, Huang Ruiyan, Luo Hanyi","submitted_at":"2020-09-12T13:15:33Z","abstract_excerpt":"Consider a M\\\"obius strip with $n$ chosen points on its edge. A triangulation is a maximal collection of arcs among these points and cuts the strip into triangles. In this paper, we proved the number of all triangulations that one can obtain from a M\\\"obius strip with $n$ chosen points on its edge is given by $4^{n-1}+\\binom{2n-2}{n-1}$, then we made the connection with the number of clusters in the quasi-cluster algebra arising from the M\\\"obius strip."},"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":"2009.05785","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-09-12T13:15:33Z","cross_cats_sorted":[],"title_canon_sha256":"b38a1e57c0c04ca6fb7347e1393b322f1aceec08b007bcd3b66c723630ccc873","abstract_canon_sha256":"d6fb0cff928a7bd52311800247be123c0141dce9b743dd452f44d294fb2f4141"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:10:16.870185Z","signature_b64":"zNvc6rU02YYhcK7IWP/MzFHt5R9RVy5eds4OzNXdZphoSK4rEScutloZ+gXD4DWjIy39CxIeLzE4H85zZuXCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53a731fa4c94189280f3b77f480c7ab44495fc31e0e997b6b61bfc0ebd974647","last_reissued_at":"2026-07-05T07:10:16.869642Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:10:16.869642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Number of Triangulations of a M\\\"obius Strip","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bazier-Matte V\\'eronique, Huang Ruiyan, Luo Hanyi","submitted_at":"2020-09-12T13:15:33Z","abstract_excerpt":"Consider a M\\\"obius strip with $n$ chosen points on its edge. A triangulation is a maximal collection of arcs among these points and cuts the strip into triangles. In this paper, we proved the number of all triangulations that one can obtain from a M\\\"obius strip with $n$ chosen points on its edge is given by $4^{n-1}+\\binom{2n-2}{n-1}$, then we made the connection with the number of clusters in the quasi-cluster algebra arising from the M\\\"obius strip."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.05785","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/2009.05785/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":"2009.05785","created_at":"2026-07-05T07:10:16.869702+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.05785v1","created_at":"2026-07-05T07:10:16.869702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.05785","created_at":"2026-07-05T07:10:16.869702+00:00"},{"alias_kind":"pith_short_12","alias_value":"KOTTD6SMSQMJ","created_at":"2026-07-05T07:10:16.869702+00:00"},{"alias_kind":"pith_short_16","alias_value":"KOTTD6SMSQMJFAHT","created_at":"2026-07-05T07:10:16.869702+00:00"},{"alias_kind":"pith_short_8","alias_value":"KOTTD6SM","created_at":"2026-07-05T07:10:16.869702+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/KOTTD6SMSQMJFAHTW57UQDD2WR","json":"https://pith.science/pith/KOTTD6SMSQMJFAHTW57UQDD2WR.json","graph_json":"https://pith.science/api/pith-number/KOTTD6SMSQMJFAHTW57UQDD2WR/graph.json","events_json":"https://pith.science/api/pith-number/KOTTD6SMSQMJFAHTW57UQDD2WR/events.json","paper":"https://pith.science/paper/KOTTD6SM"},"agent_actions":{"view_html":"https://pith.science/pith/KOTTD6SMSQMJFAHTW57UQDD2WR","download_json":"https://pith.science/pith/KOTTD6SMSQMJFAHTW57UQDD2WR.json","view_paper":"https://pith.science/paper/KOTTD6SM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.05785&json=true","fetch_graph":"https://pith.science/api/pith-number/KOTTD6SMSQMJFAHTW57UQDD2WR/graph.json","fetch_events":"https://pith.science/api/pith-number/KOTTD6SMSQMJFAHTW57UQDD2WR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KOTTD6SMSQMJFAHTW57UQDD2WR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KOTTD6SMSQMJFAHTW57UQDD2WR/action/storage_attestation","attest_author":"https://pith.science/pith/KOTTD6SMSQMJFAHTW57UQDD2WR/action/author_attestation","sign_citation":"https://pith.science/pith/KOTTD6SMSQMJFAHTW57UQDD2WR/action/citation_signature","submit_replication":"https://pith.science/pith/KOTTD6SMSQMJFAHTW57UQDD2WR/action/replication_record"}},"created_at":"2026-07-05T07:10:16.869702+00:00","updated_at":"2026-07-05T07:10:16.869702+00:00"}