{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:AYT7EVRWPHJE62IPTABGDP2YO4","short_pith_number":"pith:AYT7EVRW","schema_version":"1.0","canonical_sha256":"0627f2563679d24f690f980261bf587732b01eb6ca59249559a96aa1886663ae","source":{"kind":"arxiv","id":"1111.2370","version":3},"attestation_state":"computed","paper":{"title":"An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David R. Wood, Gwena\\\"el Joret, Vida Dujmovi\\'c","submitted_at":"2011-11-09T23:57:33Z","abstract_excerpt":"It is known that the First-Fit algorithm for partitioning a poset P into chains uses relatively few chains when P does not have two incomparable chains each of size k. In particular, if P has width w then Bosek, Krawczyk, and Szczypka (SIAM J. Discrete Math., 23(4):1992--1999, 2010) proved an upper bound of ckw^{2} on the number of chains used by First-Fit for some constant c, while Joret and Milans (Order, 28(3):455--464, 2011) gave one of ck^{2}w. In this paper we prove an upper bound of the form ckw. This is best possible up to the value of c."},"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":"1111.2370","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-09T23:57:33Z","cross_cats_sorted":[],"title_canon_sha256":"95f233053961f4d344b69efdc3289dc719e617c07c92f97da221f94176ad6542","abstract_canon_sha256":"a3d12438ac4e9542dfc675ea15dce0d3c215f8457f77ab7972a1d40c7d5c7792"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:34.804267Z","signature_b64":"cVhFEb7oDDqleNHpxgjWKuZmMO+YVEhtjCY2XQo4q0dSTLNpfcCVIeLHtVDEkHMlQkmthjCoGuOcpPoZgZKJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0627f2563679d24f690f980261bf587732b01eb6ca59249559a96aa1886663ae","last_reissued_at":"2026-05-18T02:21:34.803811Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:34.803811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David R. Wood, Gwena\\\"el Joret, Vida Dujmovi\\'c","submitted_at":"2011-11-09T23:57:33Z","abstract_excerpt":"It is known that the First-Fit algorithm for partitioning a poset P into chains uses relatively few chains when P does not have two incomparable chains each of size k. In particular, if P has width w then Bosek, Krawczyk, and Szczypka (SIAM J. Discrete Math., 23(4):1992--1999, 2010) proved an upper bound of ckw^{2} on the number of chains used by First-Fit for some constant c, while Joret and Milans (Order, 28(3):455--464, 2011) gave one of ck^{2}w. In this paper we prove an upper bound of the form ckw. This is best possible up to the value of c."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.2370","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":"1111.2370","created_at":"2026-05-18T02:21:34.803885+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.2370v3","created_at":"2026-05-18T02:21:34.803885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2370","created_at":"2026-05-18T02:21:34.803885+00:00"},{"alias_kind":"pith_short_12","alias_value":"AYT7EVRWPHJE","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"AYT7EVRWPHJE62IP","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"AYT7EVRW","created_at":"2026-05-18T12:26:24.575870+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/AYT7EVRWPHJE62IPTABGDP2YO4","json":"https://pith.science/pith/AYT7EVRWPHJE62IPTABGDP2YO4.json","graph_json":"https://pith.science/api/pith-number/AYT7EVRWPHJE62IPTABGDP2YO4/graph.json","events_json":"https://pith.science/api/pith-number/AYT7EVRWPHJE62IPTABGDP2YO4/events.json","paper":"https://pith.science/paper/AYT7EVRW"},"agent_actions":{"view_html":"https://pith.science/pith/AYT7EVRWPHJE62IPTABGDP2YO4","download_json":"https://pith.science/pith/AYT7EVRWPHJE62IPTABGDP2YO4.json","view_paper":"https://pith.science/paper/AYT7EVRW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.2370&json=true","fetch_graph":"https://pith.science/api/pith-number/AYT7EVRWPHJE62IPTABGDP2YO4/graph.json","fetch_events":"https://pith.science/api/pith-number/AYT7EVRWPHJE62IPTABGDP2YO4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AYT7EVRWPHJE62IPTABGDP2YO4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AYT7EVRWPHJE62IPTABGDP2YO4/action/storage_attestation","attest_author":"https://pith.science/pith/AYT7EVRWPHJE62IPTABGDP2YO4/action/author_attestation","sign_citation":"https://pith.science/pith/AYT7EVRWPHJE62IPTABGDP2YO4/action/citation_signature","submit_replication":"https://pith.science/pith/AYT7EVRWPHJE62IPTABGDP2YO4/action/replication_record"}},"created_at":"2026-05-18T02:21:34.803885+00:00","updated_at":"2026-05-18T02:21:34.803885+00:00"}