{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DX4SW5NQ4VEQBRGZ53T452VT2K","short_pith_number":"pith:DX4SW5NQ","schema_version":"1.0","canonical_sha256":"1df92b75b0e54900c4d9eee7ceeab3d2a7af9610609e1ed2c6bc05cc0b6b3069","source":{"kind":"arxiv","id":"1512.08853","version":2},"attestation_state":"computed","paper":{"title":"Counting curves on surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.CO","math.MP"],"primary_cat":"math.GT","authors_text":"Daniel V. Mathews, Musashi A. Koyama, Norman Do","submitted_at":"2015-12-30T05:25:11Z","abstract_excerpt":"In this paper we consider an elementary, and largely unexplored, combinatorial problem in low-dimensional topology. Consider a real 2-dimensional compact surface $S$, and fix a number of points $F$ on its boundary. We ask: how many configurations of disjoint arcs are there on $S$ whose boundary is $F$?\n  We find that this enumerative problem, counting curves on surfaces, has a rich structure. For instance, we show that the curve counts obey an effective recursion, in the general framework of topological recursion. Moreover, they exhibit quasi-polynomial behaviour.\n  This \"elementary curve-coun"},"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":"1512.08853","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2015-12-30T05:25:11Z","cross_cats_sorted":["math-ph","math.CO","math.MP"],"title_canon_sha256":"20ba79b5ba71c5be9b7d54271dc497b7c7457615edca91442600c8aa80f9a045","abstract_canon_sha256":"aac645e152c8430b877e473a9f855d2a79e23b1e3744bf14cb2ebcde2f850652"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:41.603486Z","signature_b64":"zXZRLAHX6yF8KFGFXJHTS1ctt4tus52IXL/B6+vlghpGjdk6+AT/FxFXXDB8Fr4gmLzvGTXnloXQP3FRSanNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1df92b75b0e54900c4d9eee7ceeab3d2a7af9610609e1ed2c6bc05cc0b6b3069","last_reissued_at":"2026-05-18T01:21:41.603073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:41.603073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting curves on surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.CO","math.MP"],"primary_cat":"math.GT","authors_text":"Daniel V. Mathews, Musashi A. Koyama, Norman Do","submitted_at":"2015-12-30T05:25:11Z","abstract_excerpt":"In this paper we consider an elementary, and largely unexplored, combinatorial problem in low-dimensional topology. Consider a real 2-dimensional compact surface $S$, and fix a number of points $F$ on its boundary. We ask: how many configurations of disjoint arcs are there on $S$ whose boundary is $F$?\n  We find that this enumerative problem, counting curves on surfaces, has a rich structure. For instance, we show that the curve counts obey an effective recursion, in the general framework of topological recursion. Moreover, they exhibit quasi-polynomial behaviour.\n  This \"elementary curve-coun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08853","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":""},"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":"1512.08853","created_at":"2026-05-18T01:21:41.603134+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.08853v2","created_at":"2026-05-18T01:21:41.603134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08853","created_at":"2026-05-18T01:21:41.603134+00:00"},{"alias_kind":"pith_short_12","alias_value":"DX4SW5NQ4VEQ","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DX4SW5NQ4VEQBRGZ","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DX4SW5NQ","created_at":"2026-05-18T12:29:17.054201+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/DX4SW5NQ4VEQBRGZ53T452VT2K","json":"https://pith.science/pith/DX4SW5NQ4VEQBRGZ53T452VT2K.json","graph_json":"https://pith.science/api/pith-number/DX4SW5NQ4VEQBRGZ53T452VT2K/graph.json","events_json":"https://pith.science/api/pith-number/DX4SW5NQ4VEQBRGZ53T452VT2K/events.json","paper":"https://pith.science/paper/DX4SW5NQ"},"agent_actions":{"view_html":"https://pith.science/pith/DX4SW5NQ4VEQBRGZ53T452VT2K","download_json":"https://pith.science/pith/DX4SW5NQ4VEQBRGZ53T452VT2K.json","view_paper":"https://pith.science/paper/DX4SW5NQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.08853&json=true","fetch_graph":"https://pith.science/api/pith-number/DX4SW5NQ4VEQBRGZ53T452VT2K/graph.json","fetch_events":"https://pith.science/api/pith-number/DX4SW5NQ4VEQBRGZ53T452VT2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DX4SW5NQ4VEQBRGZ53T452VT2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DX4SW5NQ4VEQBRGZ53T452VT2K/action/storage_attestation","attest_author":"https://pith.science/pith/DX4SW5NQ4VEQBRGZ53T452VT2K/action/author_attestation","sign_citation":"https://pith.science/pith/DX4SW5NQ4VEQBRGZ53T452VT2K/action/citation_signature","submit_replication":"https://pith.science/pith/DX4SW5NQ4VEQBRGZ53T452VT2K/action/replication_record"}},"created_at":"2026-05-18T01:21:41.603134+00:00","updated_at":"2026-05-18T01:21:41.603134+00:00"}