{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:S4HELSWSABJTCPBMWXONBE2VF3","short_pith_number":"pith:S4HELSWS","canonical_record":{"source":{"id":"1010.1886","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-10-10T01:59:36Z","cross_cats_sorted":["cs.DS","cs.MA"],"title_canon_sha256":"0e279782d68c105315003d6b1b8ed389c85258d3dfbf68e9aa1c4ac870c3a3cf","abstract_canon_sha256":"f5183035f2724e3285d9998433c85a48b766f0fe5bd336be3f2cf5996af2619f"},"schema_version":"1.0"},"canonical_sha256":"970e45cad20053313c2cb5dcd093552ee147fb18d3a10eed5eeaae282ed491b4","source":{"kind":"arxiv","id":"1010.1886","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1886","created_at":"2026-05-18T04:32:45Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1886v3","created_at":"2026-05-18T04:32:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1886","created_at":"2026-05-18T04:32:45Z"},{"alias_kind":"pith_short_12","alias_value":"S4HELSWSABJT","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"S4HELSWSABJTCPBM","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"S4HELSWS","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:S4HELSWSABJTCPBMWXONBE2VF3","target":"record","payload":{"canonical_record":{"source":{"id":"1010.1886","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-10-10T01:59:36Z","cross_cats_sorted":["cs.DS","cs.MA"],"title_canon_sha256":"0e279782d68c105315003d6b1b8ed389c85258d3dfbf68e9aa1c4ac870c3a3cf","abstract_canon_sha256":"f5183035f2724e3285d9998433c85a48b766f0fe5bd336be3f2cf5996af2619f"},"schema_version":"1.0"},"canonical_sha256":"970e45cad20053313c2cb5dcd093552ee147fb18d3a10eed5eeaae282ed491b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:45.467958Z","signature_b64":"cth23fpPmoJv1lR2GxVXSuJl0Om9l1tYKjVzv1q97gk2XImDyzCs2F2lsuY+Kjh4UQQufyk8w+hhc2HYC0wICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"970e45cad20053313c2cb5dcd093552ee147fb18d3a10eed5eeaae282ed491b4","last_reissued_at":"2026-05-18T04:32:45.467425Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:45.467425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.1886","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:32:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/TRCkYV9GBxKy8wU7HKrTGY/nXAwm0AbO/QS+P7O98MpP7YiYhKXaJPLQrOTK/qgJfE3O4yPjV7QrT7C5TxTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:13:01.930018Z"},"content_sha256":"985ad92aac8ce5eae7812c71a046f7d72e9ba3efcd8d972d51e8e46956abe906","schema_version":"1.0","event_id":"sha256:985ad92aac8ce5eae7812c71a046f7d72e9ba3efcd8d972d51e8e46956abe906"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:S4HELSWSABJTCPBMWXONBE2VF3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inner Product Spaces for MinSum Coordination Mechanisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.MA"],"primary_cat":"cs.GT","authors_text":"Jos\\'e R. Correa (2) Vasilis Gkatzelis (1), MIT), Neil Olver (4) ((1) Courant Institute, New York (4) Department of Mathematics, New York University (2) Departamento de Ingenier\\'ia Industrial, Richard Cole (1), Universidad de Chile (3) Google Research, Vahab Mirrokni (3)","submitted_at":"2010-10-10T01:59:36Z","abstract_excerpt":"We study policies aiming to minimize the weighted sum of completion times of jobs in the context of coordination mechanisms for selfish scheduling problems. Our goal is to design local policies that achieve a good price of anarchy in the resulting equilibria for unrelated machine scheduling. To obtain the approximation bounds, we introduce a new technique that while conceptually simple, seems to be quite powerful. With this method we are able to prove the following results.\n  First, we consider Smith's Rule, which orders the jobs on a machine in ascending processing time to weight ratio, and s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1886","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:32:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kjNVdZHHWLAB9QuYvcDZuvNUSOoEryvVjbNMb0eQ+0MDB8EKlswyY8dBPPpbhYaszNw7luzJ5IN4mb9HgdKqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:13:01.930415Z"},"content_sha256":"204bd2e45cec980a00c59515b9aae33d6b989b24eb27363487305949c0a122ad","schema_version":"1.0","event_id":"sha256:204bd2e45cec980a00c59515b9aae33d6b989b24eb27363487305949c0a122ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4HELSWSABJTCPBMWXONBE2VF3/bundle.json","state_url":"https://pith.science/pith/S4HELSWSABJTCPBMWXONBE2VF3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4HELSWSABJTCPBMWXONBE2VF3/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-11T12:13:01Z","links":{"resolver":"https://pith.science/pith/S4HELSWSABJTCPBMWXONBE2VF3","bundle":"https://pith.science/pith/S4HELSWSABJTCPBMWXONBE2VF3/bundle.json","state":"https://pith.science/pith/S4HELSWSABJTCPBMWXONBE2VF3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4HELSWSABJTCPBMWXONBE2VF3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:S4HELSWSABJTCPBMWXONBE2VF3","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":"f5183035f2724e3285d9998433c85a48b766f0fe5bd336be3f2cf5996af2619f","cross_cats_sorted":["cs.DS","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-10-10T01:59:36Z","title_canon_sha256":"0e279782d68c105315003d6b1b8ed389c85258d3dfbf68e9aa1c4ac870c3a3cf"},"schema_version":"1.0","source":{"id":"1010.1886","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1886","created_at":"2026-05-18T04:32:45Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1886v3","created_at":"2026-05-18T04:32:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1886","created_at":"2026-05-18T04:32:45Z"},{"alias_kind":"pith_short_12","alias_value":"S4HELSWSABJT","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"S4HELSWSABJTCPBM","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"S4HELSWS","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:204bd2e45cec980a00c59515b9aae33d6b989b24eb27363487305949c0a122ad","target":"graph","created_at":"2026-05-18T04:32:45Z","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 study policies aiming to minimize the weighted sum of completion times of jobs in the context of coordination mechanisms for selfish scheduling problems. Our goal is to design local policies that achieve a good price of anarchy in the resulting equilibria for unrelated machine scheduling. To obtain the approximation bounds, we introduce a new technique that while conceptually simple, seems to be quite powerful. With this method we are able to prove the following results.\n  First, we consider Smith's Rule, which orders the jobs on a machine in ascending processing time to weight ratio, and s","authors_text":"Jos\\'e R. Correa (2) Vasilis Gkatzelis (1), MIT), Neil Olver (4) ((1) Courant Institute, New York (4) Department of Mathematics, New York University (2) Departamento de Ingenier\\'ia Industrial, Richard Cole (1), Universidad de Chile (3) Google Research, Vahab Mirrokni (3)","cross_cats":["cs.DS","cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-10-10T01:59:36Z","title":"Inner Product Spaces for MinSum Coordination Mechanisms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1886","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:985ad92aac8ce5eae7812c71a046f7d72e9ba3efcd8d972d51e8e46956abe906","target":"record","created_at":"2026-05-18T04:32:45Z","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":"f5183035f2724e3285d9998433c85a48b766f0fe5bd336be3f2cf5996af2619f","cross_cats_sorted":["cs.DS","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-10-10T01:59:36Z","title_canon_sha256":"0e279782d68c105315003d6b1b8ed389c85258d3dfbf68e9aa1c4ac870c3a3cf"},"schema_version":"1.0","source":{"id":"1010.1886","kind":"arxiv","version":3}},"canonical_sha256":"970e45cad20053313c2cb5dcd093552ee147fb18d3a10eed5eeaae282ed491b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"970e45cad20053313c2cb5dcd093552ee147fb18d3a10eed5eeaae282ed491b4","first_computed_at":"2026-05-18T04:32:45.467425Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:45.467425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cth23fpPmoJv1lR2GxVXSuJl0Om9l1tYKjVzv1q97gk2XImDyzCs2F2lsuY+Kjh4UQQufyk8w+hhc2HYC0wICw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:45.467958Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.1886","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:985ad92aac8ce5eae7812c71a046f7d72e9ba3efcd8d972d51e8e46956abe906","sha256:204bd2e45cec980a00c59515b9aae33d6b989b24eb27363487305949c0a122ad"],"state_sha256":"67430b475899f7d942501b6606eabf0a49595d98cd9726da3de773d1037a8854"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lZjNo6YA8PWKxNxAbTEQ289zYSud/Xi0MV4MFp7Oz2N6ZoWXiLxBrPPEfYttFUu8MF0p8IBGyG1rRYGwwDpVCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:13:01.937722Z","bundle_sha256":"c261cf2a1c48e8fae9dd3279d39f16db60089ae18fd47a13de2e83d2088f4838"}}