{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:44BFW7DC2UBDFHYWSP3BRUSSJC","short_pith_number":"pith:44BFW7DC","schema_version":"1.0","canonical_sha256":"e7025b7c62d502329f1693f618d2524888384ad07d420bf93e8b6bf7ea24100d","source":{"kind":"arxiv","id":"2308.10346","version":1},"attestation_state":"computed","paper":{"title":"An Exact Sampler for Inference after Polyhedral Model Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Sifan Liu","submitted_at":"2023-08-20T19:39:17Z","abstract_excerpt":"Inference after model selection presents computational challenges when dealing with intractable conditional distributions. Markov chain Monte Carlo (MCMC) is a common method for sampling from these distributions, but its slow convergence often limits its practicality. In this work, we introduce a method tailored for selective inference in cases where the selection event can be characterized by a polyhedron. The method transforms the variables constrained by a polyhedron into variables within a unit cube, allowing for efficient sampling using conventional numerical integration techniques. Compa"},"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":"2308.10346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2023-08-20T19:39:17Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"3238416a377d4e3f612e3f745ad6d50ed17ca59ce7a380da0de8b034fc6d7851","abstract_canon_sha256":"5533bc56913e07971a65ca5d1f22826c8c0b087684c5f73c5855ea89fd6a9494"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:43:08.093252Z","signature_b64":"ul6tjMiAlADDwARN0wlznLRDZN4HYTeISZ/3yefXGz7QxfSo8MhCsyOHxzlZSF2B/LyhTasfcrzJ0Y4KAeO+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7025b7c62d502329f1693f618d2524888384ad07d420bf93e8b6bf7ea24100d","last_reissued_at":"2026-07-05T06:43:08.092804Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:43:08.092804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Exact Sampler for Inference after Polyhedral Model Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Sifan Liu","submitted_at":"2023-08-20T19:39:17Z","abstract_excerpt":"Inference after model selection presents computational challenges when dealing with intractable conditional distributions. Markov chain Monte Carlo (MCMC) is a common method for sampling from these distributions, but its slow convergence often limits its practicality. In this work, we introduce a method tailored for selective inference in cases where the selection event can be characterized by a polyhedron. The method transforms the variables constrained by a polyhedron into variables within a unit cube, allowing for efficient sampling using conventional numerical integration techniques. Compa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.10346","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/2308.10346/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":"2308.10346","created_at":"2026-07-05T06:43:08.092857+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.10346v1","created_at":"2026-07-05T06:43:08.092857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.10346","created_at":"2026-07-05T06:43:08.092857+00:00"},{"alias_kind":"pith_short_12","alias_value":"44BFW7DC2UBD","created_at":"2026-07-05T06:43:08.092857+00:00"},{"alias_kind":"pith_short_16","alias_value":"44BFW7DC2UBDFHYW","created_at":"2026-07-05T06:43:08.092857+00:00"},{"alias_kind":"pith_short_8","alias_value":"44BFW7DC","created_at":"2026-07-05T06:43:08.092857+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.01150","citing_title":"Flexible Selective Inference with Flow-based Transport Maps","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/44BFW7DC2UBDFHYWSP3BRUSSJC","json":"https://pith.science/pith/44BFW7DC2UBDFHYWSP3BRUSSJC.json","graph_json":"https://pith.science/api/pith-number/44BFW7DC2UBDFHYWSP3BRUSSJC/graph.json","events_json":"https://pith.science/api/pith-number/44BFW7DC2UBDFHYWSP3BRUSSJC/events.json","paper":"https://pith.science/paper/44BFW7DC"},"agent_actions":{"view_html":"https://pith.science/pith/44BFW7DC2UBDFHYWSP3BRUSSJC","download_json":"https://pith.science/pith/44BFW7DC2UBDFHYWSP3BRUSSJC.json","view_paper":"https://pith.science/paper/44BFW7DC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.10346&json=true","fetch_graph":"https://pith.science/api/pith-number/44BFW7DC2UBDFHYWSP3BRUSSJC/graph.json","fetch_events":"https://pith.science/api/pith-number/44BFW7DC2UBDFHYWSP3BRUSSJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/44BFW7DC2UBDFHYWSP3BRUSSJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/44BFW7DC2UBDFHYWSP3BRUSSJC/action/storage_attestation","attest_author":"https://pith.science/pith/44BFW7DC2UBDFHYWSP3BRUSSJC/action/author_attestation","sign_citation":"https://pith.science/pith/44BFW7DC2UBDFHYWSP3BRUSSJC/action/citation_signature","submit_replication":"https://pith.science/pith/44BFW7DC2UBDFHYWSP3BRUSSJC/action/replication_record"}},"created_at":"2026-07-05T06:43:08.092857+00:00","updated_at":"2026-07-05T06:43:08.092857+00:00"}