{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RUOPE4GIMNGYYVP7YL4FCM76GD","short_pith_number":"pith:RUOPE4GI","canonical_record":{"source":{"id":"1803.08981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-03-23T21:08:36Z","cross_cats_sorted":[],"title_canon_sha256":"142a453145c19915b72207615cfa9e39197d56c3dd98713cdcb3ba6dccc7ab48","abstract_canon_sha256":"cb34e5d2d32083b9042e795dbc1962bc7f574b3b237a6540bb00dc9e1705b788"},"schema_version":"1.0"},"canonical_sha256":"8d1cf270c8634d8c55ffc2f85133fe30e89967fa5a07faedc0ae0080f421d167","source":{"kind":"arxiv","id":"1803.08981","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08981","created_at":"2026-05-18T00:20:13Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08981v1","created_at":"2026-05-18T00:20:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08981","created_at":"2026-05-18T00:20:13Z"},{"alias_kind":"pith_short_12","alias_value":"RUOPE4GIMNGY","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RUOPE4GIMNGYYVP7","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RUOPE4GI","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RUOPE4GIMNGYYVP7YL4FCM76GD","target":"record","payload":{"canonical_record":{"source":{"id":"1803.08981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-03-23T21:08:36Z","cross_cats_sorted":[],"title_canon_sha256":"142a453145c19915b72207615cfa9e39197d56c3dd98713cdcb3ba6dccc7ab48","abstract_canon_sha256":"cb34e5d2d32083b9042e795dbc1962bc7f574b3b237a6540bb00dc9e1705b788"},"schema_version":"1.0"},"canonical_sha256":"8d1cf270c8634d8c55ffc2f85133fe30e89967fa5a07faedc0ae0080f421d167","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:13.042301Z","signature_b64":"/61WwugrOjn9N5KGlVgJZhG9wcNDmeEdLXzpDCiK0stIvkbJLLmH8gAkWoYfGjJ4V9oChIaUAvqaeJQLJTn9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d1cf270c8634d8c55ffc2f85133fe30e89967fa5a07faedc0ae0080f421d167","last_reissued_at":"2026-05-18T00:20:13.041659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:13.041659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.08981","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-18T00:20:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b/i4MzEPtK8P98OYfbTwiCrjYobuuf54dcbxQ7gOza3Ti8cL4Ie0s3blj/okRTu5qSX3rhIHgnc0iB9/Q7zbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:39:02.636088Z"},"content_sha256":"11793b776dbefaa4db8a9aa13d5898e65100ae1369170773cdc32795af39ca97","schema_version":"1.0","event_id":"sha256:11793b776dbefaa4db8a9aa13d5898e65100ae1369170773cdc32795af39ca97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RUOPE4GIMNGYYVP7YL4FCM76GD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unix Memory Allocations are Not Poisson","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Elizabeth Bradley, James Garnett","submitted_at":"2018-03-23T21:08:36Z","abstract_excerpt":"In multitasking operating systems, requests for free memory are traditionally modeled as a stochastic counting process with independent, exponentially-distributed interarrival times because of the analytic simplicity such Poisson models afford. We analyze the distribution of several million unix page commits to show that although this approach could be valid over relatively long timespans, the behavior of the arrival process over shorter periods is decidedly not Poisson. We find that this result holds regardless of the originator of the request: unlike network packets, there is little differen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08981","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-18T00:20:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1MLuk1LDkAmuHjGnRnSknHTNI64BluWvXwFD+AS0ACsBlfrYE0JZ5Q7rURaG+eQaIsM8+8YUSboUXcOguq+dCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:39:02.636451Z"},"content_sha256":"781c9ccd245fdb0bc15f7dc9f34b17a26b47a63de803b0a217689e7668ff3ea8","schema_version":"1.0","event_id":"sha256:781c9ccd245fdb0bc15f7dc9f34b17a26b47a63de803b0a217689e7668ff3ea8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RUOPE4GIMNGYYVP7YL4FCM76GD/bundle.json","state_url":"https://pith.science/pith/RUOPE4GIMNGYYVP7YL4FCM76GD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RUOPE4GIMNGYYVP7YL4FCM76GD/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-20T02:39:02Z","links":{"resolver":"https://pith.science/pith/RUOPE4GIMNGYYVP7YL4FCM76GD","bundle":"https://pith.science/pith/RUOPE4GIMNGYYVP7YL4FCM76GD/bundle.json","state":"https://pith.science/pith/RUOPE4GIMNGYYVP7YL4FCM76GD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RUOPE4GIMNGYYVP7YL4FCM76GD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RUOPE4GIMNGYYVP7YL4FCM76GD","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":"cb34e5d2d32083b9042e795dbc1962bc7f574b3b237a6540bb00dc9e1705b788","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-03-23T21:08:36Z","title_canon_sha256":"142a453145c19915b72207615cfa9e39197d56c3dd98713cdcb3ba6dccc7ab48"},"schema_version":"1.0","source":{"id":"1803.08981","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08981","created_at":"2026-05-18T00:20:13Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08981v1","created_at":"2026-05-18T00:20:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08981","created_at":"2026-05-18T00:20:13Z"},{"alias_kind":"pith_short_12","alias_value":"RUOPE4GIMNGY","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RUOPE4GIMNGYYVP7","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RUOPE4GI","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:781c9ccd245fdb0bc15f7dc9f34b17a26b47a63de803b0a217689e7668ff3ea8","target":"graph","created_at":"2026-05-18T00:20:13Z","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":"In multitasking operating systems, requests for free memory are traditionally modeled as a stochastic counting process with independent, exponentially-distributed interarrival times because of the analytic simplicity such Poisson models afford. We analyze the distribution of several million unix page commits to show that although this approach could be valid over relatively long timespans, the behavior of the arrival process over shorter periods is decidedly not Poisson. We find that this result holds regardless of the originator of the request: unlike network packets, there is little differen","authors_text":"Elizabeth Bradley, James Garnett","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-03-23T21:08:36Z","title":"Unix Memory Allocations are Not Poisson"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08981","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:11793b776dbefaa4db8a9aa13d5898e65100ae1369170773cdc32795af39ca97","target":"record","created_at":"2026-05-18T00:20:13Z","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":"cb34e5d2d32083b9042e795dbc1962bc7f574b3b237a6540bb00dc9e1705b788","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2018-03-23T21:08:36Z","title_canon_sha256":"142a453145c19915b72207615cfa9e39197d56c3dd98713cdcb3ba6dccc7ab48"},"schema_version":"1.0","source":{"id":"1803.08981","kind":"arxiv","version":1}},"canonical_sha256":"8d1cf270c8634d8c55ffc2f85133fe30e89967fa5a07faedc0ae0080f421d167","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d1cf270c8634d8c55ffc2f85133fe30e89967fa5a07faedc0ae0080f421d167","first_computed_at":"2026-05-18T00:20:13.041659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:13.041659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/61WwugrOjn9N5KGlVgJZhG9wcNDmeEdLXzpDCiK0stIvkbJLLmH8gAkWoYfGjJ4V9oChIaUAvqaeJQLJTn9Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:13.042301Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.08981","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11793b776dbefaa4db8a9aa13d5898e65100ae1369170773cdc32795af39ca97","sha256:781c9ccd245fdb0bc15f7dc9f34b17a26b47a63de803b0a217689e7668ff3ea8"],"state_sha256":"79e1e63be808f09f09e3341c1d1b1e58b41489ff042a8d54d6662a03f420a4a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+AgQfsdoA6LceHByhGA1sovktQimPct5NbqVNR8/cdnk3Rs33Dd5cqVvJ3sD/9Z7p3mDnUunQoQ4oR4DtTH9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T02:39:02.638433Z","bundle_sha256":"eb9643a652cc5036b58db834c502b6b5fe736c6bf7308a05f91b155a3af6f493"}}