{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:SZVBCYBFAWRF6YX3W63HNKSUVB","short_pith_number":"pith:SZVBCYBF","schema_version":"1.0","canonical_sha256":"966a11602505a25f62fbb7b676aa54a8526335394d3f9af9dc9f706cd7232f4e","source":{"kind":"arxiv","id":"1006.5704","version":3},"attestation_state":"computed","paper":{"title":"First-Fit is Linear on Posets Excluding Two Long Incomparable Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gwena\\\"el Joret, Kevin G. Milans","submitted_at":"2010-06-29T19:06:41Z","abstract_excerpt":"A poset is (r + s)-free if it does not contain two incomparable chains of size r and s, respectively. We prove that when r and s are at least 2, the First-Fit algorithm partitions every (r + s)-free poset P into at most 8(r-1)(s-1)w chains, where w is the width of P. This solves an open problem of Bosek, Krawczyk, and Szczypka (SIAM J. Discrete Math., 23(4):1992--1999, 2010)."},"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":"1006.5704","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-29T19:06:41Z","cross_cats_sorted":[],"title_canon_sha256":"be524efed77722930028da5e90f0ea0bcf042fb2276817032e18f1259a075102","abstract_canon_sha256":"064d20cf76c5f1bb8b019a535bb8474b478fff43483cf92188967cb7a21213d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:34.896765Z","signature_b64":"ZwTtohr7g2odJNb9vZ3dUktwh30xLxkr34wNnLSDjs0fE0THR7U6v9foa5R8pJtIRstwQZr/bIJRUhr95CyiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"966a11602505a25f62fbb7b676aa54a8526335394d3f9af9dc9f706cd7232f4e","last_reissued_at":"2026-05-18T04:08:34.896293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:34.896293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"First-Fit is Linear on Posets Excluding Two Long Incomparable Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gwena\\\"el Joret, Kevin G. Milans","submitted_at":"2010-06-29T19:06:41Z","abstract_excerpt":"A poset is (r + s)-free if it does not contain two incomparable chains of size r and s, respectively. We prove that when r and s are at least 2, the First-Fit algorithm partitions every (r + s)-free poset P into at most 8(r-1)(s-1)w chains, where w is the width of P. This solves an open problem of Bosek, Krawczyk, and Szczypka (SIAM J. Discrete Math., 23(4):1992--1999, 2010)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.5704","kind":"arxiv","version":3},"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":"1006.5704","created_at":"2026-05-18T04:08:34.896379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.5704v3","created_at":"2026-05-18T04:08:34.896379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.5704","created_at":"2026-05-18T04:08:34.896379+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZVBCYBFAWRF","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZVBCYBFAWRF6YX3","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZVBCYBF","created_at":"2026-05-18T12:26:13.927090+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/SZVBCYBFAWRF6YX3W63HNKSUVB","json":"https://pith.science/pith/SZVBCYBFAWRF6YX3W63HNKSUVB.json","graph_json":"https://pith.science/api/pith-number/SZVBCYBFAWRF6YX3W63HNKSUVB/graph.json","events_json":"https://pith.science/api/pith-number/SZVBCYBFAWRF6YX3W63HNKSUVB/events.json","paper":"https://pith.science/paper/SZVBCYBF"},"agent_actions":{"view_html":"https://pith.science/pith/SZVBCYBFAWRF6YX3W63HNKSUVB","download_json":"https://pith.science/pith/SZVBCYBFAWRF6YX3W63HNKSUVB.json","view_paper":"https://pith.science/paper/SZVBCYBF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.5704&json=true","fetch_graph":"https://pith.science/api/pith-number/SZVBCYBFAWRF6YX3W63HNKSUVB/graph.json","fetch_events":"https://pith.science/api/pith-number/SZVBCYBFAWRF6YX3W63HNKSUVB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZVBCYBFAWRF6YX3W63HNKSUVB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZVBCYBFAWRF6YX3W63HNKSUVB/action/storage_attestation","attest_author":"https://pith.science/pith/SZVBCYBFAWRF6YX3W63HNKSUVB/action/author_attestation","sign_citation":"https://pith.science/pith/SZVBCYBFAWRF6YX3W63HNKSUVB/action/citation_signature","submit_replication":"https://pith.science/pith/SZVBCYBFAWRF6YX3W63HNKSUVB/action/replication_record"}},"created_at":"2026-05-18T04:08:34.896379+00:00","updated_at":"2026-05-18T04:08:34.896379+00:00"}