{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:X2LP6JSNFLB3VVLM42TCJW2LK7","short_pith_number":"pith:X2LP6JSN","schema_version":"1.0","canonical_sha256":"be96ff264d2ac3bad56ce6a624db4b57d5bd984e5a66e4e4f8739111d30fe14a","source":{"kind":"arxiv","id":"1711.00895","version":2},"attestation_state":"computed","paper":{"title":"Intersections of multicurves from Dynnikov coordinates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"S. \\\"Oyk\\\"u Yurttas, Toby Hall","submitted_at":"2017-11-02T19:14:10Z","abstract_excerpt":"We present an algorithm for calculating the geometric intersection number of two multicurves on the $n$-punctured disk, taking as input their Dynnikov coordinates. The algorithm has complexity $O(m^2n^4)$, where $m$ is the sum of the absolute values of the Dynnikov coordinates of the two multicurves. The main ingredient is an algorithm due to Cumplido for relaxing a multicurve."},"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":"1711.00895","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-11-02T19:14:10Z","cross_cats_sorted":[],"title_canon_sha256":"a09f3ab839828f1edf777c42a3f7e3bcd1e68f4d6b5a7fdcae9cf5bfea7ffbf0","abstract_canon_sha256":"5c77a186b4ec7961882c9fa1b86f28e804238503928d092bbd46bd2677ae1305"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:51.833089Z","signature_b64":"bEyevRCeRsblg7heZNuEigMVK6bZsxedUVb/8GwZqK3pV9LMWJOPvHwrr/JNOc9ERiVg/f4nWVZ6cfhEtfjZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be96ff264d2ac3bad56ce6a624db4b57d5bd984e5a66e4e4f8739111d30fe14a","last_reissued_at":"2026-05-18T00:28:51.832553Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:51.832553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intersections of multicurves from Dynnikov coordinates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"S. \\\"Oyk\\\"u Yurttas, Toby Hall","submitted_at":"2017-11-02T19:14:10Z","abstract_excerpt":"We present an algorithm for calculating the geometric intersection number of two multicurves on the $n$-punctured disk, taking as input their Dynnikov coordinates. The algorithm has complexity $O(m^2n^4)$, where $m$ is the sum of the absolute values of the Dynnikov coordinates of the two multicurves. The main ingredient is an algorithm due to Cumplido for relaxing a multicurve."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00895","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":"1711.00895","created_at":"2026-05-18T00:28:51.832628+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00895v2","created_at":"2026-05-18T00:28:51.832628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00895","created_at":"2026-05-18T00:28:51.832628+00:00"},{"alias_kind":"pith_short_12","alias_value":"X2LP6JSNFLB3","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"X2LP6JSNFLB3VVLM","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"X2LP6JSN","created_at":"2026-05-18T12:31:53.515858+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/X2LP6JSNFLB3VVLM42TCJW2LK7","json":"https://pith.science/pith/X2LP6JSNFLB3VVLM42TCJW2LK7.json","graph_json":"https://pith.science/api/pith-number/X2LP6JSNFLB3VVLM42TCJW2LK7/graph.json","events_json":"https://pith.science/api/pith-number/X2LP6JSNFLB3VVLM42TCJW2LK7/events.json","paper":"https://pith.science/paper/X2LP6JSN"},"agent_actions":{"view_html":"https://pith.science/pith/X2LP6JSNFLB3VVLM42TCJW2LK7","download_json":"https://pith.science/pith/X2LP6JSNFLB3VVLM42TCJW2LK7.json","view_paper":"https://pith.science/paper/X2LP6JSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00895&json=true","fetch_graph":"https://pith.science/api/pith-number/X2LP6JSNFLB3VVLM42TCJW2LK7/graph.json","fetch_events":"https://pith.science/api/pith-number/X2LP6JSNFLB3VVLM42TCJW2LK7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X2LP6JSNFLB3VVLM42TCJW2LK7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X2LP6JSNFLB3VVLM42TCJW2LK7/action/storage_attestation","attest_author":"https://pith.science/pith/X2LP6JSNFLB3VVLM42TCJW2LK7/action/author_attestation","sign_citation":"https://pith.science/pith/X2LP6JSNFLB3VVLM42TCJW2LK7/action/citation_signature","submit_replication":"https://pith.science/pith/X2LP6JSNFLB3VVLM42TCJW2LK7/action/replication_record"}},"created_at":"2026-05-18T00:28:51.832628+00:00","updated_at":"2026-05-18T00:28:51.832628+00:00"}