{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2P54YEFZHG4JL2FHFNLPWPILSK","short_pith_number":"pith:2P54YEFZ","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"},"canonical_sha256":"d3fbcc10b939b895e8a72b56fb3d0b928d6f1cee68c2e9b7e7b402c0d2a76c38","source":{"kind":"arxiv","id":"1610.09774","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2P54YEFZHG4JL2FHFNLPWPILSK","target":"record","payload":{"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"},"canonical_sha256":"d3fbcc10b939b895e8a72b56fb3d0b928d6f1cee68c2e9b7e7b402c0d2a76c38","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"},"source_kind":"arxiv","source_id":"1610.09774","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:00:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2vhXF9ZSd8swjt99lCtdOqud0a/i5O5Rr2PjM0tmVOFHUzYd333hJLjA6KYM/T3A69Wvwyk5FygT5RYJNuj8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:23:02.865528Z"},"content_sha256":"151390010710e7c4290294cebd1ce2047429980e74a3d9ac1f7fc4d97042d8e4","schema_version":"1.0","event_id":"sha256:151390010710e7c4290294cebd1ce2047429980e74a3d9ac1f7fc4d97042d8e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2P54YEFZHG4JL2FHFNLPWPILSK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:00:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ppLcr+jgw3L4Fxlw8bkDBF9lfx8U9ZIDsiEEoIHpx2YwUhTShCWkicCV6DEDfLcwfToJENQossBUpR/EsQCoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:23:02.865900Z"},"content_sha256":"8181a7f51c72e424c6b7b5fba2a69c66d661d031ef71698862d6ea5c032ac64a","schema_version":"1.0","event_id":"sha256:8181a7f51c72e424c6b7b5fba2a69c66d661d031ef71698862d6ea5c032ac64a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2P54YEFZHG4JL2FHFNLPWPILSK/bundle.json","state_url":"https://pith.science/pith/2P54YEFZHG4JL2FHFNLPWPILSK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2P54YEFZHG4JL2FHFNLPWPILSK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T23:23:02Z","links":{"resolver":"https://pith.science/pith/2P54YEFZHG4JL2FHFNLPWPILSK","bundle":"https://pith.science/pith/2P54YEFZHG4JL2FHFNLPWPILSK/bundle.json","state":"https://pith.science/pith/2P54YEFZHG4JL2FHFNLPWPILSK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2P54YEFZHG4JL2FHFNLPWPILSK/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wUbgBECJkfQdIKzmCeExliLwVkHDA2+ET8v//iREmSqCZj4X7sdmXj6Gpywg+QE5nZiQM8TcoRIu2JUcK2JyCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:23:02.867881Z","bundle_sha256":"e416157d17f1e23b88e3b1f3ff471cecae1f955c6bb90216608b9b963d2ba706"}}