{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:MZP2KVSEJD4THN5BKUXG4TSSKE","short_pith_number":"pith:MZP2KVSE","canonical_record":{"source":{"id":"2204.10455","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2022-04-22T01:26:48Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"20616f676577096a0a08f282b1991ed9aee75476d2373725f2724e2ba9d14892","abstract_canon_sha256":"728ad491ba15025b09644d8ee3e43398110979f17cb10d21eb91866e65b4d460"},"schema_version":"1.0"},"canonical_sha256":"665fa5564448f933b7a1552e6e4e525137ebdcafc5c6211c003a2f9a744dd51f","source":{"kind":"arxiv","id":"2204.10455","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.10455","created_at":"2026-07-05T05:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"2204.10455v4","created_at":"2026-07-05T05:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.10455","created_at":"2026-07-05T05:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"MZP2KVSEJD4T","created_at":"2026-07-05T05:00:41Z"},{"alias_kind":"pith_short_16","alias_value":"MZP2KVSEJD4THN5B","created_at":"2026-07-05T05:00:41Z"},{"alias_kind":"pith_short_8","alias_value":"MZP2KVSE","created_at":"2026-07-05T05:00:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:MZP2KVSEJD4THN5BKUXG4TSSKE","target":"record","payload":{"canonical_record":{"source":{"id":"2204.10455","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2022-04-22T01:26:48Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"20616f676577096a0a08f282b1991ed9aee75476d2373725f2724e2ba9d14892","abstract_canon_sha256":"728ad491ba15025b09644d8ee3e43398110979f17cb10d21eb91866e65b4d460"},"schema_version":"1.0"},"canonical_sha256":"665fa5564448f933b7a1552e6e4e525137ebdcafc5c6211c003a2f9a744dd51f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:00:41.763490Z","signature_b64":"JHJItfwPn6tTUq07NDKf2z14yv3zkmricsLWkVtERmJ7IEfPbPp0GKL0p4U5QmSbcCJedFcGk3OCYbLdXlMmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"665fa5564448f933b7a1552e6e4e525137ebdcafc5c6211c003a2f9a744dd51f","last_reissued_at":"2026-07-05T05:00:41.762988Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:00:41.762988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2204.10455","source_version":4,"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-05T05:00:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U1ttWpkcuS+SvKdB4qRmbqRZq+d+QRvloM++oeVmOyuAtApxNVkzHLXwHKBuIsc1HHvVnYGCDjGGN4XRLrS0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:31:55.988337Z"},"content_sha256":"fa34cb306c5bad9d441e0dc65cbac462a31f81020a8ae0ebd565fbdce50c118a","schema_version":"1.0","event_id":"sha256:fa34cb306c5bad9d441e0dc65cbac462a31f81020a8ae0ebd565fbdce50c118a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:MZP2KVSEJD4THN5BKUXG4TSSKE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Heap Limits for Reducing Browser Memory Use","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.PL","authors_text":"Marisa Kirisame, Pavel Panchekha, Pranav Shenoy","submitted_at":"2022-04-22T01:26:48Z","abstract_excerpt":"Garbage-collected language runtimes carefully tune heap limits to reduce garbage collection time and memory usage. However, there's a trade-off: a lower heap limit reduces memory use but increases garbage collection time. Classic methods for setting heap limits include manually tuned heap limits and multiple-of-live-size rules of thumb, but it is not clear when one rule is better than another or how to compare them.\n  We address this problem with a new framework where heap limits are set for multiple heaps at once. Our key insight is that every heap limit rule induces a particular allocation o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.10455","kind":"arxiv","version":4},"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/2204.10455/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-05T05:00:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NlNocmH3+B7DOm2QJBykegTOwfq8P1PjgE5oVSUvtYDg6I5yKjZ7sLrNCecC4nUQcELfsjF/PnHbI32II7kzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:31:55.988725Z"},"content_sha256":"138d237f8271b6a40b31b89dd34578ba56824062097cbbb6886ba92e9ca04f78","schema_version":"1.0","event_id":"sha256:138d237f8271b6a40b31b89dd34578ba56824062097cbbb6886ba92e9ca04f78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MZP2KVSEJD4THN5BKUXG4TSSKE/bundle.json","state_url":"https://pith.science/pith/MZP2KVSEJD4THN5BKUXG4TSSKE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MZP2KVSEJD4THN5BKUXG4TSSKE/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-07T06:31:55Z","links":{"resolver":"https://pith.science/pith/MZP2KVSEJD4THN5BKUXG4TSSKE","bundle":"https://pith.science/pith/MZP2KVSEJD4THN5BKUXG4TSSKE/bundle.json","state":"https://pith.science/pith/MZP2KVSEJD4THN5BKUXG4TSSKE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MZP2KVSEJD4THN5BKUXG4TSSKE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:MZP2KVSEJD4THN5BKUXG4TSSKE","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":"728ad491ba15025b09644d8ee3e43398110979f17cb10d21eb91866e65b4d460","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2022-04-22T01:26:48Z","title_canon_sha256":"20616f676577096a0a08f282b1991ed9aee75476d2373725f2724e2ba9d14892"},"schema_version":"1.0","source":{"id":"2204.10455","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.10455","created_at":"2026-07-05T05:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"2204.10455v4","created_at":"2026-07-05T05:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.10455","created_at":"2026-07-05T05:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"MZP2KVSEJD4T","created_at":"2026-07-05T05:00:41Z"},{"alias_kind":"pith_short_16","alias_value":"MZP2KVSEJD4THN5B","created_at":"2026-07-05T05:00:41Z"},{"alias_kind":"pith_short_8","alias_value":"MZP2KVSE","created_at":"2026-07-05T05:00:41Z"}],"graph_snapshots":[{"event_id":"sha256:138d237f8271b6a40b31b89dd34578ba56824062097cbbb6886ba92e9ca04f78","target":"graph","created_at":"2026-07-05T05:00:41Z","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/2204.10455/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Garbage-collected language runtimes carefully tune heap limits to reduce garbage collection time and memory usage. However, there's a trade-off: a lower heap limit reduces memory use but increases garbage collection time. Classic methods for setting heap limits include manually tuned heap limits and multiple-of-live-size rules of thumb, but it is not clear when one rule is better than another or how to compare them.\n  We address this problem with a new framework where heap limits are set for multiple heaps at once. Our key insight is that every heap limit rule induces a particular allocation o","authors_text":"Marisa Kirisame, Pavel Panchekha, Pranav Shenoy","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2022-04-22T01:26:48Z","title":"Optimal Heap Limits for Reducing Browser Memory Use"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.10455","kind":"arxiv","version":4},"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:fa34cb306c5bad9d441e0dc65cbac462a31f81020a8ae0ebd565fbdce50c118a","target":"record","created_at":"2026-07-05T05:00:41Z","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":"728ad491ba15025b09644d8ee3e43398110979f17cb10d21eb91866e65b4d460","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2022-04-22T01:26:48Z","title_canon_sha256":"20616f676577096a0a08f282b1991ed9aee75476d2373725f2724e2ba9d14892"},"schema_version":"1.0","source":{"id":"2204.10455","kind":"arxiv","version":4}},"canonical_sha256":"665fa5564448f933b7a1552e6e4e525137ebdcafc5c6211c003a2f9a744dd51f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"665fa5564448f933b7a1552e6e4e525137ebdcafc5c6211c003a2f9a744dd51f","first_computed_at":"2026-07-05T05:00:41.762988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:00:41.762988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JHJItfwPn6tTUq07NDKf2z14yv3zkmricsLWkVtERmJ7IEfPbPp0GKL0p4U5QmSbcCJedFcGk3OCYbLdXlMmBw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:00:41.763490Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.10455","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa34cb306c5bad9d441e0dc65cbac462a31f81020a8ae0ebd565fbdce50c118a","sha256:138d237f8271b6a40b31b89dd34578ba56824062097cbbb6886ba92e9ca04f78"],"state_sha256":"a45ec4fd7b2e6cac15d62f65d10983733c333511da5ac7158c1a1eb1d6914d22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BdmWMtkk7Pongd4YjEA8lCvyJVkUs07YZrH+wFYiaNq4Blr+9LjYeciJ2uD+clvJvcSrHekAaBPAyJ8HgL28Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:31:55.991239Z","bundle_sha256":"790b5f1ac73955bcdb9e53cb4a34d5721adba7593591167079cdc0d56d9e0297"}}