{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FGMVDHBCGAPC47WEAF4DASYAUV","short_pith_number":"pith:FGMVDHBC","schema_version":"1.0","canonical_sha256":"2999519c22301e2e7ec40178304b00a56d75d5513aecd688032f58a967dec148","source":{"kind":"arxiv","id":"1410.3247","version":2},"attestation_state":"computed","paper":{"title":"An easy subexponential bound for online chain partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Bart{\\l}omiej Bosek, Grzegorz Matecki, Hal A. Kierstead, Matthew E. Smith, Tomasz Krawczyk","submitted_at":"2014-10-13T10:13:43Z","abstract_excerpt":"Bosek and Krawczyk exhibited an online algorithm for partitioning an online poset of width $w$ into $w^{14\\lg w}$ chains. We improve this to $w^{6.5 \\lg w + 7}$ with a simpler and shorter proof by combining the work of Bosek & Krawczyk with work of Kierstead & Smith on First-Fit chain partitioning of ladder-free posets. We also provide examples illustrating the limits of our approach."},"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":"1410.3247","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-13T10:13:43Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bfb05f919ec1bbe2675c6b18cf5cbad9f204f0f5eb8de2eb4f5f63134593f54d","abstract_canon_sha256":"1c84045fcb8d23cab2af0d100d081020c22a1b99a7f66a129c7fb4e71949b20e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:32.273161Z","signature_b64":"NVf3j6aPeUY7AabQsEKdSeFF3ExGketJrgH7sOhRJCWVJCCf7wT6yFW1I2Sa2gUvwQ1+RE8VxB3TQyTkvFnGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2999519c22301e2e7ec40178304b00a56d75d5513aecd688032f58a967dec148","last_reissued_at":"2026-05-18T00:18:32.272780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:32.272780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An easy subexponential bound for online chain partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Bart{\\l}omiej Bosek, Grzegorz Matecki, Hal A. Kierstead, Matthew E. Smith, Tomasz Krawczyk","submitted_at":"2014-10-13T10:13:43Z","abstract_excerpt":"Bosek and Krawczyk exhibited an online algorithm for partitioning an online poset of width $w$ into $w^{14\\lg w}$ chains. We improve this to $w^{6.5 \\lg w + 7}$ with a simpler and shorter proof by combining the work of Bosek & Krawczyk with work of Kierstead & Smith on First-Fit chain partitioning of ladder-free posets. We also provide examples illustrating the limits of our approach."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3247","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":"1410.3247","created_at":"2026-05-18T00:18:32.272836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.3247v2","created_at":"2026-05-18T00:18:32.272836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3247","created_at":"2026-05-18T00:18:32.272836+00:00"},{"alias_kind":"pith_short_12","alias_value":"FGMVDHBCGAPC","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FGMVDHBCGAPC47WE","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FGMVDHBC","created_at":"2026-05-18T12:28:28.263976+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/FGMVDHBCGAPC47WEAF4DASYAUV","json":"https://pith.science/pith/FGMVDHBCGAPC47WEAF4DASYAUV.json","graph_json":"https://pith.science/api/pith-number/FGMVDHBCGAPC47WEAF4DASYAUV/graph.json","events_json":"https://pith.science/api/pith-number/FGMVDHBCGAPC47WEAF4DASYAUV/events.json","paper":"https://pith.science/paper/FGMVDHBC"},"agent_actions":{"view_html":"https://pith.science/pith/FGMVDHBCGAPC47WEAF4DASYAUV","download_json":"https://pith.science/pith/FGMVDHBCGAPC47WEAF4DASYAUV.json","view_paper":"https://pith.science/paper/FGMVDHBC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.3247&json=true","fetch_graph":"https://pith.science/api/pith-number/FGMVDHBCGAPC47WEAF4DASYAUV/graph.json","fetch_events":"https://pith.science/api/pith-number/FGMVDHBCGAPC47WEAF4DASYAUV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FGMVDHBCGAPC47WEAF4DASYAUV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FGMVDHBCGAPC47WEAF4DASYAUV/action/storage_attestation","attest_author":"https://pith.science/pith/FGMVDHBCGAPC47WEAF4DASYAUV/action/author_attestation","sign_citation":"https://pith.science/pith/FGMVDHBCGAPC47WEAF4DASYAUV/action/citation_signature","submit_replication":"https://pith.science/pith/FGMVDHBCGAPC47WEAF4DASYAUV/action/replication_record"}},"created_at":"2026-05-18T00:18:32.272836+00:00","updated_at":"2026-05-18T00:18:32.272836+00:00"}