{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PPQHVFLF3F5CDHBO6GL6GQSLWG","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":"b9b0821a0fd64ea747c82acdb88271a15bbde88485ef73adad71e5fa5a3918c7","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-11-28T22:17:48Z","title_canon_sha256":"e6065ebfb4bd906cfd19639a1a8d071f5a07f164593eb7974ff1b56cb96c120a"},"schema_version":"1.0","source":{"id":"1711.10588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10588","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10588v1","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10588","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"PPQHVFLF3F5C","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PPQHVFLF3F5CDHBO","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PPQHVFLF","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:7e7d4a7d6e6ad55b11f0bd7cb0229f569db2172abefc15e8eb8c61dd075863e8","target":"graph","created_at":"2026-05-18T00:29:17Z","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 ordinal approximation algorithms for a broad class of utility maximization problems for multi-agent systems. In these problems, agents have utilities for connecting to each other, and the goal is to compute a maximum-utility solution subject to a set of constraints. We represent these as a class of graph optimization problems, including matching, spanning tree problems, TSP, maximum weight planar subgraph, and many others. We study these problems in the ordinal setting: latent numerical utilities exist, but we only have access to ordinal preference information, i.e., every agent sp","authors_text":"Ben Abramowitz, Elliot Anshelevich","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-11-28T22:17:48Z","title":"Utilitarians Without Utilities: Maximizing Social Welfare for Graph Problems using only Ordinal Preferences - Full Version"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10588","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:c291d9b9c4125dfdb17642115f3b76fcbf5fc688ef0ce3631ec34187ee86329a","target":"record","created_at":"2026-05-18T00:29:17Z","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":"b9b0821a0fd64ea747c82acdb88271a15bbde88485ef73adad71e5fa5a3918c7","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-11-28T22:17:48Z","title_canon_sha256":"e6065ebfb4bd906cfd19639a1a8d071f5a07f164593eb7974ff1b56cb96c120a"},"schema_version":"1.0","source":{"id":"1711.10588","kind":"arxiv","version":1}},"canonical_sha256":"7be07a9565d97a219c2ef197e3424bb18b3c577342ab2dfcdb70f089c4abad70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7be07a9565d97a219c2ef197e3424bb18b3c577342ab2dfcdb70f089c4abad70","first_computed_at":"2026-05-18T00:29:17.658042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:17.658042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vbQv3GN0lMcK1Oy5hIcHpQQ+wDaUWE4HdkzJDnLthiQAzxI+7Om9XJhNjLLTWzSGKxDaXrz3IwKTWussVqJ1DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:17.658622Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c291d9b9c4125dfdb17642115f3b76fcbf5fc688ef0ce3631ec34187ee86329a","sha256:7e7d4a7d6e6ad55b11f0bd7cb0229f569db2172abefc15e8eb8c61dd075863e8"],"state_sha256":"10039366f637f672e468c748da8a57038f3c1426c92e4023b243bec6b274bf46"}