{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CYT64PODGWHYQ53T3IZVMFP3CW","short_pith_number":"pith:CYT64POD","schema_version":"1.0","canonical_sha256":"1627ee3dc3358f887773da335615fb15802e1234ec30dbde386145627e57fb0a","source":{"kind":"arxiv","id":"1808.04882","version":1},"attestation_state":"computed","paper":{"title":"Timed Network Games with Clocks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Guy Avni, Orna Kupferman, Shibashis Guha","submitted_at":"2018-08-14T20:10:33Z","abstract_excerpt":"Network games are widely used as a model for selfish resource-allocation problems. In the classical model, each player selects a path connecting her source and target vertices. The cost of traversing an edge depends on the {\\em load}; namely, number of players that traverse it. Thus, it abstracts the fact that different users may use a resource at different times and for different durations, which plays an important role in determining the costs of the users in reality. For example, when transmitting packets in a communication network, routing traffic in a road network, or processing a task in"},"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":"1808.04882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-08-14T20:10:33Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"0867c8ac4345762f07a1a3b483240345605a5a532c11cde243fd831e306667f4","abstract_canon_sha256":"29c96cf9fff11ca3c908d292f5514bbcae191b8137ac929259c72303b88517be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:02.313014Z","signature_b64":"Hm4rIWB+A+76p860A+9IYAY02egTd9Gt7jHZGPJaDm2u7U4UALI1G1Zf9MVQIu7Jdwa5Q9W6k9LzX3GcXrXSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1627ee3dc3358f887773da335615fb15802e1234ec30dbde386145627e57fb0a","last_reissued_at":"2026-05-18T00:08:02.312336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:02.312336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Timed Network Games with Clocks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Guy Avni, Orna Kupferman, Shibashis Guha","submitted_at":"2018-08-14T20:10:33Z","abstract_excerpt":"Network games are widely used as a model for selfish resource-allocation problems. In the classical model, each player selects a path connecting her source and target vertices. The cost of traversing an edge depends on the {\\em load}; namely, number of players that traverse it. Thus, it abstracts the fact that different users may use a resource at different times and for different durations, which plays an important role in determining the costs of the users in reality. For example, when transmitting packets in a communication network, routing traffic in a road network, or processing a task in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04882","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.04882","created_at":"2026-05-18T00:08:02.312452+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.04882v1","created_at":"2026-05-18T00:08:02.312452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04882","created_at":"2026-05-18T00:08:02.312452+00:00"},{"alias_kind":"pith_short_12","alias_value":"CYT64PODGWHY","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"CYT64PODGWHYQ53T","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"CYT64POD","created_at":"2026-05-18T12:32:19.392346+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/CYT64PODGWHYQ53T3IZVMFP3CW","json":"https://pith.science/pith/CYT64PODGWHYQ53T3IZVMFP3CW.json","graph_json":"https://pith.science/api/pith-number/CYT64PODGWHYQ53T3IZVMFP3CW/graph.json","events_json":"https://pith.science/api/pith-number/CYT64PODGWHYQ53T3IZVMFP3CW/events.json","paper":"https://pith.science/paper/CYT64POD"},"agent_actions":{"view_html":"https://pith.science/pith/CYT64PODGWHYQ53T3IZVMFP3CW","download_json":"https://pith.science/pith/CYT64PODGWHYQ53T3IZVMFP3CW.json","view_paper":"https://pith.science/paper/CYT64POD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.04882&json=true","fetch_graph":"https://pith.science/api/pith-number/CYT64PODGWHYQ53T3IZVMFP3CW/graph.json","fetch_events":"https://pith.science/api/pith-number/CYT64PODGWHYQ53T3IZVMFP3CW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CYT64PODGWHYQ53T3IZVMFP3CW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CYT64PODGWHYQ53T3IZVMFP3CW/action/storage_attestation","attest_author":"https://pith.science/pith/CYT64PODGWHYQ53T3IZVMFP3CW/action/author_attestation","sign_citation":"https://pith.science/pith/CYT64PODGWHYQ53T3IZVMFP3CW/action/citation_signature","submit_replication":"https://pith.science/pith/CYT64PODGWHYQ53T3IZVMFP3CW/action/replication_record"}},"created_at":"2026-05-18T00:08:02.312452+00:00","updated_at":"2026-05-18T00:08:02.312452+00:00"}