{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YLYWPW77JKW5MTWOQKU6UYSCSP","short_pith_number":"pith:YLYWPW77","canonical_record":{"source":{"id":"1711.06740","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-17T21:59:36Z","cross_cats_sorted":[],"title_canon_sha256":"40e2042766ee108b764292e571770d69a1caa1abad2b615b154144f7580f6507","abstract_canon_sha256":"69a30025e1f739d909f4d0f8564cf12d38d1492e400b55e70a048904a55b8914"},"schema_version":"1.0"},"canonical_sha256":"c2f167dbff4aadd64ece82a9ea624293fd89b305fc4d20d84c89b241a215dbcc","source":{"kind":"arxiv","id":"1711.06740","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06740","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06740v2","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06740","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"pith_short_12","alias_value":"YLYWPW77JKW5","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YLYWPW77JKW5MTWO","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YLYWPW77","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YLYWPW77JKW5MTWOQKU6UYSCSP","target":"record","payload":{"canonical_record":{"source":{"id":"1711.06740","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-17T21:59:36Z","cross_cats_sorted":[],"title_canon_sha256":"40e2042766ee108b764292e571770d69a1caa1abad2b615b154144f7580f6507","abstract_canon_sha256":"69a30025e1f739d909f4d0f8564cf12d38d1492e400b55e70a048904a55b8914"},"schema_version":"1.0"},"canonical_sha256":"c2f167dbff4aadd64ece82a9ea624293fd89b305fc4d20d84c89b241a215dbcc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:45.184230Z","signature_b64":"hP2atQcXhI06j1YH4WBvCzDma5Y0SzTgIuTUjSgkXnqpzbaUt8wmKeekTRbPUusjNk465bY6C4/Q81gbeVvTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2f167dbff4aadd64ece82a9ea624293fd89b305fc4d20d84c89b241a215dbcc","last_reissued_at":"2026-05-18T00:29:45.183614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:45.183614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.06740","source_version":2,"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-18T00:29:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QFpiF3pFMqX+zI4/t0TVmXT+sFAjGGffPP689z7fLh07Dv+Sx5nLgJkYQNw02COeSM2mbwSBhxpIgLQRAkB5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:50:30.977700Z"},"content_sha256":"d603ec19c04d4d52f9563b13650373ef7afa9dfbfae8d861055d7525fa9a9777","schema_version":"1.0","event_id":"sha256:d603ec19c04d4d52f9563b13650373ef7afa9dfbfae8d861055d7525fa9a9777"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YLYWPW77JKW5MTWOQKU6UYSCSP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Gathering with Peers: Submodular Optimization with Peer-Prediction Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Adish Singla, Andreas Krause, Boi Faltings, Goran Radanovic","submitted_at":"2017-11-17T21:59:36Z","abstract_excerpt":"We study a problem of optimal information gathering from multiple data providers that need to be incentivized to provide accurate information. This problem arises in many real world applications that rely on crowdsourced data sets, but where the process of obtaining data is costly. A notable example of such a scenario is crowd sensing. To this end, we formulate the problem of optimal information gathering as maximization of a submodular function under a budget constraint, where the budget represents the total expected payment to data providers. Contrary to the existing approaches, we base our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06740","kind":"arxiv","version":2},"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-18T00:29:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jdP/kCRZNzvTt07TLmQ0RjxgPaQUtBM68VlG+5hmwX4+T9QZChl3v1crVxei3Yv3bTeTLcrsQ07xYgxJHSIwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:50:30.978143Z"},"content_sha256":"acf461ff6f09a621a7d84c17ab996dc7940a270ef42a08a1727144043b7f94e3","schema_version":"1.0","event_id":"sha256:acf461ff6f09a621a7d84c17ab996dc7940a270ef42a08a1727144043b7f94e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YLYWPW77JKW5MTWOQKU6UYSCSP/bundle.json","state_url":"https://pith.science/pith/YLYWPW77JKW5MTWOQKU6UYSCSP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YLYWPW77JKW5MTWOQKU6UYSCSP/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-26T15:50:30Z","links":{"resolver":"https://pith.science/pith/YLYWPW77JKW5MTWOQKU6UYSCSP","bundle":"https://pith.science/pith/YLYWPW77JKW5MTWOQKU6UYSCSP/bundle.json","state":"https://pith.science/pith/YLYWPW77JKW5MTWOQKU6UYSCSP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YLYWPW77JKW5MTWOQKU6UYSCSP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YLYWPW77JKW5MTWOQKU6UYSCSP","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":"69a30025e1f739d909f4d0f8564cf12d38d1492e400b55e70a048904a55b8914","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-17T21:59:36Z","title_canon_sha256":"40e2042766ee108b764292e571770d69a1caa1abad2b615b154144f7580f6507"},"schema_version":"1.0","source":{"id":"1711.06740","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06740","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06740v2","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06740","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"pith_short_12","alias_value":"YLYWPW77JKW5","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YLYWPW77JKW5MTWO","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YLYWPW77","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:acf461ff6f09a621a7d84c17ab996dc7940a270ef42a08a1727144043b7f94e3","target":"graph","created_at":"2026-05-18T00:29: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 a problem of optimal information gathering from multiple data providers that need to be incentivized to provide accurate information. This problem arises in many real world applications that rely on crowdsourced data sets, but where the process of obtaining data is costly. A notable example of such a scenario is crowd sensing. To this end, we formulate the problem of optimal information gathering as maximization of a submodular function under a budget constraint, where the budget represents the total expected payment to data providers. Contrary to the existing approaches, we base our ","authors_text":"Adish Singla, Andreas Krause, Boi Faltings, Goran Radanovic","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-17T21:59:36Z","title":"Information Gathering with Peers: Submodular Optimization with Peer-Prediction Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06740","kind":"arxiv","version":2},"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:d603ec19c04d4d52f9563b13650373ef7afa9dfbfae8d861055d7525fa9a9777","target":"record","created_at":"2026-05-18T00:29: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":"69a30025e1f739d909f4d0f8564cf12d38d1492e400b55e70a048904a55b8914","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-17T21:59:36Z","title_canon_sha256":"40e2042766ee108b764292e571770d69a1caa1abad2b615b154144f7580f6507"},"schema_version":"1.0","source":{"id":"1711.06740","kind":"arxiv","version":2}},"canonical_sha256":"c2f167dbff4aadd64ece82a9ea624293fd89b305fc4d20d84c89b241a215dbcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2f167dbff4aadd64ece82a9ea624293fd89b305fc4d20d84c89b241a215dbcc","first_computed_at":"2026-05-18T00:29:45.183614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:45.183614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hP2atQcXhI06j1YH4WBvCzDma5Y0SzTgIuTUjSgkXnqpzbaUt8wmKeekTRbPUusjNk465bY6C4/Q81gbeVvTCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:45.184230Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06740","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d603ec19c04d4d52f9563b13650373ef7afa9dfbfae8d861055d7525fa9a9777","sha256:acf461ff6f09a621a7d84c17ab996dc7940a270ef42a08a1727144043b7f94e3"],"state_sha256":"805151dc9550b12edc7d086d13ef089faf6eed95d0be5294335f22aa293b6a4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1PQdHpAAsoGu+iZS8bam+f0g1mmJmKfqhnJr/CyRKONsblQJ2gqY1AQzoLFYAzd9j65fuETz7uAcT/2zjQv+DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:50:30.981339Z","bundle_sha256":"384a54babfdd5163203f0281eb0846f7508cbd4693a18486fc17e48169f0557d"}}