{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2P54YEFZHG4JL2FHFNLPWPILSK","short_pith_number":"pith:2P54YEFZ","schema_version":"1.0","canonical_sha256":"d3fbcc10b939b895e8a72b56fb3d0b928d6f1cee68c2e9b7e7b402c0d2a76c38","source":{"kind":"arxiv","id":"1610.09774","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds on Davenport-Schinzel Sequences via Rectangular Zarankiewicz Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Julian Wellman, Seth Pettie","submitted_at":"2016-10-31T03:28:10Z","abstract_excerpt":"An order-$s$ Davenport-Schinzel sequence over an $n$-letter alphabet is one avoiding immediate repetitions and alternating subsequences with length $s+2$. The main problem is to determine the maximum length of such a sequence, as a function of $n$ and $s$. When $s$ is fixed this problem has been settled but when $s$ is a function of $n$, very little is known about the extremal function $\\lambda(s,n)$ of such sequences.\n  In this paper we give a new recursive construction of Davenport-Schinzel sequences that is based on dense 0-1 matrices avoiding large all-1 submatrices (aka Zarankiewicz's Pro"},"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":"1610.09774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-31T03:28:10Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"67cce8c4889325778ae7d5b1131cc474b70d0114f2927c90afb983cb11b04882","abstract_canon_sha256":"102524eb43ce10e5a81cd6a0b9a796af0058c7b6669d0a1371c8a1870d7fdc74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:47.211745Z","signature_b64":"tgrEpllXLDLvyqYvQlVMh+Fd5hjl4jmaj8ZwUcd9dBI2/6TZ3u0Pmy0y9Ddctg+baEUc+r1nZnoeVfyF7nuXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3fbcc10b939b895e8a72b56fb3d0b928d6f1cee68c2e9b7e7b402c0d2a76c38","last_reissued_at":"2026-05-18T01:00:47.211278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:47.211278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds on Davenport-Schinzel Sequences via Rectangular Zarankiewicz Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Julian Wellman, Seth Pettie","submitted_at":"2016-10-31T03:28:10Z","abstract_excerpt":"An order-$s$ Davenport-Schinzel sequence over an $n$-letter alphabet is one avoiding immediate repetitions and alternating subsequences with length $s+2$. The main problem is to determine the maximum length of such a sequence, as a function of $n$ and $s$. When $s$ is fixed this problem has been settled but when $s$ is a function of $n$, very little is known about the extremal function $\\lambda(s,n)$ of such sequences.\n  In this paper we give a new recursive construction of Davenport-Schinzel sequences that is based on dense 0-1 matrices avoiding large all-1 submatrices (aka Zarankiewicz's Pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09774","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":""},"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":"1610.09774","created_at":"2026-05-18T01:00:47.211368+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.09774v1","created_at":"2026-05-18T01:00:47.211368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09774","created_at":"2026-05-18T01:00:47.211368+00:00"},{"alias_kind":"pith_short_12","alias_value":"2P54YEFZHG4J","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2P54YEFZHG4JL2FH","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2P54YEFZ","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/2P54YEFZHG4JL2FHFNLPWPILSK","json":"https://pith.science/pith/2P54YEFZHG4JL2FHFNLPWPILSK.json","graph_json":"https://pith.science/api/pith-number/2P54YEFZHG4JL2FHFNLPWPILSK/graph.json","events_json":"https://pith.science/api/pith-number/2P54YEFZHG4JL2FHFNLPWPILSK/events.json","paper":"https://pith.science/paper/2P54YEFZ"},"agent_actions":{"view_html":"https://pith.science/pith/2P54YEFZHG4JL2FHFNLPWPILSK","download_json":"https://pith.science/pith/2P54YEFZHG4JL2FHFNLPWPILSK.json","view_paper":"https://pith.science/paper/2P54YEFZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.09774&json=true","fetch_graph":"https://pith.science/api/pith-number/2P54YEFZHG4JL2FHFNLPWPILSK/graph.json","fetch_events":"https://pith.science/api/pith-number/2P54YEFZHG4JL2FHFNLPWPILSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2P54YEFZHG4JL2FHFNLPWPILSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2P54YEFZHG4JL2FHFNLPWPILSK/action/storage_attestation","attest_author":"https://pith.science/pith/2P54YEFZHG4JL2FHFNLPWPILSK/action/author_attestation","sign_citation":"https://pith.science/pith/2P54YEFZHG4JL2FHFNLPWPILSK/action/citation_signature","submit_replication":"https://pith.science/pith/2P54YEFZHG4JL2FHFNLPWPILSK/action/replication_record"}},"created_at":"2026-05-18T01:00:47.211368+00:00","updated_at":"2026-05-18T01:00:47.211368+00:00"}