{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PPQHVFLF3F5CDHBO6GL6GQSLWG","short_pith_number":"pith:PPQHVFLF","schema_version":"1.0","canonical_sha256":"7be07a9565d97a219c2ef197e3424bb18b3c577342ab2dfcdb70f089c4abad70","source":{"kind":"arxiv","id":"1711.10588","version":1},"attestation_state":"computed","paper":{"title":"Utilitarians Without Utilities: Maximizing Social Welfare for Graph Problems using only Ordinal Preferences - Full Version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.MA","authors_text":"Ben Abramowitz, Elliot Anshelevich","submitted_at":"2017-11-28T22:17:48Z","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"},"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":"1711.10588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-11-28T22:17:48Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"e6065ebfb4bd906cfd19639a1a8d071f5a07f164593eb7974ff1b56cb96c120a","abstract_canon_sha256":"b9b0821a0fd64ea747c82acdb88271a15bbde88485ef73adad71e5fa5a3918c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:17.658622Z","signature_b64":"vbQv3GN0lMcK1Oy5hIcHpQQ+wDaUWE4HdkzJDnLthiQAzxI+7Om9XJhNjLLTWzSGKxDaXrz3IwKTWussVqJ1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7be07a9565d97a219c2ef197e3424bb18b3c577342ab2dfcdb70f089c4abad70","last_reissued_at":"2026-05-18T00:29:17.658042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:17.658042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Utilitarians Without Utilities: Maximizing Social Welfare for Graph Problems using only Ordinal Preferences - Full Version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.MA","authors_text":"Ben Abramowitz, Elliot Anshelevich","submitted_at":"2017-11-28T22:17:48Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10588","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":"1711.10588","created_at":"2026-05-18T00:29:17.658134+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.10588v1","created_at":"2026-05-18T00:29:17.658134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10588","created_at":"2026-05-18T00:29:17.658134+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPQHVFLF3F5C","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPQHVFLF3F5CDHBO","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPQHVFLF","created_at":"2026-05-18T12:31:37.085036+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/PPQHVFLF3F5CDHBO6GL6GQSLWG","json":"https://pith.science/pith/PPQHVFLF3F5CDHBO6GL6GQSLWG.json","graph_json":"https://pith.science/api/pith-number/PPQHVFLF3F5CDHBO6GL6GQSLWG/graph.json","events_json":"https://pith.science/api/pith-number/PPQHVFLF3F5CDHBO6GL6GQSLWG/events.json","paper":"https://pith.science/paper/PPQHVFLF"},"agent_actions":{"view_html":"https://pith.science/pith/PPQHVFLF3F5CDHBO6GL6GQSLWG","download_json":"https://pith.science/pith/PPQHVFLF3F5CDHBO6GL6GQSLWG.json","view_paper":"https://pith.science/paper/PPQHVFLF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.10588&json=true","fetch_graph":"https://pith.science/api/pith-number/PPQHVFLF3F5CDHBO6GL6GQSLWG/graph.json","fetch_events":"https://pith.science/api/pith-number/PPQHVFLF3F5CDHBO6GL6GQSLWG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPQHVFLF3F5CDHBO6GL6GQSLWG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPQHVFLF3F5CDHBO6GL6GQSLWG/action/storage_attestation","attest_author":"https://pith.science/pith/PPQHVFLF3F5CDHBO6GL6GQSLWG/action/author_attestation","sign_citation":"https://pith.science/pith/PPQHVFLF3F5CDHBO6GL6GQSLWG/action/citation_signature","submit_replication":"https://pith.science/pith/PPQHVFLF3F5CDHBO6GL6GQSLWG/action/replication_record"}},"created_at":"2026-05-18T00:29:17.658134+00:00","updated_at":"2026-05-18T00:29:17.658134+00:00"}