{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LFR6SN7CSBPOZRWVVUQFXTJS3G","short_pith_number":"pith:LFR6SN7C","canonical_record":{"source":{"id":"1605.04674","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-05-16T08:15:28Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9aadaa0b6a6da0ebd5470b182b020f361adbaa52dbb740a2e6534838e741e8e3","abstract_canon_sha256":"407e90b68144097bc727dc5e1107f5a776dd0f7f1a1af75688f19583cc4045e5"},"schema_version":"1.0"},"canonical_sha256":"5963e937e2905eecc6d5ad205bcd32d9a0059edbf31b6c2093256fe4e72e16d4","source":{"kind":"arxiv","id":"1605.04674","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04674","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04674v1","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04674","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"pith_short_12","alias_value":"LFR6SN7CSBPO","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LFR6SN7CSBPOZRWV","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LFR6SN7C","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LFR6SN7CSBPOZRWVVUQFXTJS3G","target":"record","payload":{"canonical_record":{"source":{"id":"1605.04674","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-05-16T08:15:28Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9aadaa0b6a6da0ebd5470b182b020f361adbaa52dbb740a2e6534838e741e8e3","abstract_canon_sha256":"407e90b68144097bc727dc5e1107f5a776dd0f7f1a1af75688f19583cc4045e5"},"schema_version":"1.0"},"canonical_sha256":"5963e937e2905eecc6d5ad205bcd32d9a0059edbf31b6c2093256fe4e72e16d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:46.552751Z","signature_b64":"rM0KdwTsJ6VWFF2Mbk9nD+eakZE82arV06rYuo0+qlKIahb8XDUOPIQuCdF/wurNYlOuP5CKmzwol0hxauKjAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5963e937e2905eecc6d5ad205bcd32d9a0059edbf31b6c2093256fe4e72e16d4","last_reissued_at":"2026-05-18T01:14:46.551985Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:46.551985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.04674","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-18T01:14:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0CXwiBU9sMprQPHLFLyAAtogGbCVUgiHfSW4pTDDhje6afgTZd4YXX1Q2H/MDhdx8yyzmeSQOamU8vYji5BCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T15:04:52.678537Z"},"content_sha256":"332664215d24cfab7039edecf85784ee6511f8119d7c50a77ff8416e0aa5acf7","schema_version":"1.0","event_id":"sha256:332664215d24cfab7039edecf85784ee6511f8119d7c50a77ff8416e0aa5acf7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LFR6SN7CSBPOZRWVVUQFXTJS3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An almost ideal coordination mechanism for unrelated machine scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.GT","authors_text":"Angelo Fanelli, Ioannis Caragiannis","submitted_at":"2016-05-16T08:15:28Z","abstract_excerpt":"Coordination mechanisms aim to mitigate the impact of selfishness when scheduling jobs to different machines. Such a mechanism defines a scheduling policy within each machine and naturally induces a game among the selfish job owners. The desirable properties of a coordination mechanism includes simplicity in its definition and efficiency of the outcomes of the induced game. We present a broad class of coordination mechanisms for unrelated machine scheduling that are simple to define and we identify one of its members (mechanism \\Dcoord) that is superior to all known mechanisms. \\Dcoord\\ induce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04674","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-18T01:14:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G05twjFnylg1dVBFXZVSnJZz+yRQZGarawMOhhxum9F/ltL1fwKCV0vgXjLOgtxgBsNHhom1HgXwBAEC41ccBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T15:04:52.679146Z"},"content_sha256":"06d57142b8563138b77beb34984131348dcc8c6f0f8cce312be8c85090c265d7","schema_version":"1.0","event_id":"sha256:06d57142b8563138b77beb34984131348dcc8c6f0f8cce312be8c85090c265d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFR6SN7CSBPOZRWVVUQFXTJS3G/bundle.json","state_url":"https://pith.science/pith/LFR6SN7CSBPOZRWVVUQFXTJS3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFR6SN7CSBPOZRWVVUQFXTJS3G/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-05-22T15:04:52Z","links":{"resolver":"https://pith.science/pith/LFR6SN7CSBPOZRWVVUQFXTJS3G","bundle":"https://pith.science/pith/LFR6SN7CSBPOZRWVVUQFXTJS3G/bundle.json","state":"https://pith.science/pith/LFR6SN7CSBPOZRWVVUQFXTJS3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFR6SN7CSBPOZRWVVUQFXTJS3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LFR6SN7CSBPOZRWVVUQFXTJS3G","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":"407e90b68144097bc727dc5e1107f5a776dd0f7f1a1af75688f19583cc4045e5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-05-16T08:15:28Z","title_canon_sha256":"9aadaa0b6a6da0ebd5470b182b020f361adbaa52dbb740a2e6534838e741e8e3"},"schema_version":"1.0","source":{"id":"1605.04674","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04674","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04674v1","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04674","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"pith_short_12","alias_value":"LFR6SN7CSBPO","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LFR6SN7CSBPOZRWV","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LFR6SN7C","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:06d57142b8563138b77beb34984131348dcc8c6f0f8cce312be8c85090c265d7","target":"graph","created_at":"2026-05-18T01:14:46Z","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":"Coordination mechanisms aim to mitigate the impact of selfishness when scheduling jobs to different machines. Such a mechanism defines a scheduling policy within each machine and naturally induces a game among the selfish job owners. The desirable properties of a coordination mechanism includes simplicity in its definition and efficiency of the outcomes of the induced game. We present a broad class of coordination mechanisms for unrelated machine scheduling that are simple to define and we identify one of its members (mechanism \\Dcoord) that is superior to all known mechanisms. \\Dcoord\\ induce","authors_text":"Angelo Fanelli, Ioannis Caragiannis","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-05-16T08:15:28Z","title":"An almost ideal coordination mechanism for unrelated machine scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04674","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:332664215d24cfab7039edecf85784ee6511f8119d7c50a77ff8416e0aa5acf7","target":"record","created_at":"2026-05-18T01:14:46Z","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":"407e90b68144097bc727dc5e1107f5a776dd0f7f1a1af75688f19583cc4045e5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-05-16T08:15:28Z","title_canon_sha256":"9aadaa0b6a6da0ebd5470b182b020f361adbaa52dbb740a2e6534838e741e8e3"},"schema_version":"1.0","source":{"id":"1605.04674","kind":"arxiv","version":1}},"canonical_sha256":"5963e937e2905eecc6d5ad205bcd32d9a0059edbf31b6c2093256fe4e72e16d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5963e937e2905eecc6d5ad205bcd32d9a0059edbf31b6c2093256fe4e72e16d4","first_computed_at":"2026-05-18T01:14:46.551985Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:46.551985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rM0KdwTsJ6VWFF2Mbk9nD+eakZE82arV06rYuo0+qlKIahb8XDUOPIQuCdF/wurNYlOuP5CKmzwol0hxauKjAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:46.552751Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04674","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:332664215d24cfab7039edecf85784ee6511f8119d7c50a77ff8416e0aa5acf7","sha256:06d57142b8563138b77beb34984131348dcc8c6f0f8cce312be8c85090c265d7"],"state_sha256":"f4f6c6d08204e4ee6da8cbd29f208840f5df58a537c857c2c043ab175b60f240"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HIjhLzJCciWon5FtpaxpUXzrJgLaW2NPhEVyZH0gMRo186FnyxDbtFqgP8oOnqTpxwvm/RNoyz9UbB8SgagNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T15:04:52.681680Z","bundle_sha256":"cb20350df076bcc279fe0af6bc15c414d8f40eef11d9e1043139b01bf6af5543"}}