{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:DVA2WYN26ZQQTRU7BDPOWRORZ5","short_pith_number":"pith:DVA2WYN2","canonical_record":{"source":{"id":"2508.04417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2025-08-06T13:05:00Z","cross_cats_sorted":[],"title_canon_sha256":"9160d8a68a945cd2fdeee91f9909ac0c91548507abe9645699322a045e399970","abstract_canon_sha256":"8e4125059f237df8ab279c23d3adf51f33f95c84076555fa046ebdaa68d498e4"},"schema_version":"1.0"},"canonical_sha256":"1d41ab61baf66109c69f08deeb45d1cf46efb9cef6996806bbeefab3cfe0e486","source":{"kind":"arxiv","id":"2508.04417","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.04417","created_at":"2026-07-05T11:49:26Z"},{"alias_kind":"arxiv_version","alias_value":"2508.04417v1","created_at":"2026-07-05T11:49:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.04417","created_at":"2026-07-05T11:49:26Z"},{"alias_kind":"pith_short_12","alias_value":"DVA2WYN26ZQQ","created_at":"2026-07-05T11:49:26Z"},{"alias_kind":"pith_short_16","alias_value":"DVA2WYN26ZQQTRU7","created_at":"2026-07-05T11:49:26Z"},{"alias_kind":"pith_short_8","alias_value":"DVA2WYN2","created_at":"2026-07-05T11:49:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:DVA2WYN26ZQQTRU7BDPOWRORZ5","target":"record","payload":{"canonical_record":{"source":{"id":"2508.04417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2025-08-06T13:05:00Z","cross_cats_sorted":[],"title_canon_sha256":"9160d8a68a945cd2fdeee91f9909ac0c91548507abe9645699322a045e399970","abstract_canon_sha256":"8e4125059f237df8ab279c23d3adf51f33f95c84076555fa046ebdaa68d498e4"},"schema_version":"1.0"},"canonical_sha256":"1d41ab61baf66109c69f08deeb45d1cf46efb9cef6996806bbeefab3cfe0e486","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:49:26.111873Z","signature_b64":"uHMCrR1bZX13tr0MHPYyFnpZtrPbOdKVptm3hpfcKOJJfULZKDEnmQDDMIFfmOiaPrmCfVSOobyq3CdGNuCyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d41ab61baf66109c69f08deeb45d1cf46efb9cef6996806bbeefab3cfe0e486","last_reissued_at":"2026-07-05T11:49:26.111394Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:49:26.111394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.04417","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-07-05T11:49:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+s+/4JtYViYskSDrxZvKxMm2p2o/v4UMHMLg4T0gQZi61SWaAMq1Aq9KLudWS9pSvpWY/DoH102eR8/tHafBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T12:11:35.570247Z"},"content_sha256":"c579e6587e7e4f238056c48f62569a340cdb34da6734044e400e4b32a6d6f144","schema_version":"1.0","event_id":"sha256:c579e6587e7e4f238056c48f62569a340cdb34da6734044e400e4b32a6d6f144"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:DVA2WYN26ZQQTRU7BDPOWRORZ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ARMS: Adaptive and Robust Memory Tiering System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Konstantinos Kanellis, Michael Swift, Shivaram Venkataraman, Sujay Yadalam","submitted_at":"2025-08-06T13:05:00Z","abstract_excerpt":"Memory tiering systems seek cost-effective memory scaling by adding multiple tiers of memory. 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 such as HeMem, Memtis, and TPP use rigid policies with pre-configured thresholds to make data placement and migration decisions. We perform a thorough evaluation of the threshold choices and show that there is no single set of thresholds that perform well for all workloads and configuratio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.04417","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/2508.04417/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"},"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-07-05T11:49:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SrD471xFG0y5ZMggz1ri7Qe+mt0X2t0arbSAhL2R7ANG8HWFKy2EcwtHNba0YuR+4EMajAUL2O9IljQLZkdNBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T12:11:35.570636Z"},"content_sha256":"587bbc3c360bb813bbc7eec8917a9204793c8c02038d9b5bb12b80049fe7d260","schema_version":"1.0","event_id":"sha256:587bbc3c360bb813bbc7eec8917a9204793c8c02038d9b5bb12b80049fe7d260"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DVA2WYN26ZQQTRU7BDPOWRORZ5/bundle.json","state_url":"https://pith.science/pith/DVA2WYN26ZQQTRU7BDPOWRORZ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DVA2WYN26ZQQTRU7BDPOWRORZ5/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-07-14T12:11:35Z","links":{"resolver":"https://pith.science/pith/DVA2WYN26ZQQTRU7BDPOWRORZ5","bundle":"https://pith.science/pith/DVA2WYN26ZQQTRU7BDPOWRORZ5/bundle.json","state":"https://pith.science/pith/DVA2WYN26ZQQTRU7BDPOWRORZ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DVA2WYN26ZQQTRU7BDPOWRORZ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:DVA2WYN26ZQQTRU7BDPOWRORZ5","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":"8e4125059f237df8ab279c23d3adf51f33f95c84076555fa046ebdaa68d498e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2025-08-06T13:05:00Z","title_canon_sha256":"9160d8a68a945cd2fdeee91f9909ac0c91548507abe9645699322a045e399970"},"schema_version":"1.0","source":{"id":"2508.04417","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.04417","created_at":"2026-07-05T11:49:26Z"},{"alias_kind":"arxiv_version","alias_value":"2508.04417v1","created_at":"2026-07-05T11:49:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.04417","created_at":"2026-07-05T11:49:26Z"},{"alias_kind":"pith_short_12","alias_value":"DVA2WYN26ZQQ","created_at":"2026-07-05T11:49:26Z"},{"alias_kind":"pith_short_16","alias_value":"DVA2WYN26ZQQTRU7","created_at":"2026-07-05T11:49:26Z"},{"alias_kind":"pith_short_8","alias_value":"DVA2WYN2","created_at":"2026-07-05T11:49:26Z"}],"graph_snapshots":[{"event_id":"sha256:587bbc3c360bb813bbc7eec8917a9204793c8c02038d9b5bb12b80049fe7d260","target":"graph","created_at":"2026-07-05T11:49:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.04417/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Memory tiering systems seek cost-effective memory scaling by adding multiple tiers of memory. 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 such as HeMem, Memtis, and TPP use rigid policies with pre-configured thresholds to make data placement and migration decisions. We perform a thorough evaluation of the threshold choices and show that there is no single set of thresholds that perform well for all workloads and configuratio","authors_text":"Konstantinos Kanellis, Michael Swift, Shivaram Venkataraman, Sujay Yadalam","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2025-08-06T13:05:00Z","title":"ARMS: Adaptive and Robust Memory Tiering System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.04417","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:c579e6587e7e4f238056c48f62569a340cdb34da6734044e400e4b32a6d6f144","target":"record","created_at":"2026-07-05T11:49:26Z","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":"8e4125059f237df8ab279c23d3adf51f33f95c84076555fa046ebdaa68d498e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2025-08-06T13:05:00Z","title_canon_sha256":"9160d8a68a945cd2fdeee91f9909ac0c91548507abe9645699322a045e399970"},"schema_version":"1.0","source":{"id":"2508.04417","kind":"arxiv","version":1}},"canonical_sha256":"1d41ab61baf66109c69f08deeb45d1cf46efb9cef6996806bbeefab3cfe0e486","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d41ab61baf66109c69f08deeb45d1cf46efb9cef6996806bbeefab3cfe0e486","first_computed_at":"2026-07-05T11:49:26.111394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:49:26.111394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uHMCrR1bZX13tr0MHPYyFnpZtrPbOdKVptm3hpfcKOJJfULZKDEnmQDDMIFfmOiaPrmCfVSOobyq3CdGNuCyAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:49:26.111873Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.04417","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c579e6587e7e4f238056c48f62569a340cdb34da6734044e400e4b32a6d6f144","sha256:587bbc3c360bb813bbc7eec8917a9204793c8c02038d9b5bb12b80049fe7d260"],"state_sha256":"f2520377b66e8de7ce6f2a97780f50d764ac2a92703c014059f8af208e87d358"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tu+7go3PfJS4a+xAHqHdIXgkS5L1PW2i6J8olDLHJalL18r9mEPXzkw7azk15nVQQtEh7YD/Pg1e7mZIwJVSDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-14T12:11:35.572743Z","bundle_sha256":"36cd4c8d58a7c12b3add23049f805e147c50b7ee596ac56e23b3ffac98bc3969"}}