{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:W2D3JSRE3FFAEMEPVAXBXIHBKQ","short_pith_number":"pith:W2D3JSRE","canonical_record":{"source":{"id":"1009.4355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-22T13:14:51Z","cross_cats_sorted":[],"title_canon_sha256":"c6f5c2e5cf7cb676d45d9bdc6a1fd245e33622dc18767f82bf294950db85fa7a","abstract_canon_sha256":"b483e20ad16121cbbd2d075e9c656eca2fbf3d48d9f8b69c6c6cee0461b02d95"},"schema_version":"1.0"},"canonical_sha256":"b687b4ca24d94a02308fa82e1ba0e1542335a87ffd6b17cd2d13ecdfe4cdcaa8","source":{"kind":"arxiv","id":"1009.4355","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4355","created_at":"2026-05-18T04:40:33Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4355v1","created_at":"2026-05-18T04:40:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4355","created_at":"2026-05-18T04:40:33Z"},{"alias_kind":"pith_short_12","alias_value":"W2D3JSRE3FFA","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"W2D3JSRE3FFAEMEP","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"W2D3JSRE","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:W2D3JSRE3FFAEMEPVAXBXIHBKQ","target":"record","payload":{"canonical_record":{"source":{"id":"1009.4355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-22T13:14:51Z","cross_cats_sorted":[],"title_canon_sha256":"c6f5c2e5cf7cb676d45d9bdc6a1fd245e33622dc18767f82bf294950db85fa7a","abstract_canon_sha256":"b483e20ad16121cbbd2d075e9c656eca2fbf3d48d9f8b69c6c6cee0461b02d95"},"schema_version":"1.0"},"canonical_sha256":"b687b4ca24d94a02308fa82e1ba0e1542335a87ffd6b17cd2d13ecdfe4cdcaa8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:33.286332Z","signature_b64":"b8Rm5Oti+4Yf37D0zctnB/b52+w/S01EHNYFcF0VXCYVAEuhA0nSAF4k6/RRKR10M5zjhx25dgQ+tSEOndyYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b687b4ca24d94a02308fa82e1ba0e1542335a87ffd6b17cd2d13ecdfe4cdcaa8","last_reissued_at":"2026-05-18T04:40:33.285826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:33.285826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.4355","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-18T04:40:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0MLmx4hadDh+XOacVO9zQ0lIfPW/17xv3+VNOr9cuFRG7pOZAkiVER7FyDeZIwadQGTm50blSF04R1gZ8IzKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:22:56.046573Z"},"content_sha256":"587d889efd6750d8c84e7f67fb8cecc9e3d62484906151d5e3043deff97bb23f","schema_version":"1.0","event_id":"sha256:587d889efd6750d8c84e7f67fb8cecc9e3d62484906151d5e3043deff97bb23f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:W2D3JSRE3FFAEMEPVAXBXIHBKQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Sorting Buffer Problem is NP-hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ho-Leung Chan, Nicole Megow, Rene Sitters, Rob van Stee","submitted_at":"2010-09-22T13:14:51Z","abstract_excerpt":"We consider the offline sorting buffer problem. The input is a sequence of items of different types. All items must be processed one by one by a server. The server is equipped with a random-access buffer of limited capacity which can be used to rearrange items. The problem is to design a scheduling strategy that decides upon the order in which items from the buffer are sent to the server. Each type change incurs unit cost, and thus, the cost minimizing objective is to minimize the total number of type changes for serving the entire sequence. This problem is motivated by various applications in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4355","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-18T04:40:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G6TCXdHxmx1OryBIBdXv5k0KYgFRC3EDr01+eF4D2fgJy54uiw3EEWdmrS6W8wgEPyxe4xGLI3Ujzep5HZT9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:22:56.046908Z"},"content_sha256":"df589ac80c26c4882f72bd593c1ce41e7f143170c81fdb3565d7e38aedc0c6a5","schema_version":"1.0","event_id":"sha256:df589ac80c26c4882f72bd593c1ce41e7f143170c81fdb3565d7e38aedc0c6a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W2D3JSRE3FFAEMEPVAXBXIHBKQ/bundle.json","state_url":"https://pith.science/pith/W2D3JSRE3FFAEMEPVAXBXIHBKQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W2D3JSRE3FFAEMEPVAXBXIHBKQ/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-23T15:22:56Z","links":{"resolver":"https://pith.science/pith/W2D3JSRE3FFAEMEPVAXBXIHBKQ","bundle":"https://pith.science/pith/W2D3JSRE3FFAEMEPVAXBXIHBKQ/bundle.json","state":"https://pith.science/pith/W2D3JSRE3FFAEMEPVAXBXIHBKQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W2D3JSRE3FFAEMEPVAXBXIHBKQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:W2D3JSRE3FFAEMEPVAXBXIHBKQ","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":"b483e20ad16121cbbd2d075e9c656eca2fbf3d48d9f8b69c6c6cee0461b02d95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-22T13:14:51Z","title_canon_sha256":"c6f5c2e5cf7cb676d45d9bdc6a1fd245e33622dc18767f82bf294950db85fa7a"},"schema_version":"1.0","source":{"id":"1009.4355","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4355","created_at":"2026-05-18T04:40:33Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4355v1","created_at":"2026-05-18T04:40:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4355","created_at":"2026-05-18T04:40:33Z"},{"alias_kind":"pith_short_12","alias_value":"W2D3JSRE3FFA","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"W2D3JSRE3FFAEMEP","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"W2D3JSRE","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:df589ac80c26c4882f72bd593c1ce41e7f143170c81fdb3565d7e38aedc0c6a5","target":"graph","created_at":"2026-05-18T04:40:33Z","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":"We consider the offline sorting buffer problem. The input is a sequence of items of different types. All items must be processed one by one by a server. The server is equipped with a random-access buffer of limited capacity which can be used to rearrange items. The problem is to design a scheduling strategy that decides upon the order in which items from the buffer are sent to the server. Each type change incurs unit cost, and thus, the cost minimizing objective is to minimize the total number of type changes for serving the entire sequence. This problem is motivated by various applications in","authors_text":"Ho-Leung Chan, Nicole Megow, Rene Sitters, Rob van Stee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-22T13:14:51Z","title":"The Sorting Buffer Problem is NP-hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4355","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:587d889efd6750d8c84e7f67fb8cecc9e3d62484906151d5e3043deff97bb23f","target":"record","created_at":"2026-05-18T04:40:33Z","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":"b483e20ad16121cbbd2d075e9c656eca2fbf3d48d9f8b69c6c6cee0461b02d95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-22T13:14:51Z","title_canon_sha256":"c6f5c2e5cf7cb676d45d9bdc6a1fd245e33622dc18767f82bf294950db85fa7a"},"schema_version":"1.0","source":{"id":"1009.4355","kind":"arxiv","version":1}},"canonical_sha256":"b687b4ca24d94a02308fa82e1ba0e1542335a87ffd6b17cd2d13ecdfe4cdcaa8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b687b4ca24d94a02308fa82e1ba0e1542335a87ffd6b17cd2d13ecdfe4cdcaa8","first_computed_at":"2026-05-18T04:40:33.285826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:33.285826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b8Rm5Oti+4Yf37D0zctnB/b52+w/S01EHNYFcF0VXCYVAEuhA0nSAF4k6/RRKR10M5zjhx25dgQ+tSEOndyYDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:33.286332Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.4355","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:587d889efd6750d8c84e7f67fb8cecc9e3d62484906151d5e3043deff97bb23f","sha256:df589ac80c26c4882f72bd593c1ce41e7f143170c81fdb3565d7e38aedc0c6a5"],"state_sha256":"c3451d3cc327e59b0076e12bf6d175f08f359e368774fe1bf5efd87bbc391ea3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hNGfPf3e27DYd1j2YHbSXHPZq1jjZ1g4RVNbRbrB885gt8keroS8cjli2gH/z7WAsg2MbmmvOUqIPVwlbWdPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:22:56.048791Z","bundle_sha256":"01c4dfe0a41d559181246a22a9c2f7829660ba782fd47c9b7c2f6fe8e2f4fbea"}}