{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:I7GKSILDUMRBCHJAWPHAJB2HMC","short_pith_number":"pith:I7GKSILD","schema_version":"1.0","canonical_sha256":"47cca92163a322111d20b3ce04874760b0cc8e4fada18d6404703af0c76ef885","source":{"kind":"arxiv","id":"1204.1086","version":2},"attestation_state":"computed","paper":{"title":"Sharp Bounds on Davenport-Schinzel Sequences of Every Order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DM","authors_text":"Seth Pettie","submitted_at":"2012-04-04T22:24:14Z","abstract_excerpt":"One of the longest-standing open problems in computational geometry is to bound the lower envelope of $n$ univariate functions, each pair of which crosses at most $s$ times, for some fixed $s$. This problem is known to be equivalent to bounding the length of an order-$s$ Davenport-Schinzel sequence, namely a sequence over an $n$-letter alphabet that avoids alternating subsequences of the form $a \\cdots b \\cdots a \\cdots b \\cdots$ with length $s+2$. These sequences were introduced by Davenport and Schinzel in 1965 to model a certain problem in differential equations and have since been applied "},"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":"1204.1086","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-04-04T22:24:14Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"ca6f46b9c634a2db1f59360e4da4b81831aa3268952502e532b59cda3cf44e24","abstract_canon_sha256":"ad5ff373a78ffe7050ec780fb205892020dc9f827fd4dcf4b2c7d5a78edff8c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:25.813216Z","signature_b64":"0NFjJVfiTrtug5UDRRptNfO0Sis/y+Evcybc2dF67eV6Z337rV7duUUosFpHUOj24rjyetxw2xmxYLzJKqvoBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47cca92163a322111d20b3ce04874760b0cc8e4fada18d6404703af0c76ef885","last_reissued_at":"2026-05-18T03:25:25.812578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:25.812578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp Bounds on Davenport-Schinzel Sequences of Every Order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DM","authors_text":"Seth Pettie","submitted_at":"2012-04-04T22:24:14Z","abstract_excerpt":"One of the longest-standing open problems in computational geometry is to bound the lower envelope of $n$ univariate functions, each pair of which crosses at most $s$ times, for some fixed $s$. This problem is known to be equivalent to bounding the length of an order-$s$ Davenport-Schinzel sequence, namely a sequence over an $n$-letter alphabet that avoids alternating subsequences of the form $a \\cdots b \\cdots a \\cdots b \\cdots$ with length $s+2$. These sequences were introduced by Davenport and Schinzel in 1965 to model a certain problem in differential equations and have since been applied "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1086","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":"1204.1086","created_at":"2026-05-18T03:25:25.812698+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.1086v2","created_at":"2026-05-18T03:25:25.812698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1086","created_at":"2026-05-18T03:25:25.812698+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7GKSILDUMRB","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7GKSILDUMRBCHJA","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7GKSILD","created_at":"2026-05-18T12:27:09.501522+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/I7GKSILDUMRBCHJAWPHAJB2HMC","json":"https://pith.science/pith/I7GKSILDUMRBCHJAWPHAJB2HMC.json","graph_json":"https://pith.science/api/pith-number/I7GKSILDUMRBCHJAWPHAJB2HMC/graph.json","events_json":"https://pith.science/api/pith-number/I7GKSILDUMRBCHJAWPHAJB2HMC/events.json","paper":"https://pith.science/paper/I7GKSILD"},"agent_actions":{"view_html":"https://pith.science/pith/I7GKSILDUMRBCHJAWPHAJB2HMC","download_json":"https://pith.science/pith/I7GKSILDUMRBCHJAWPHAJB2HMC.json","view_paper":"https://pith.science/paper/I7GKSILD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.1086&json=true","fetch_graph":"https://pith.science/api/pith-number/I7GKSILDUMRBCHJAWPHAJB2HMC/graph.json","fetch_events":"https://pith.science/api/pith-number/I7GKSILDUMRBCHJAWPHAJB2HMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7GKSILDUMRBCHJAWPHAJB2HMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7GKSILDUMRBCHJAWPHAJB2HMC/action/storage_attestation","attest_author":"https://pith.science/pith/I7GKSILDUMRBCHJAWPHAJB2HMC/action/author_attestation","sign_citation":"https://pith.science/pith/I7GKSILDUMRBCHJAWPHAJB2HMC/action/citation_signature","submit_replication":"https://pith.science/pith/I7GKSILDUMRBCHJAWPHAJB2HMC/action/replication_record"}},"created_at":"2026-05-18T03:25:25.812698+00:00","updated_at":"2026-05-18T03:25:25.812698+00:00"}