{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AYT7EVRWPHJE62IPTABGDP2YO4","short_pith_number":"pith:AYT7EVRW","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"},"canonical_sha256":"0627f2563679d24f690f980261bf587732b01eb6ca59249559a96aa1886663ae","source":{"kind":"arxiv","id":"1111.2370","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.2370","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"1111.2370v3","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2370","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"AYT7EVRWPHJE","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AYT7EVRWPHJE62IP","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AYT7EVRW","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AYT7EVRWPHJE62IPTABGDP2YO4","target":"record","payload":{"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"},"canonical_sha256":"0627f2563679d24f690f980261bf587732b01eb6ca59249559a96aa1886663ae","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"},"source_kind":"arxiv","source_id":"1111.2370","source_version":3,"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-18T02:21:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KCfE9yzTiOdOkiiHf1CCJqm6Cd2He2vfw4OEfiGivpUaqwWVl8IXsB2MmaGOyQhIradJpFVLwgCTCe5LdWWoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:33:27.362197Z"},"content_sha256":"e7e459b97b78a4e0168cbc6e480bbe4c63c7c41c4af77820144e7d6a385c8d22","schema_version":"1.0","event_id":"sha256:e7e459b97b78a4e0168cbc6e480bbe4c63c7c41c4af77820144e7d6a385c8d22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AYT7EVRWPHJE62IPTABGDP2YO4","target":"graph","payload":{"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"},"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-18T02:21:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yy/ZjGdJ5Wmhsu7ecKk8NYV57clSIEwsKMqYdmRti+YRoxXOKyje8M81/kSac3ITaEPoxpSKuzT4/b1l72BtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:33:27.362591Z"},"content_sha256":"be29581e9d52f36aca39c798b76f14e3729224bd365bf0f82b1660ce67aef245","schema_version":"1.0","event_id":"sha256:be29581e9d52f36aca39c798b76f14e3729224bd365bf0f82b1660ce67aef245"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AYT7EVRWPHJE62IPTABGDP2YO4/bundle.json","state_url":"https://pith.science/pith/AYT7EVRWPHJE62IPTABGDP2YO4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AYT7EVRWPHJE62IPTABGDP2YO4/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-05-26T08:33:27Z","links":{"resolver":"https://pith.science/pith/AYT7EVRWPHJE62IPTABGDP2YO4","bundle":"https://pith.science/pith/AYT7EVRWPHJE62IPTABGDP2YO4/bundle.json","state":"https://pith.science/pith/AYT7EVRWPHJE62IPTABGDP2YO4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AYT7EVRWPHJE62IPTABGDP2YO4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AYT7EVRWPHJE62IPTABGDP2YO4","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":"a3d12438ac4e9542dfc675ea15dce0d3c215f8457f77ab7972a1d40c7d5c7792","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-09T23:57:33Z","title_canon_sha256":"95f233053961f4d344b69efdc3289dc719e617c07c92f97da221f94176ad6542"},"schema_version":"1.0","source":{"id":"1111.2370","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.2370","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"1111.2370v3","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2370","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"AYT7EVRWPHJE","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AYT7EVRWPHJE62IP","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AYT7EVRW","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:be29581e9d52f36aca39c798b76f14e3729224bd365bf0f82b1660ce67aef245","target":"graph","created_at":"2026-05-18T02:21:34Z","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":"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.","authors_text":"David R. Wood, Gwena\\\"el Joret, Vida Dujmovi\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-09T23:57:33Z","title":"An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.2370","kind":"arxiv","version":3},"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:e7e459b97b78a4e0168cbc6e480bbe4c63c7c41c4af77820144e7d6a385c8d22","target":"record","created_at":"2026-05-18T02:21:34Z","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":"a3d12438ac4e9542dfc675ea15dce0d3c215f8457f77ab7972a1d40c7d5c7792","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-09T23:57:33Z","title_canon_sha256":"95f233053961f4d344b69efdc3289dc719e617c07c92f97da221f94176ad6542"},"schema_version":"1.0","source":{"id":"1111.2370","kind":"arxiv","version":3}},"canonical_sha256":"0627f2563679d24f690f980261bf587732b01eb6ca59249559a96aa1886663ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0627f2563679d24f690f980261bf587732b01eb6ca59249559a96aa1886663ae","first_computed_at":"2026-05-18T02:21:34.803811Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:34.803811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cVhFEb7oDDqleNHpxgjWKuZmMO+YVEhtjCY2XQo4q0dSTLNpfcCVIeLHtVDEkHMlQkmthjCoGuOcpPoZgZKJDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:34.804267Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.2370","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7e459b97b78a4e0168cbc6e480bbe4c63c7c41c4af77820144e7d6a385c8d22","sha256:be29581e9d52f36aca39c798b76f14e3729224bd365bf0f82b1660ce67aef245"],"state_sha256":"f2988aadd1affd100d5afdf5052f5efbe5f1e0d119edf202cbbfc7d85c038fd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CaXhmLwDkpTMb5urAGx1IfSxFzIDH4hK+c/Qvl5EHhvDA7iy5i8ahRbXh1wypSMCwENukVMr5FuZTKnE/Vt9Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:33:27.365265Z","bundle_sha256":"e802f18c3d20d347d405c8fc94e6e2bd95ba0078207fbd8c9479bad29d3b6087"}}