{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:VSRTT3HPJVC2JUDF7NHIGVHPKP","short_pith_number":"pith:VSRTT3HP","canonical_record":{"source":{"id":"1109.6643","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-29T19:55:13Z","cross_cats_sorted":[],"title_canon_sha256":"3850974c38fc9ded157e63782c08609eb48402f28f9e3fff2d6e21a57783ac66","abstract_canon_sha256":"8dcb443fe06d2f2badbcb235ef7e3b24dfff24df8a32c0ba39c8771e6175c2bf"},"schema_version":"1.0"},"canonical_sha256":"aca339ecef4d45a4d065fb4e8354ef53cc8d342ea6fac324b4f843be0bc43f56","source":{"kind":"arxiv","id":"1109.6643","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6643","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6643v3","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6643","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"VSRTT3HPJVC2","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VSRTT3HPJVC2JUDF","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VSRTT3HP","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:VSRTT3HPJVC2JUDF7NHIGVHPKP","target":"record","payload":{"canonical_record":{"source":{"id":"1109.6643","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-29T19:55:13Z","cross_cats_sorted":[],"title_canon_sha256":"3850974c38fc9ded157e63782c08609eb48402f28f9e3fff2d6e21a57783ac66","abstract_canon_sha256":"8dcb443fe06d2f2badbcb235ef7e3b24dfff24df8a32c0ba39c8771e6175c2bf"},"schema_version":"1.0"},"canonical_sha256":"aca339ecef4d45a4d065fb4e8354ef53cc8d342ea6fac324b4f843be0bc43f56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:45.000921Z","signature_b64":"NZiM2iurb0Tl+VnqA7U5y4DzcPLr0UONCBX0HFFsi/QEUatj1Y8DQLg0VEWhQJPYWzh2OxAUkGC90g/urmAqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aca339ecef4d45a4d065fb4e8354ef53cc8d342ea6fac324b4f843be0bc43f56","last_reissued_at":"2026-05-18T03:05:45.000428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:45.000428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.6643","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-18T03:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DFEfWiu9u/9LilfCobsamyO8QRurLF6vmVrGrEMm2mTyMoTA3voMUP363TaMkplBuM20dGl/sarOvQ71dIEAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:07:44.360636Z"},"content_sha256":"3ec271b9af7b483ab856461c0aecf2edc819b97c7517e7b5f7092ed87616eeb9","schema_version":"1.0","event_id":"sha256:3ec271b9af7b483ab856461c0aecf2edc819b97c7517e7b5f7092ed87616eeb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:VSRTT3HPJVC2JUDF7NHIGVHPKP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Eviction Policies for Stochastic Address Traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francesco Versaci, Gianfranco Bilardi","submitted_at":"2011-09-29T19:55:13Z","abstract_excerpt":"The eviction problem for memory hierarchies is studied for the Hidden Markov Reference Model (HMRM) of the memory trace, showing how miss minimization can be naturally formulated in the optimal control setting. In addition to the traditional version assuming a buffer of fixed capacity, a relaxed version is also considered, in which buffer occupancy can vary and its average is constrained. Resorting to multiobjective optimization, viewing occupancy as a cost rather than as a constraint, the optimal eviction policy is obtained by composing solutions for the individual addressable items.\n  This a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6643","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-18T03:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qW+2bvxVCbJTIsomKD7waCebv9bVUJL+zYa4Wea32BGHuZsI9P4r6RLwh2TxK0dCpp1kGlNtk6Bryr0dOD1uCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:07:44.361208Z"},"content_sha256":"d8e27d5bf4039f29ade5d8ea49c812ead92c20f8450cbb4b6f467cae04d72a09","schema_version":"1.0","event_id":"sha256:d8e27d5bf4039f29ade5d8ea49c812ead92c20f8450cbb4b6f467cae04d72a09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSRTT3HPJVC2JUDF7NHIGVHPKP/bundle.json","state_url":"https://pith.science/pith/VSRTT3HPJVC2JUDF7NHIGVHPKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSRTT3HPJVC2JUDF7NHIGVHPKP/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-07T08:07:44Z","links":{"resolver":"https://pith.science/pith/VSRTT3HPJVC2JUDF7NHIGVHPKP","bundle":"https://pith.science/pith/VSRTT3HPJVC2JUDF7NHIGVHPKP/bundle.json","state":"https://pith.science/pith/VSRTT3HPJVC2JUDF7NHIGVHPKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSRTT3HPJVC2JUDF7NHIGVHPKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VSRTT3HPJVC2JUDF7NHIGVHPKP","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":"8dcb443fe06d2f2badbcb235ef7e3b24dfff24df8a32c0ba39c8771e6175c2bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-29T19:55:13Z","title_canon_sha256":"3850974c38fc9ded157e63782c08609eb48402f28f9e3fff2d6e21a57783ac66"},"schema_version":"1.0","source":{"id":"1109.6643","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6643","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6643v3","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6643","created_at":"2026-05-18T03:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"VSRTT3HPJVC2","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VSRTT3HPJVC2JUDF","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VSRTT3HP","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:d8e27d5bf4039f29ade5d8ea49c812ead92c20f8450cbb4b6f467cae04d72a09","target":"graph","created_at":"2026-05-18T03:05:45Z","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":"The eviction problem for memory hierarchies is studied for the Hidden Markov Reference Model (HMRM) of the memory trace, showing how miss minimization can be naturally formulated in the optimal control setting. In addition to the traditional version assuming a buffer of fixed capacity, a relaxed version is also considered, in which buffer occupancy can vary and its average is constrained. Resorting to multiobjective optimization, viewing occupancy as a cost rather than as a constraint, the optimal eviction policy is obtained by composing solutions for the individual addressable items.\n  This a","authors_text":"Francesco Versaci, Gianfranco Bilardi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-29T19:55:13Z","title":"Optimal Eviction Policies for Stochastic Address Traces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6643","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:3ec271b9af7b483ab856461c0aecf2edc819b97c7517e7b5f7092ed87616eeb9","target":"record","created_at":"2026-05-18T03:05:45Z","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":"8dcb443fe06d2f2badbcb235ef7e3b24dfff24df8a32c0ba39c8771e6175c2bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-29T19:55:13Z","title_canon_sha256":"3850974c38fc9ded157e63782c08609eb48402f28f9e3fff2d6e21a57783ac66"},"schema_version":"1.0","source":{"id":"1109.6643","kind":"arxiv","version":3}},"canonical_sha256":"aca339ecef4d45a4d065fb4e8354ef53cc8d342ea6fac324b4f843be0bc43f56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aca339ecef4d45a4d065fb4e8354ef53cc8d342ea6fac324b4f843be0bc43f56","first_computed_at":"2026-05-18T03:05:45.000428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:45.000428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NZiM2iurb0Tl+VnqA7U5y4DzcPLr0UONCBX0HFFsi/QEUatj1Y8DQLg0VEWhQJPYWzh2OxAUkGC90g/urmAqDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:45.000921Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.6643","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ec271b9af7b483ab856461c0aecf2edc819b97c7517e7b5f7092ed87616eeb9","sha256:d8e27d5bf4039f29ade5d8ea49c812ead92c20f8450cbb4b6f467cae04d72a09"],"state_sha256":"4967b8d67b030154666ef044951bbe7d12c7d20ae40df428032ac484cd270dbf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gYsF5qsINF6CG8ZYUb+qBHzFXTpp9YRFEeUhUH+WyEfhD+/YUkUv5fTzd9nrIfbj6EBHRBMnM4fFBqL2H8vQBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T08:07:44.364165Z","bundle_sha256":"e57f98ba471490f3d750a400a388df033aa73b958e4aa3aef4d740f2fb42dc16"}}