{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:L7FTIV3WISJCE6OY5HEN4SAZJU","short_pith_number":"pith:L7FTIV3W","canonical_record":{"source":{"id":"1202.4504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-21T01:28:05Z","cross_cats_sorted":[],"title_canon_sha256":"8b5c619565add111a638f143cc0c4eb135b7a8d48e3f9fabdc4ba44fa0f489ae","abstract_canon_sha256":"ea6da5e30e4d30c96b996c9c7956d8e59f26aee2819af0c9c00f67f4be77fbe1"},"schema_version":"1.0"},"canonical_sha256":"5fcb34577644922279d8e9c8de48194d12f4272bb4ef3501909accc1a40f12ac","source":{"kind":"arxiv","id":"1202.4504","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4504","created_at":"2026-05-18T04:01:50Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4504v1","created_at":"2026-05-18T04:01:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4504","created_at":"2026-05-18T04:01:50Z"},{"alias_kind":"pith_short_12","alias_value":"L7FTIV3WISJC","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L7FTIV3WISJCE6OY","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L7FTIV3W","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:L7FTIV3WISJCE6OY5HEN4SAZJU","target":"record","payload":{"canonical_record":{"source":{"id":"1202.4504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-21T01:28:05Z","cross_cats_sorted":[],"title_canon_sha256":"8b5c619565add111a638f143cc0c4eb135b7a8d48e3f9fabdc4ba44fa0f489ae","abstract_canon_sha256":"ea6da5e30e4d30c96b996c9c7956d8e59f26aee2819af0c9c00f67f4be77fbe1"},"schema_version":"1.0"},"canonical_sha256":"5fcb34577644922279d8e9c8de48194d12f4272bb4ef3501909accc1a40f12ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:50.497087Z","signature_b64":"8h45gC2ore9HKBosWc01XBuFG3SLF21FCE4hpnJeZD8mT9XD5Xc2pRU5d0OnE59VolDPQcEtoFqPFXIInYPHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fcb34577644922279d8e9c8de48194d12f4272bb4ef3501909accc1a40f12ac","last_reissued_at":"2026-05-18T04:01:50.496604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:50.496604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.4504","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:01:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rDnM3t2reN+iQWqb8pIVUkuLiA/hXcA4ugmCkAk1bFE2vr67jfiCy7D/6lu60oCSWS/63QBUkq49suqcUI1gCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:21:09.181149Z"},"content_sha256":"4b95d5fec6931a43631407b915627050ce694e45c17cf775b3c8b0cd9b8038ee","schema_version":"1.0","event_id":"sha256:4b95d5fec6931a43631407b915627050ce694e45c17cf775b3c8b0cd9b8038ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:L7FTIV3WISJCE6OY5HEN4SAZJU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Constant Factor Approximation Algorithm for Reordering Buffer Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Noa Avigdor-Elgrabli, Yuval Rabani","submitted_at":"2012-02-21T01:28:05Z","abstract_excerpt":"In the reordering buffer management problem (RBM) a sequence of $n$ colored items enters a buffer with limited capacity $k$. When the buffer is full, one item is removed to the output sequence, making room for the next input item. This step is repeated until the input sequence is exhausted and the buffer is empty. The objective is to find a sequence of removals that minimizes the total number of color changes in the output sequence. The problem formalizes numerous applications in computer and production systems, and is known to be NP-hard.\n  We give the first constant factor approximation guar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4504","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:01:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lYmCmJwUilwFLb1Rsi/iTRhGuIknK7fhHMUjwK5KGisGigFJeYBwx6+stEbuqdZDnCY4rPjdGmrk8jdQi948CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:21:09.181502Z"},"content_sha256":"2187f3c2074310bca545ff6ec0d9d7fee489b59c554935ee924ccec3db89335f","schema_version":"1.0","event_id":"sha256:2187f3c2074310bca545ff6ec0d9d7fee489b59c554935ee924ccec3db89335f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7FTIV3WISJCE6OY5HEN4SAZJU/bundle.json","state_url":"https://pith.science/pith/L7FTIV3WISJCE6OY5HEN4SAZJU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7FTIV3WISJCE6OY5HEN4SAZJU/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-02T11:21:09Z","links":{"resolver":"https://pith.science/pith/L7FTIV3WISJCE6OY5HEN4SAZJU","bundle":"https://pith.science/pith/L7FTIV3WISJCE6OY5HEN4SAZJU/bundle.json","state":"https://pith.science/pith/L7FTIV3WISJCE6OY5HEN4SAZJU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7FTIV3WISJCE6OY5HEN4SAZJU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:L7FTIV3WISJCE6OY5HEN4SAZJU","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":"ea6da5e30e4d30c96b996c9c7956d8e59f26aee2819af0c9c00f67f4be77fbe1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-21T01:28:05Z","title_canon_sha256":"8b5c619565add111a638f143cc0c4eb135b7a8d48e3f9fabdc4ba44fa0f489ae"},"schema_version":"1.0","source":{"id":"1202.4504","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4504","created_at":"2026-05-18T04:01:50Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4504v1","created_at":"2026-05-18T04:01:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4504","created_at":"2026-05-18T04:01:50Z"},{"alias_kind":"pith_short_12","alias_value":"L7FTIV3WISJC","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L7FTIV3WISJCE6OY","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L7FTIV3W","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:2187f3c2074310bca545ff6ec0d9d7fee489b59c554935ee924ccec3db89335f","target":"graph","created_at":"2026-05-18T04:01:50Z","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":"In the reordering buffer management problem (RBM) a sequence of $n$ colored items enters a buffer with limited capacity $k$. When the buffer is full, one item is removed to the output sequence, making room for the next input item. This step is repeated until the input sequence is exhausted and the buffer is empty. The objective is to find a sequence of removals that minimizes the total number of color changes in the output sequence. The problem formalizes numerous applications in computer and production systems, and is known to be NP-hard.\n  We give the first constant factor approximation guar","authors_text":"Noa Avigdor-Elgrabli, Yuval Rabani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-21T01:28:05Z","title":"A Constant Factor Approximation Algorithm for Reordering Buffer Management"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4504","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:4b95d5fec6931a43631407b915627050ce694e45c17cf775b3c8b0cd9b8038ee","target":"record","created_at":"2026-05-18T04:01:50Z","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":"ea6da5e30e4d30c96b996c9c7956d8e59f26aee2819af0c9c00f67f4be77fbe1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-21T01:28:05Z","title_canon_sha256":"8b5c619565add111a638f143cc0c4eb135b7a8d48e3f9fabdc4ba44fa0f489ae"},"schema_version":"1.0","source":{"id":"1202.4504","kind":"arxiv","version":1}},"canonical_sha256":"5fcb34577644922279d8e9c8de48194d12f4272bb4ef3501909accc1a40f12ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fcb34577644922279d8e9c8de48194d12f4272bb4ef3501909accc1a40f12ac","first_computed_at":"2026-05-18T04:01:50.496604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:50.496604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8h45gC2ore9HKBosWc01XBuFG3SLF21FCE4hpnJeZD8mT9XD5Xc2pRU5d0OnE59VolDPQcEtoFqPFXIInYPHDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:50.497087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.4504","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b95d5fec6931a43631407b915627050ce694e45c17cf775b3c8b0cd9b8038ee","sha256:2187f3c2074310bca545ff6ec0d9d7fee489b59c554935ee924ccec3db89335f"],"state_sha256":"153b1c257012e85775b673df4a2aed4989b8079a43877c59ab4fb562d29fb717"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i/tVq4SIL/MhxV9WeuBi8N++8c27zeH+KA/WlrE2UYu9MsqzXrzAVpAtAaF+39fkv0RaW76MomGM3nW00mc/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:21:09.183376Z","bundle_sha256":"28d35fded42756e1be6460f90c645bdfedaca131d581723804b212affeb002bd"}}