{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ECURCXFSPJOMCRYVCFA2H6RJQX","short_pith_number":"pith:ECURCXFS","canonical_record":{"source":{"id":"1305.0669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-03T10:57:32Z","cross_cats_sorted":[],"title_canon_sha256":"da585c583c81e95d157db3900df26b3e12686dcc6efe8fc8019c0430f029190b","abstract_canon_sha256":"3d51cc544609a6b65f3837561f600e57237529f9f72eadb63c14e395c7d9ad20"},"schema_version":"1.0"},"canonical_sha256":"20a9115cb27a5cc147151141a3fa2985d2c97986b0947feb8059ae583576f491","source":{"kind":"arxiv","id":"1305.0669","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0669","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0669v1","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0669","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"pith_short_12","alias_value":"ECURCXFSPJOM","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ECURCXFSPJOMCRYV","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ECURCXFS","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ECURCXFSPJOMCRYVCFA2H6RJQX","target":"record","payload":{"canonical_record":{"source":{"id":"1305.0669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-03T10:57:32Z","cross_cats_sorted":[],"title_canon_sha256":"da585c583c81e95d157db3900df26b3e12686dcc6efe8fc8019c0430f029190b","abstract_canon_sha256":"3d51cc544609a6b65f3837561f600e57237529f9f72eadb63c14e395c7d9ad20"},"schema_version":"1.0"},"canonical_sha256":"20a9115cb27a5cc147151141a3fa2985d2c97986b0947feb8059ae583576f491","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:33.098663Z","signature_b64":"s/40+ihtkbqdI8wJzF5yQn4Lw6YRsp+6CPgG6zr4oeEwRHR6yG6UNYoTklL1F5ZYlECO9EWenct3s/ym26WzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20a9115cb27a5cc147151141a3fa2985d2c97986b0947feb8059ae583576f491","last_reissued_at":"2026-05-18T03:26:33.098172Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:33.098172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.0669","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-18T03:26:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sCqU4a0Ohlv7vx3YzBbf1guX+46ADZgWN7oIEDcGlbJIZ9xECfcQHQ83kAxglwWekvqS+qr5msQmA6RMVieLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:11:21.652866Z"},"content_sha256":"9b61b9ba70a66f60542889fdbe09f17240400ea07915c39239426f4a3ba575ca","schema_version":"1.0","event_id":"sha256:9b61b9ba70a66f60542889fdbe09f17240400ea07915c39239426f4a3ba575ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ECURCXFSPJOMCRYVCFA2H6RJQX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relative Interval Analysis of Paging Algorithms on Access Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Joan Boyar, Kim S. Larsen, Sushmita Gupta","submitted_at":"2013-05-03T10:57:32Z","abstract_excerpt":"Access graphs, which have been used previously in connection with competitive analysis and relative worst order analysis to model locality of reference in paging, are considered in connection with relative interval analysis. The algorithms LRU, FIFO, FWF, and FAR are compared using the path, star, and cycle access graphs. In this model, some of the expected results are obtained. However, although LRU is found to be strictly better than FIFO on paths, it has worse performance on stars, cycles, and complete graphs, in this model. We solve an open question from [Dorrigiv, Lopez-Ortiz, Munro, 2009"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0669","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-18T03:26:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1iTpp+ILSic+2Ci3OxJKUQt5ZvWK63saJXLGzSk9cCUQNWRDkEY6nZm3JF0VxkqSCRaUwxRWEfC+ZSc70vZdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:11:21.653532Z"},"content_sha256":"5309781bd267a0c057aa08670ff8e46d75afc7a6e174c578c2047543e557293c","schema_version":"1.0","event_id":"sha256:5309781bd267a0c057aa08670ff8e46d75afc7a6e174c578c2047543e557293c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ECURCXFSPJOMCRYVCFA2H6RJQX/bundle.json","state_url":"https://pith.science/pith/ECURCXFSPJOMCRYVCFA2H6RJQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ECURCXFSPJOMCRYVCFA2H6RJQX/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-22T11:11:21Z","links":{"resolver":"https://pith.science/pith/ECURCXFSPJOMCRYVCFA2H6RJQX","bundle":"https://pith.science/pith/ECURCXFSPJOMCRYVCFA2H6RJQX/bundle.json","state":"https://pith.science/pith/ECURCXFSPJOMCRYVCFA2H6RJQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ECURCXFSPJOMCRYVCFA2H6RJQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ECURCXFSPJOMCRYVCFA2H6RJQX","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":"3d51cc544609a6b65f3837561f600e57237529f9f72eadb63c14e395c7d9ad20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-03T10:57:32Z","title_canon_sha256":"da585c583c81e95d157db3900df26b3e12686dcc6efe8fc8019c0430f029190b"},"schema_version":"1.0","source":{"id":"1305.0669","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0669","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0669v1","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0669","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"pith_short_12","alias_value":"ECURCXFSPJOM","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ECURCXFSPJOMCRYV","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ECURCXFS","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:5309781bd267a0c057aa08670ff8e46d75afc7a6e174c578c2047543e557293c","target":"graph","created_at":"2026-05-18T03:26: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":"Access graphs, which have been used previously in connection with competitive analysis and relative worst order analysis to model locality of reference in paging, are considered in connection with relative interval analysis. The algorithms LRU, FIFO, FWF, and FAR are compared using the path, star, and cycle access graphs. In this model, some of the expected results are obtained. However, although LRU is found to be strictly better than FIFO on paths, it has worse performance on stars, cycles, and complete graphs, in this model. We solve an open question from [Dorrigiv, Lopez-Ortiz, Munro, 2009","authors_text":"Joan Boyar, Kim S. Larsen, Sushmita Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-03T10:57:32Z","title":"Relative Interval Analysis of Paging Algorithms on Access Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0669","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:9b61b9ba70a66f60542889fdbe09f17240400ea07915c39239426f4a3ba575ca","target":"record","created_at":"2026-05-18T03:26: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":"3d51cc544609a6b65f3837561f600e57237529f9f72eadb63c14e395c7d9ad20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-03T10:57:32Z","title_canon_sha256":"da585c583c81e95d157db3900df26b3e12686dcc6efe8fc8019c0430f029190b"},"schema_version":"1.0","source":{"id":"1305.0669","kind":"arxiv","version":1}},"canonical_sha256":"20a9115cb27a5cc147151141a3fa2985d2c97986b0947feb8059ae583576f491","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20a9115cb27a5cc147151141a3fa2985d2c97986b0947feb8059ae583576f491","first_computed_at":"2026-05-18T03:26:33.098172Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:33.098172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s/40+ihtkbqdI8wJzF5yQn4Lw6YRsp+6CPgG6zr4oeEwRHR6yG6UNYoTklL1F5ZYlECO9EWenct3s/ym26WzBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:33.098663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0669","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b61b9ba70a66f60542889fdbe09f17240400ea07915c39239426f4a3ba575ca","sha256:5309781bd267a0c057aa08670ff8e46d75afc7a6e174c578c2047543e557293c"],"state_sha256":"9e4e204927973af32695e4cfd4c410f50ccc8ac4b8946c1312b1141328cede90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qqoiX8etv0QB3tdfWaEEPWXhSVaDbyOlbJtJBSSYba9OShd9sIyNt2aqApS464UtM56B6jnmpJtdoAXpLeG2CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T11:11:21.655383Z","bundle_sha256":"1504dfb5244e54cbca2587ec246e01d0465e48c42aabd94d8e42219fc02515ec"}}