{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IKRBNYK26P32X2DDQS6XNPRKFN","short_pith_number":"pith:IKRBNYK2","canonical_record":{"source":{"id":"1203.3509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:17:56Z","cross_cats_sorted":[],"title_canon_sha256":"e9f0e4ce6325b47af40b48bf77d7626822132486645fb09f0bb2373131f88932","abstract_canon_sha256":"00899bff6cc87be7f352670c1d6a241f9bf6d0717ae8c0083a925abd4e4bcd51"},"schema_version":"1.0"},"canonical_sha256":"42a216e15af3f7abe86384bd76be2a2b5de6cb036e3d769ec0f6ccbbdc413b44","source":{"kind":"arxiv","id":"1203.3509","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3509","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3509v1","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3509","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"IKRBNYK26P32","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IKRBNYK26P32X2DD","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IKRBNYK2","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IKRBNYK26P32X2DDQS6XNPRKFN","target":"record","payload":{"canonical_record":{"source":{"id":"1203.3509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:17:56Z","cross_cats_sorted":[],"title_canon_sha256":"e9f0e4ce6325b47af40b48bf77d7626822132486645fb09f0bb2373131f88932","abstract_canon_sha256":"00899bff6cc87be7f352670c1d6a241f9bf6d0717ae8c0083a925abd4e4bcd51"},"schema_version":"1.0"},"canonical_sha256":"42a216e15af3f7abe86384bd76be2a2b5de6cb036e3d769ec0f6ccbbdc413b44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:00.083600Z","signature_b64":"pzPLKCSrrtaMa00IzXzeaKwanT/Vzd+KyO9q8vKrNIozrYIXr5ZzAfRWpuJ9nQOAIS3GhWqhD+wgFlCvg+r3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42a216e15af3f7abe86384bd76be2a2b5de6cb036e3d769ec0f6ccbbdc413b44","last_reissued_at":"2026-05-18T04:00:00.082505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:00.082505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.3509","source_version":1,"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:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rXW8kqpMs3n0oRqCR8fJUaw/V6C/JW974jsb1fCvmIwPLwsZH2pH2Gr4oJeiRA7NcK4bu89X5t5R4skMygl/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:20:50.879628Z"},"content_sha256":"8e6b85ecfc2753888234f6ca6d077e35a88d52d70e49150137d2fc7449307181","schema_version":"1.0","event_id":"sha256:8e6b85ecfc2753888234f6ca6d077e35a88d52d70e49150137d2fc7449307181"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IKRBNYK26P32X2DDQS6XNPRKFN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterizing the Set of Coherent Lower Previsions with a Finite Number of Constraints or Vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Erik Quaeghebeur","submitted_at":"2012-03-15T11:17:56Z","abstract_excerpt":"The standard coherence criterion for lower previsions is expressed using an infinite number of linear constraints. For lower previsions that are essentially defined on some finite set of gambles on a finite possibility space, we present a reformulation of this criterion that only uses a finite number of constraints. Any such lower prevision is coherent if it lies within the convex polytope defined by these constraints. The vertices of this polytope are the extreme coherent lower previsions for the given set of gambles. Our reformulation makes it possible to compute them. We show how this is do"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3509","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"},"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:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BnwDS1PWtGc2cHRA+8PJMueOb4OE5vVu/uky0tLuoOdApQuwAxs/turysN2v7PST02ye/5Ol6NXeDGapMjzgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:20:50.879974Z"},"content_sha256":"b5832cfcb4ff360380a6058a8706983bbcdfa782a36d8ddf73b624590a78b6f3","schema_version":"1.0","event_id":"sha256:b5832cfcb4ff360380a6058a8706983bbcdfa782a36d8ddf73b624590a78b6f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IKRBNYK26P32X2DDQS6XNPRKFN/bundle.json","state_url":"https://pith.science/pith/IKRBNYK26P32X2DDQS6XNPRKFN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IKRBNYK26P32X2DDQS6XNPRKFN/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-22T23:20:50Z","links":{"resolver":"https://pith.science/pith/IKRBNYK26P32X2DDQS6XNPRKFN","bundle":"https://pith.science/pith/IKRBNYK26P32X2DDQS6XNPRKFN/bundle.json","state":"https://pith.science/pith/IKRBNYK26P32X2DDQS6XNPRKFN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IKRBNYK26P32X2DDQS6XNPRKFN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IKRBNYK26P32X2DDQS6XNPRKFN","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":"00899bff6cc87be7f352670c1d6a241f9bf6d0717ae8c0083a925abd4e4bcd51","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:17:56Z","title_canon_sha256":"e9f0e4ce6325b47af40b48bf77d7626822132486645fb09f0bb2373131f88932"},"schema_version":"1.0","source":{"id":"1203.3509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3509","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3509v1","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3509","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"IKRBNYK26P32","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IKRBNYK26P32X2DD","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IKRBNYK2","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:b5832cfcb4ff360380a6058a8706983bbcdfa782a36d8ddf73b624590a78b6f3","target":"graph","created_at":"2026-05-18T04:00:00Z","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":"The standard coherence criterion for lower previsions is expressed using an infinite number of linear constraints. For lower previsions that are essentially defined on some finite set of gambles on a finite possibility space, we present a reformulation of this criterion that only uses a finite number of constraints. Any such lower prevision is coherent if it lies within the convex polytope defined by these constraints. The vertices of this polytope are the extreme coherent lower previsions for the given set of gambles. Our reformulation makes it possible to compute them. We show how this is do","authors_text":"Erik Quaeghebeur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:17:56Z","title":"Characterizing the Set of Coherent Lower Previsions with a Finite Number of Constraints or Vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3509","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:8e6b85ecfc2753888234f6ca6d077e35a88d52d70e49150137d2fc7449307181","target":"record","created_at":"2026-05-18T04:00:00Z","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":"00899bff6cc87be7f352670c1d6a241f9bf6d0717ae8c0083a925abd4e4bcd51","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:17:56Z","title_canon_sha256":"e9f0e4ce6325b47af40b48bf77d7626822132486645fb09f0bb2373131f88932"},"schema_version":"1.0","source":{"id":"1203.3509","kind":"arxiv","version":1}},"canonical_sha256":"42a216e15af3f7abe86384bd76be2a2b5de6cb036e3d769ec0f6ccbbdc413b44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42a216e15af3f7abe86384bd76be2a2b5de6cb036e3d769ec0f6ccbbdc413b44","first_computed_at":"2026-05-18T04:00:00.082505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:00.082505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pzPLKCSrrtaMa00IzXzeaKwanT/Vzd+KyO9q8vKrNIozrYIXr5ZzAfRWpuJ9nQOAIS3GhWqhD+wgFlCvg+r3Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:00.083600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3509","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e6b85ecfc2753888234f6ca6d077e35a88d52d70e49150137d2fc7449307181","sha256:b5832cfcb4ff360380a6058a8706983bbcdfa782a36d8ddf73b624590a78b6f3"],"state_sha256":"2d53082df458a429a1d81c207ab244172c8a4e59e4bbb1fa11215df7814d04a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MBAeg3DXMA7wkCArOHAzU9/LZFEZPqdtP63FtX/7WleJLzrwvME7NfhFmS13L/SilPZTGj9y8YhonrozpahHBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:20:50.881887Z","bundle_sha256":"b6e1e9f151071cfb905c5b86db3653d82131fa8055ba543c594f7382b817eb83"}}