{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CTTEBEIMCUDLYOOMYO64PVFGJR","short_pith_number":"pith:CTTEBEIM","canonical_record":{"source":{"id":"1001.3355","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-01-19T16:27:13Z","cross_cats_sorted":["cs.NI","cs.PF","stat.AP","stat.CO"],"title_canon_sha256":"8d83ff7454b11e01aa6bf474fbc917a1aa62e3d0f4248a4f4a55203e1333f8ef","abstract_canon_sha256":"0a4503b65d3a506afbe7be656a4cbf83304e896be0804ee2ce72f02d25e9d93b"},"schema_version":"1.0"},"canonical_sha256":"14e640910c1506bc39ccc3bdc7d4a64c43a3af7e5ec3aca05d4afdf7745748ff","source":{"kind":"arxiv","id":"1001.3355","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.3355","created_at":"2026-05-18T04:24:07Z"},{"alias_kind":"arxiv_version","alias_value":"1001.3355v3","created_at":"2026-05-18T04:24:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3355","created_at":"2026-05-18T04:24:07Z"},{"alias_kind":"pith_short_12","alias_value":"CTTEBEIMCUDL","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CTTEBEIMCUDLYOOM","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CTTEBEIM","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CTTEBEIMCUDLYOOMYO64PVFGJR","target":"record","payload":{"canonical_record":{"source":{"id":"1001.3355","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-01-19T16:27:13Z","cross_cats_sorted":["cs.NI","cs.PF","stat.AP","stat.CO"],"title_canon_sha256":"8d83ff7454b11e01aa6bf474fbc917a1aa62e3d0f4248a4f4a55203e1333f8ef","abstract_canon_sha256":"0a4503b65d3a506afbe7be656a4cbf83304e896be0804ee2ce72f02d25e9d93b"},"schema_version":"1.0"},"canonical_sha256":"14e640910c1506bc39ccc3bdc7d4a64c43a3af7e5ec3aca05d4afdf7745748ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:07.283653Z","signature_b64":"6V4xN7I0ftF0sdcfEUHQZ07fzCBpB/kQkCr2j2hEFRuULR+sV9/jrCrest2djJINOO0kfaT9FiGrhx4ZRUpoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14e640910c1506bc39ccc3bdc7d4a64c43a3af7e5ec3aca05d4afdf7745748ff","last_reissued_at":"2026-05-18T04:24:07.282976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:07.282976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.3355","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-18T04:24:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AX0nCoR2r3u1vbcAfJO1Ds5li/pMCHTH2/3iLNtr+ji1skeP9juz1YtWkUUvszzHMqYz8ivp6nU3ZEmCm+IGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:17:03.448406Z"},"content_sha256":"73f29a38f627370b788796397469deb86a842430739b81e55c68641a9320bc83","schema_version":"1.0","event_id":"sha256:73f29a38f627370b788796397469deb86a842430739b81e55c68641a9320bc83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CTTEBEIMCUDLYOOMYO64PVFGJR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian inference for queueing networks and modeling of internet services","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.PF","stat.AP","stat.CO"],"primary_cat":"stat.ML","authors_text":"Charles Sutton, Michael I. Jordan","submitted_at":"2010-01-19T16:27:13Z","abstract_excerpt":"Modern Internet services, such as those at Google, Yahoo!, and Amazon, handle billions of requests per day on clusters of thousands of computers. Because these services operate under strict performance requirements, a statistical understanding of their performance is of great practical interest. Such services are modeled by networks of queues, where each queue models one of the computers in the system. A key challenge is that the data are incomplete, because recording detailed information about every request to a heavily used system can require unacceptable overhead. In this paper we develop a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3355","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-18T04:24:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q2uKa92sPCD1dlPbivWm44hBT3fJPIGGqzyr0MwueYtH0lu6ku1mbkEP9TSDd1PaK8UPxdGLfLEzwz6g9/LHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:17:03.448757Z"},"content_sha256":"65a10203cd4bb3275793ad4e3785797a53c6ef728afa09d3efe0ddd386d2ba9a","schema_version":"1.0","event_id":"sha256:65a10203cd4bb3275793ad4e3785797a53c6ef728afa09d3efe0ddd386d2ba9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CTTEBEIMCUDLYOOMYO64PVFGJR/bundle.json","state_url":"https://pith.science/pith/CTTEBEIMCUDLYOOMYO64PVFGJR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CTTEBEIMCUDLYOOMYO64PVFGJR/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-02T22:17:03Z","links":{"resolver":"https://pith.science/pith/CTTEBEIMCUDLYOOMYO64PVFGJR","bundle":"https://pith.science/pith/CTTEBEIMCUDLYOOMYO64PVFGJR/bundle.json","state":"https://pith.science/pith/CTTEBEIMCUDLYOOMYO64PVFGJR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CTTEBEIMCUDLYOOMYO64PVFGJR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CTTEBEIMCUDLYOOMYO64PVFGJR","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":"0a4503b65d3a506afbe7be656a4cbf83304e896be0804ee2ce72f02d25e9d93b","cross_cats_sorted":["cs.NI","cs.PF","stat.AP","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-01-19T16:27:13Z","title_canon_sha256":"8d83ff7454b11e01aa6bf474fbc917a1aa62e3d0f4248a4f4a55203e1333f8ef"},"schema_version":"1.0","source":{"id":"1001.3355","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.3355","created_at":"2026-05-18T04:24:07Z"},{"alias_kind":"arxiv_version","alias_value":"1001.3355v3","created_at":"2026-05-18T04:24:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3355","created_at":"2026-05-18T04:24:07Z"},{"alias_kind":"pith_short_12","alias_value":"CTTEBEIMCUDL","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CTTEBEIMCUDLYOOM","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CTTEBEIM","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:65a10203cd4bb3275793ad4e3785797a53c6ef728afa09d3efe0ddd386d2ba9a","target":"graph","created_at":"2026-05-18T04:24:07Z","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":"Modern Internet services, such as those at Google, Yahoo!, and Amazon, handle billions of requests per day on clusters of thousands of computers. Because these services operate under strict performance requirements, a statistical understanding of their performance is of great practical interest. Such services are modeled by networks of queues, where each queue models one of the computers in the system. A key challenge is that the data are incomplete, because recording detailed information about every request to a heavily used system can require unacceptable overhead. In this paper we develop a","authors_text":"Charles Sutton, Michael I. Jordan","cross_cats":["cs.NI","cs.PF","stat.AP","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-01-19T16:27:13Z","title":"Bayesian inference for queueing networks and modeling of internet services"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3355","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:73f29a38f627370b788796397469deb86a842430739b81e55c68641a9320bc83","target":"record","created_at":"2026-05-18T04:24:07Z","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":"0a4503b65d3a506afbe7be656a4cbf83304e896be0804ee2ce72f02d25e9d93b","cross_cats_sorted":["cs.NI","cs.PF","stat.AP","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-01-19T16:27:13Z","title_canon_sha256":"8d83ff7454b11e01aa6bf474fbc917a1aa62e3d0f4248a4f4a55203e1333f8ef"},"schema_version":"1.0","source":{"id":"1001.3355","kind":"arxiv","version":3}},"canonical_sha256":"14e640910c1506bc39ccc3bdc7d4a64c43a3af7e5ec3aca05d4afdf7745748ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14e640910c1506bc39ccc3bdc7d4a64c43a3af7e5ec3aca05d4afdf7745748ff","first_computed_at":"2026-05-18T04:24:07.282976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:07.282976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6V4xN7I0ftF0sdcfEUHQZ07fzCBpB/kQkCr2j2hEFRuULR+sV9/jrCrest2djJINOO0kfaT9FiGrhx4ZRUpoDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:07.283653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.3355","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73f29a38f627370b788796397469deb86a842430739b81e55c68641a9320bc83","sha256:65a10203cd4bb3275793ad4e3785797a53c6ef728afa09d3efe0ddd386d2ba9a"],"state_sha256":"eddc941985f581c9407f12cb5bc7ba4b8936555ca0ff01186c7d772114276147"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rTQ0RGpBuZLXgby6uVHmaG8UeHbFZT9q3lU0yhyOnQGyMhVGbNqm5ASo+VyOYKyEWp5bk1cMDw7A+gQzK+ZaDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:17:03.450686Z","bundle_sha256":"317f51bcf5994571298a6169e5a4b725fcc4a7f989a9e2b93f3956a4272ef087"}}