{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XIFRXEWPJX74EYWGYLEUZGLGIN","short_pith_number":"pith:XIFRXEWP","schema_version":"1.0","canonical_sha256":"ba0b1b92cf4dffc262c6c2c94c9966435352760f032b5604ec10cf702b79793c","source":{"kind":"arxiv","id":"2504.18714","version":1},"attestation_state":"computed","paper":{"title":"From Good to Great: Improving Memory Tiering Performance Through Parameter Tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Fanchao Chen, Konstantinos Kanellis, Michael Swift, Shivaram Venkataraman, Sujay Yadalam","submitted_at":"2025-04-25T21:56:15Z","abstract_excerpt":"Memory tiering systems achieve memory scaling by adding multiple tiers of memory wherein different tiers have different access latencies and bandwidth. For maximum performance, frequently accessed (hot) data must be placed close to the host in faster tiers and infrequently accessed (cold) data can be placed in farther slower memory tiers. Existing tiering solutions employ heuristics and pre-configured thresholds to make data placement and migration decisions. Unfortunately, these systems fail to adapt to different workloads and the underlying hardware, so perform sub-optimally.\n  In this paper"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2504.18714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2025-04-25T21:56:15Z","cross_cats_sorted":[],"title_canon_sha256":"fa78b8b9dec9776dab0ab6be1b45fee813ecdde414993844c2ff9b873d2f944e","abstract_canon_sha256":"4d3b5a03e3db267fe88ea68cf2bcc436cfcaaa86e06174e05b627a821767c43a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:54:19.668002Z","signature_b64":"dQfNJ/nF87D/FyZKxjhDtNMBEYjzutlrA59a/T4iiW98QhZego+N+jlRize9V23Y7abWxDTA5ghM+feNGgT2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba0b1b92cf4dffc262c6c2c94c9966435352760f032b5604ec10cf702b79793c","last_reissued_at":"2026-07-05T10:54:19.667492Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:54:19.667492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Good to Great: Improving Memory Tiering Performance Through Parameter Tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Fanchao Chen, Konstantinos Kanellis, Michael Swift, Shivaram Venkataraman, Sujay Yadalam","submitted_at":"2025-04-25T21:56:15Z","abstract_excerpt":"Memory tiering systems achieve memory scaling by adding multiple tiers of memory wherein different tiers have different access latencies and bandwidth. For maximum performance, frequently accessed (hot) data must be placed close to the host in faster tiers and infrequently accessed (cold) data can be placed in farther slower memory tiers. Existing tiering solutions employ heuristics and pre-configured thresholds to make data placement and migration decisions. Unfortunately, these systems fail to adapt to different workloads and the underlying hardware, so perform sub-optimally.\n  In this paper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.18714","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.18714/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2504.18714","created_at":"2026-07-05T10:54:19.667561+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.18714v1","created_at":"2026-07-05T10:54:19.667561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.18714","created_at":"2026-07-05T10:54:19.667561+00:00"},{"alias_kind":"pith_short_12","alias_value":"XIFRXEWPJX74","created_at":"2026-07-05T10:54:19.667561+00:00"},{"alias_kind":"pith_short_16","alias_value":"XIFRXEWPJX74EYWG","created_at":"2026-07-05T10:54:19.667561+00:00"},{"alias_kind":"pith_short_8","alias_value":"XIFRXEWP","created_at":"2026-07-05T10:54:19.667561+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XIFRXEWPJX74EYWGYLEUZGLGIN","json":"https://pith.science/pith/XIFRXEWPJX74EYWGYLEUZGLGIN.json","graph_json":"https://pith.science/api/pith-number/XIFRXEWPJX74EYWGYLEUZGLGIN/graph.json","events_json":"https://pith.science/api/pith-number/XIFRXEWPJX74EYWGYLEUZGLGIN/events.json","paper":"https://pith.science/paper/XIFRXEWP"},"agent_actions":{"view_html":"https://pith.science/pith/XIFRXEWPJX74EYWGYLEUZGLGIN","download_json":"https://pith.science/pith/XIFRXEWPJX74EYWGYLEUZGLGIN.json","view_paper":"https://pith.science/paper/XIFRXEWP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.18714&json=true","fetch_graph":"https://pith.science/api/pith-number/XIFRXEWPJX74EYWGYLEUZGLGIN/graph.json","fetch_events":"https://pith.science/api/pith-number/XIFRXEWPJX74EYWGYLEUZGLGIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XIFRXEWPJX74EYWGYLEUZGLGIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XIFRXEWPJX74EYWGYLEUZGLGIN/action/storage_attestation","attest_author":"https://pith.science/pith/XIFRXEWPJX74EYWGYLEUZGLGIN/action/author_attestation","sign_citation":"https://pith.science/pith/XIFRXEWPJX74EYWGYLEUZGLGIN/action/citation_signature","submit_replication":"https://pith.science/pith/XIFRXEWPJX74EYWGYLEUZGLGIN/action/replication_record"}},"created_at":"2026-07-05T10:54:19.667561+00:00","updated_at":"2026-07-05T10:54:19.667561+00:00"}