{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2TZZ2GFTLFV46QG34GZXGX2QHC","short_pith_number":"pith:2TZZ2GFT","schema_version":"1.0","canonical_sha256":"d4f39d18b3596bcf40dbe1b3735f5038be6bf390fe430733c69d3acb8feab533","source":{"kind":"arxiv","id":"1608.04812","version":2},"attestation_state":"computed","paper":{"title":"Monotone Paths in Geometric Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Adrian Dumitrescu, Csaba D. T\\'oth, Ritankar Mandal","submitted_at":"2016-08-16T23:51:56Z","abstract_excerpt":"(I) We prove that the (maximum) number of monotone paths in a geometric triangulation of $n$ points in the plane is $O(1.7864^n)$. This improves an earlier upper bound of $O(1.8393^n)$; the current best lower bound is $\\Omega(1.7003^n)$.\n  (II) Given a planar geometric graph $G$ with $n$ vertices, we show that the number of monotone paths in $G$ can be computed in $O(n^2)$ time."},"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":"1608.04812","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-16T23:51:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"eab158329149dd46928e64c48610f327f5e58dab89db4512ee2b1f698b6d60a6","abstract_canon_sha256":"9a143b0cd98c74bc0abd13b1435b968254a2c8922cc1118e8604f2bd1d0034ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:17.548489Z","signature_b64":"LbHmbHTqtHlzVKkFY4uWbtRXUsauDcwULOifcuFJYfBFz7WmL6xDHezTcnRBoK6bfmmKOKb2oJQlPC0RrxftCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4f39d18b3596bcf40dbe1b3735f5038be6bf390fe430733c69d3acb8feab533","last_reissued_at":"2026-05-18T01:03:17.547970Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:17.547970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monotone Paths in Geometric Triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Adrian Dumitrescu, Csaba D. T\\'oth, Ritankar Mandal","submitted_at":"2016-08-16T23:51:56Z","abstract_excerpt":"(I) We prove that the (maximum) number of monotone paths in a geometric triangulation of $n$ points in the plane is $O(1.7864^n)$. This improves an earlier upper bound of $O(1.8393^n)$; the current best lower bound is $\\Omega(1.7003^n)$.\n  (II) Given a planar geometric graph $G$ with $n$ vertices, we show that the number of monotone paths in $G$ can be computed in $O(n^2)$ time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04812","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":"1608.04812","created_at":"2026-05-18T01:03:17.548047+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.04812v2","created_at":"2026-05-18T01:03:17.548047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04812","created_at":"2026-05-18T01:03:17.548047+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TZZ2GFTLFV4","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TZZ2GFTLFV46QG3","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TZZ2GFT","created_at":"2026-05-18T12:29:55.572404+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/2TZZ2GFTLFV46QG34GZXGX2QHC","json":"https://pith.science/pith/2TZZ2GFTLFV46QG34GZXGX2QHC.json","graph_json":"https://pith.science/api/pith-number/2TZZ2GFTLFV46QG34GZXGX2QHC/graph.json","events_json":"https://pith.science/api/pith-number/2TZZ2GFTLFV46QG34GZXGX2QHC/events.json","paper":"https://pith.science/paper/2TZZ2GFT"},"agent_actions":{"view_html":"https://pith.science/pith/2TZZ2GFTLFV46QG34GZXGX2QHC","download_json":"https://pith.science/pith/2TZZ2GFTLFV46QG34GZXGX2QHC.json","view_paper":"https://pith.science/paper/2TZZ2GFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.04812&json=true","fetch_graph":"https://pith.science/api/pith-number/2TZZ2GFTLFV46QG34GZXGX2QHC/graph.json","fetch_events":"https://pith.science/api/pith-number/2TZZ2GFTLFV46QG34GZXGX2QHC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TZZ2GFTLFV46QG34GZXGX2QHC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TZZ2GFTLFV46QG34GZXGX2QHC/action/storage_attestation","attest_author":"https://pith.science/pith/2TZZ2GFTLFV46QG34GZXGX2QHC/action/author_attestation","sign_citation":"https://pith.science/pith/2TZZ2GFTLFV46QG34GZXGX2QHC/action/citation_signature","submit_replication":"https://pith.science/pith/2TZZ2GFTLFV46QG34GZXGX2QHC/action/replication_record"}},"created_at":"2026-05-18T01:03:17.548047+00:00","updated_at":"2026-05-18T01:03:17.548047+00:00"}