{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:LLOWTIWXDT7LLWJTM7FIBZDQGN","short_pith_number":"pith:LLOWTIWX","schema_version":"1.0","canonical_sha256":"5add69a2d71cfeb5d93367ca80e47033626fb5c6da63318b9c1936a8c2f293dc","source":{"kind":"arxiv","id":"2101.01787","version":1},"attestation_state":"computed","paper":{"title":"Design and Analysis of a Synthetic Prediction Market using Dynamic Convex Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CE","authors_text":"Arjun Menon, Christopher Griffin, C. Lee Giles, Nishanth Nakshatri, Sarah Rajtmajer","submitted_at":"2021-01-05T21:11:13Z","abstract_excerpt":"We present a synthetic prediction market whose agent purchase logic is defined using a sigmoid transformation of a convex semi-algebraic set defined in feature space. Asset prices are determined by a logarithmic scoring market rule. Time varying asset prices affect the structure of the semi-algebraic sets leading to time-varying agent purchase rules. We show that under certain assumptions on the underlying geometry, the resulting synthetic prediction market can be used to arbitrarily closely approximate a binary function defined on a set of input data. We also provide sufficient conditions for"},"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":"2101.01787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2021-01-05T21:11:13Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2b419b30a220c5c38e92611e4dc179606262a9e7db15d513dfa0d7800c1063bb","abstract_canon_sha256":"4c1746fc3152ad6e3b5bd21a1ac4517003bc1952c9557f85d445479fda153136"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:05:00.307050Z","signature_b64":"UjK3SLzcS4reLna8H2LdtyndI7+Rgj3tGe2AkDMMnkvuAgFpzO+aji9FhkOLJ21KQW2wg6moyFcgnlfuVAh5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5add69a2d71cfeb5d93367ca80e47033626fb5c6da63318b9c1936a8c2f293dc","last_reissued_at":"2026-07-05T02:05:00.306633Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:05:00.306633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Design and Analysis of a Synthetic Prediction Market using Dynamic Convex Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CE","authors_text":"Arjun Menon, Christopher Griffin, C. Lee Giles, Nishanth Nakshatri, Sarah Rajtmajer","submitted_at":"2021-01-05T21:11:13Z","abstract_excerpt":"We present a synthetic prediction market whose agent purchase logic is defined using a sigmoid transformation of a convex semi-algebraic set defined in feature space. Asset prices are determined by a logarithmic scoring market rule. Time varying asset prices affect the structure of the semi-algebraic sets leading to time-varying agent purchase rules. We show that under certain assumptions on the underlying geometry, the resulting synthetic prediction market can be used to arbitrarily closely approximate a binary function defined on a set of input data. We also provide sufficient conditions for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.01787","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.01787/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2101.01787","created_at":"2026-07-05T02:05:00.306690+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.01787v1","created_at":"2026-07-05T02:05:00.306690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.01787","created_at":"2026-07-05T02:05:00.306690+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLOWTIWXDT7L","created_at":"2026-07-05T02:05:00.306690+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLOWTIWXDT7LLWJT","created_at":"2026-07-05T02:05:00.306690+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLOWTIWX","created_at":"2026-07-05T02:05:00.306690+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.27394","citing_title":"Human-AI Collaboration for Estimating Scientific Replicability","ref_index":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LLOWTIWXDT7LLWJTM7FIBZDQGN","json":"https://pith.science/pith/LLOWTIWXDT7LLWJTM7FIBZDQGN.json","graph_json":"https://pith.science/api/pith-number/LLOWTIWXDT7LLWJTM7FIBZDQGN/graph.json","events_json":"https://pith.science/api/pith-number/LLOWTIWXDT7LLWJTM7FIBZDQGN/events.json","paper":"https://pith.science/paper/LLOWTIWX"},"agent_actions":{"view_html":"https://pith.science/pith/LLOWTIWXDT7LLWJTM7FIBZDQGN","download_json":"https://pith.science/pith/LLOWTIWXDT7LLWJTM7FIBZDQGN.json","view_paper":"https://pith.science/paper/LLOWTIWX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.01787&json=true","fetch_graph":"https://pith.science/api/pith-number/LLOWTIWXDT7LLWJTM7FIBZDQGN/graph.json","fetch_events":"https://pith.science/api/pith-number/LLOWTIWXDT7LLWJTM7FIBZDQGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLOWTIWXDT7LLWJTM7FIBZDQGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLOWTIWXDT7LLWJTM7FIBZDQGN/action/storage_attestation","attest_author":"https://pith.science/pith/LLOWTIWXDT7LLWJTM7FIBZDQGN/action/author_attestation","sign_citation":"https://pith.science/pith/LLOWTIWXDT7LLWJTM7FIBZDQGN/action/citation_signature","submit_replication":"https://pith.science/pith/LLOWTIWXDT7LLWJTM7FIBZDQGN/action/replication_record"}},"created_at":"2026-07-05T02:05:00.306690+00:00","updated_at":"2026-07-05T02:05:00.306690+00:00"}