{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EUXHKWXZZN4V7UIP4ZQH33V3B2","short_pith_number":"pith:EUXHKWXZ","schema_version":"1.0","canonical_sha256":"252e755af9cb795fd10fe6607deebb0e874a9ac2de89397d6007cf00ee8b8d58","source":{"kind":"arxiv","id":"1701.04776","version":2},"attestation_state":"computed","paper":{"title":"A strategic model of job arrivals to a single machine with earliness and tardiness penalties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Amihai Glazer, Liron Ravner, Refael Hassin","submitted_at":"2017-01-17T17:25:06Z","abstract_excerpt":"We consider a game of decentralized timing of jobs to a single server (machine) with a penalty for deviation from a due date, and no delay costs. The jobs' sizes are homogeneous and deterministic. Each job belongs to a single decision maker, a customer, who aims to arrive at a time that minimizes his deviation penalty. If multiple customers arrive at the same time then their order of service is determined by a uniform random draw. We show that if the cost function has a weighted absolute deviation form then any Nash equilibrium is pure and symmetric, that is, all customers arrive together. Fur"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1701.04776","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-01-17T17:25:06Z","cross_cats_sorted":[],"title_canon_sha256":"82879d36e7dd6f9d4a276d02cd425a615703d3113b970e7a6e1ff7c652e46467","abstract_canon_sha256":"0de88c9c73138fc21f9965576b8461aab9bb6570dc6299c7c4719ce81939baed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:55.398841Z","signature_b64":"SfOtYjDKHwAcSlyy3XdQ4epOaZFMmeUP18PYdy3jU9jCHeLsw64dkwFuXzgf4C3SnNapkkw14iBUP35AkVa3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"252e755af9cb795fd10fe6607deebb0e874a9ac2de89397d6007cf00ee8b8d58","last_reissued_at":"2026-05-18T00:32:55.398100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:55.398100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A strategic model of job arrivals to a single machine with earliness and tardiness penalties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Amihai Glazer, Liron Ravner, Refael Hassin","submitted_at":"2017-01-17T17:25:06Z","abstract_excerpt":"We consider a game of decentralized timing of jobs to a single server (machine) with a penalty for deviation from a due date, and no delay costs. The jobs' sizes are homogeneous and deterministic. Each job belongs to a single decision maker, a customer, who aims to arrive at a time that minimizes his deviation penalty. If multiple customers arrive at the same time then their order of service is determined by a uniform random draw. We show that if the cost function has a weighted absolute deviation form then any Nash equilibrium is pure and symmetric, that is, all customers arrive together. Fur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04776","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.04776","created_at":"2026-05-18T00:32:55.398235+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.04776v2","created_at":"2026-05-18T00:32:55.398235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04776","created_at":"2026-05-18T00:32:55.398235+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUXHKWXZZN4V","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUXHKWXZZN4V7UIP","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUXHKWXZ","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EUXHKWXZZN4V7UIP4ZQH33V3B2","json":"https://pith.science/pith/EUXHKWXZZN4V7UIP4ZQH33V3B2.json","graph_json":"https://pith.science/api/pith-number/EUXHKWXZZN4V7UIP4ZQH33V3B2/graph.json","events_json":"https://pith.science/api/pith-number/EUXHKWXZZN4V7UIP4ZQH33V3B2/events.json","paper":"https://pith.science/paper/EUXHKWXZ"},"agent_actions":{"view_html":"https://pith.science/pith/EUXHKWXZZN4V7UIP4ZQH33V3B2","download_json":"https://pith.science/pith/EUXHKWXZZN4V7UIP4ZQH33V3B2.json","view_paper":"https://pith.science/paper/EUXHKWXZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.04776&json=true","fetch_graph":"https://pith.science/api/pith-number/EUXHKWXZZN4V7UIP4ZQH33V3B2/graph.json","fetch_events":"https://pith.science/api/pith-number/EUXHKWXZZN4V7UIP4ZQH33V3B2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUXHKWXZZN4V7UIP4ZQH33V3B2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUXHKWXZZN4V7UIP4ZQH33V3B2/action/storage_attestation","attest_author":"https://pith.science/pith/EUXHKWXZZN4V7UIP4ZQH33V3B2/action/author_attestation","sign_citation":"https://pith.science/pith/EUXHKWXZZN4V7UIP4ZQH33V3B2/action/citation_signature","submit_replication":"https://pith.science/pith/EUXHKWXZZN4V7UIP4ZQH33V3B2/action/replication_record"}},"created_at":"2026-05-18T00:32:55.398235+00:00","updated_at":"2026-05-18T00:32:55.398235+00:00"}