{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2P54YEFZHG4JL2FHFNLPWPILSK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"102524eb43ce10e5a81cd6a0b9a796af0058c7b6669d0a1371c8a1870d7fdc74","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-31T03:28:10Z","title_canon_sha256":"67cce8c4889325778ae7d5b1131cc474b70d0114f2927c90afb983cb11b04882"},"schema_version":"1.0","source":{"id":"1610.09774","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09774","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09774v1","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09774","created_at":"2026-05-18T01:00:47Z"},{"alias_kind":"pith_short_12","alias_value":"2P54YEFZHG4J","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2P54YEFZHG4JL2FH","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2P54YEFZ","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:8181a7f51c72e424c6b7b5fba2a69c66d661d031ef71698862d6ea5c032ac64a","target":"graph","created_at":"2026-05-18T01:00:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Julian Wellman, Seth Pettie","cross_cats":["cs.CG","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-31T03:28:10Z","title":"Lower Bounds on Davenport-Schinzel Sequences via Rectangular Zarankiewicz Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09774","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:151390010710e7c4290294cebd1ce2047429980e74a3d9ac1f7fc4d97042d8e4","target":"record","created_at":"2026-05-18T01:00:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"102524eb43ce10e5a81cd6a0b9a796af0058c7b6669d0a1371c8a1870d7fdc74","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-31T03:28:10Z","title_canon_sha256":"67cce8c4889325778ae7d5b1131cc474b70d0114f2927c90afb983cb11b04882"},"schema_version":"1.0","source":{"id":"1610.09774","kind":"arxiv","version":1}},"canonical_sha256":"d3fbcc10b939b895e8a72b56fb3d0b928d6f1cee68c2e9b7e7b402c0d2a76c38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3fbcc10b939b895e8a72b56fb3d0b928d6f1cee68c2e9b7e7b402c0d2a76c38","first_computed_at":"2026-05-18T01:00:47.211278Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:47.211278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tgrEpllXLDLvyqYvQlVMh+Fd5hjl4jmaj8ZwUcd9dBI2/6TZ3u0Pmy0y9Ddctg+baEUc+r1nZnoeVfyF7nuXCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:47.211745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.09774","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:151390010710e7c4290294cebd1ce2047429980e74a3d9ac1f7fc4d97042d8e4","sha256:8181a7f51c72e424c6b7b5fba2a69c66d661d031ef71698862d6ea5c032ac64a"],"state_sha256":"e5f648f8a3a3981f7e222d4f2782619b35d413bbd3bac406522df31596eeedf7"}