{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UJUZCDCZMV2JN7CJMDF6Y4UXOT","short_pith_number":"pith:UJUZCDCZ","canonical_record":{"source":{"id":"1508.03420","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-08-14T05:06:15Z","cross_cats_sorted":[],"title_canon_sha256":"6bbc9cbcd6195f9ce10ebfb74b31643df122a5807cf9a4bdf50b6afeaf54e205","abstract_canon_sha256":"bf6c3053cba3744abad88842038a7ff6f954993f0a95d6d1459cbe65cf6d5f5b"},"schema_version":"1.0"},"canonical_sha256":"a269910c59657496fc4960cbec729774fac4015fb067922bbe29048df108999b","source":{"kind":"arxiv","id":"1508.03420","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03420","created_at":"2026-05-18T01:13:30Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03420v3","created_at":"2026-05-18T01:13:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03420","created_at":"2026-05-18T01:13:30Z"},{"alias_kind":"pith_short_12","alias_value":"UJUZCDCZMV2J","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UJUZCDCZMV2JN7CJ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UJUZCDCZ","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UJUZCDCZMV2JN7CJMDF6Y4UXOT","target":"record","payload":{"canonical_record":{"source":{"id":"1508.03420","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-08-14T05:06:15Z","cross_cats_sorted":[],"title_canon_sha256":"6bbc9cbcd6195f9ce10ebfb74b31643df122a5807cf9a4bdf50b6afeaf54e205","abstract_canon_sha256":"bf6c3053cba3744abad88842038a7ff6f954993f0a95d6d1459cbe65cf6d5f5b"},"schema_version":"1.0"},"canonical_sha256":"a269910c59657496fc4960cbec729774fac4015fb067922bbe29048df108999b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:30.871197Z","signature_b64":"8ecHSaT1qiGmBbHOrVnjpxnvUlSPvEYBWvwM6lIqjcsF7gyklAbcleLq6gTNTRNKdyjPWBWPVUMOWy1G29K8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a269910c59657496fc4960cbec729774fac4015fb067922bbe29048df108999b","last_reissued_at":"2026-05-18T01:13:30.870549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:30.870549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.03420","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-18T01:13:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E7movzWSpJ6L7DxOCdHMJi5xOoFSjzclTASeddy+ubDjlotVBUY7/bcl5YfCxhxGzPQM3l1LFP3YSfJLA5RGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T18:31:21.475399Z"},"content_sha256":"3a6eade62a39d274e756d08bd78593e2f2355a5c13890ac907b0b7194ce4cea7","schema_version":"1.0","event_id":"sha256:3a6eade62a39d274e756d08bd78593e2f2355a5c13890ac907b0b7194ce4cea7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UJUZCDCZMV2JN7CJMDF6Y4UXOT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A strategic timing of arrivals to a linear slowdown processor sharing system","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Hai L. Vu, Liron Ravner, Moshe Haviv","submitted_at":"2015-08-14T05:06:15Z","abstract_excerpt":"We consider a discrete population of users with homogeneous service demand who need to decide when to arrive to a system in which the service rate deteriorates linearly with the number of users in the system. The users have heterogeneous desired departure times from the system, and their goal is to minimize a weighted sum of the travel time and square deviation from the desired departure times. Users join the system sequentially, according to the order of their desired departure times. We model this scenario as a non-cooperative game in which each user selects his actual arrival time. We prese"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03420","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-18T01:13:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3hI2YAnc4MPUS0+h1vYxAQRygoXpi5fHQL4ctX3inITPh6Fn5MCY2rhxlHR8MBlcdi06tSVBDk4lpgfDz4wKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T18:31:21.475745Z"},"content_sha256":"bbec5b7fabd5634d9c78357e174003085ad094f07046863729645cbc00fd7bc4","schema_version":"1.0","event_id":"sha256:bbec5b7fabd5634d9c78357e174003085ad094f07046863729645cbc00fd7bc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJUZCDCZMV2JN7CJMDF6Y4UXOT/bundle.json","state_url":"https://pith.science/pith/UJUZCDCZMV2JN7CJMDF6Y4UXOT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJUZCDCZMV2JN7CJMDF6Y4UXOT/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-20T18:31:21Z","links":{"resolver":"https://pith.science/pith/UJUZCDCZMV2JN7CJMDF6Y4UXOT","bundle":"https://pith.science/pith/UJUZCDCZMV2JN7CJMDF6Y4UXOT/bundle.json","state":"https://pith.science/pith/UJUZCDCZMV2JN7CJMDF6Y4UXOT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJUZCDCZMV2JN7CJMDF6Y4UXOT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UJUZCDCZMV2JN7CJMDF6Y4UXOT","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":"bf6c3053cba3744abad88842038a7ff6f954993f0a95d6d1459cbe65cf6d5f5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-08-14T05:06:15Z","title_canon_sha256":"6bbc9cbcd6195f9ce10ebfb74b31643df122a5807cf9a4bdf50b6afeaf54e205"},"schema_version":"1.0","source":{"id":"1508.03420","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03420","created_at":"2026-05-18T01:13:30Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03420v3","created_at":"2026-05-18T01:13:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03420","created_at":"2026-05-18T01:13:30Z"},{"alias_kind":"pith_short_12","alias_value":"UJUZCDCZMV2J","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UJUZCDCZMV2JN7CJ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UJUZCDCZ","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:bbec5b7fabd5634d9c78357e174003085ad094f07046863729645cbc00fd7bc4","target":"graph","created_at":"2026-05-18T01:13:30Z","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":"We consider a discrete population of users with homogeneous service demand who need to decide when to arrive to a system in which the service rate deteriorates linearly with the number of users in the system. The users have heterogeneous desired departure times from the system, and their goal is to minimize a weighted sum of the travel time and square deviation from the desired departure times. Users join the system sequentially, according to the order of their desired departure times. We model this scenario as a non-cooperative game in which each user selects his actual arrival time. We prese","authors_text":"Hai L. Vu, Liron Ravner, Moshe Haviv","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-08-14T05:06:15Z","title":"A strategic timing of arrivals to a linear slowdown processor sharing system"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03420","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:3a6eade62a39d274e756d08bd78593e2f2355a5c13890ac907b0b7194ce4cea7","target":"record","created_at":"2026-05-18T01:13:30Z","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":"bf6c3053cba3744abad88842038a7ff6f954993f0a95d6d1459cbe65cf6d5f5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-08-14T05:06:15Z","title_canon_sha256":"6bbc9cbcd6195f9ce10ebfb74b31643df122a5807cf9a4bdf50b6afeaf54e205"},"schema_version":"1.0","source":{"id":"1508.03420","kind":"arxiv","version":3}},"canonical_sha256":"a269910c59657496fc4960cbec729774fac4015fb067922bbe29048df108999b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a269910c59657496fc4960cbec729774fac4015fb067922bbe29048df108999b","first_computed_at":"2026-05-18T01:13:30.870549Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:30.870549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8ecHSaT1qiGmBbHOrVnjpxnvUlSPvEYBWvwM6lIqjcsF7gyklAbcleLq6gTNTRNKdyjPWBWPVUMOWy1G29K8CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:30.871197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03420","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a6eade62a39d274e756d08bd78593e2f2355a5c13890ac907b0b7194ce4cea7","sha256:bbec5b7fabd5634d9c78357e174003085ad094f07046863729645cbc00fd7bc4"],"state_sha256":"b72fc33315717206da78b88f39d010799f1eb8656bcfc5532dfb9cb95ed24426"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3E/sMITXNq0fnhpaKjkvKQD1KpOac9UZ9b1HvOu539t44iigvmIPqjHn0Y1wvMZT869QAlng05u2HaDgNJmLDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T18:31:21.477528Z","bundle_sha256":"9a20f94b0a1c9fab68d98951f9cdccd6f170e340282fffbe3aa0b41cbb35b0ed"}}