{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FXBCGKPUK7JU4WD7S4ZEKC2W6S","short_pith_number":"pith:FXBCGKPU","schema_version":"1.0","canonical_sha256":"2dc22329f457d34e587f9732450b56f485a4c4c0eb21eb90cc6f16c1e399a5be","source":{"kind":"arxiv","id":"2411.03461","version":3},"attestation_state":"computed","paper":{"title":"ADMM for 0/1 D-optimality and Maximum-Entropy Sampling Relaxations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gabriel Ponte, Jon Lee, Luze Xu, Marcia Fampa","submitted_at":"2024-11-05T19:24:30Z","abstract_excerpt":"The 0/1 D-optimality problem and the Maximum-Entropy Sampling problem are two well-known NP-hard discrete maximization problems in experimental design. Algorithms for exact optimization (of moderate-sized instances) are based on branch-and-bound. The best upper-bounding methods are based on convex relaxation. We present ADMM (Alternating Direction Method of Multipliers) algorithms for solving these relaxations and experimentally demonstrate their practical value."},"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":"2411.03461","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-11-05T19:24:30Z","cross_cats_sorted":[],"title_canon_sha256":"c9a3fe350c1fbeff7612e78f61be122db4ee48fc91e86080865eac1081b237b9","abstract_canon_sha256":"a231c6d172be00db7273d272ecf7b5c89c470d902ac54744c5d715e560d6d80b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:28.978454Z","signature_b64":"DQkR4XaExvBYPDJxioNMR/8rPVg/hifHxsCMZx4BxQmlTDr6zgBNkAIfOT8wQ7CuZpUVDNX7sIju/5ZHGAEPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dc22329f457d34e587f9732450b56f485a4c4c0eb21eb90cc6f16c1e399a5be","last_reissued_at":"2026-06-19T16:10:28.978014Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:28.978014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ADMM for 0/1 D-optimality and Maximum-Entropy Sampling Relaxations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gabriel Ponte, Jon Lee, Luze Xu, Marcia Fampa","submitted_at":"2024-11-05T19:24:30Z","abstract_excerpt":"The 0/1 D-optimality problem and the Maximum-Entropy Sampling problem are two well-known NP-hard discrete maximization problems in experimental design. Algorithms for exact optimization (of moderate-sized instances) are based on branch-and-bound. The best upper-bounding methods are based on convex relaxation. We present ADMM (Alternating Direction Method of Multipliers) algorithms for solving these relaxations and experimentally demonstrate their practical value."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03461","kind":"arxiv","version":3},"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/2411.03461/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":"2411.03461","created_at":"2026-06-19T16:10:28.978072+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.03461v3","created_at":"2026-06-19T16:10:28.978072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03461","created_at":"2026-06-19T16:10:28.978072+00:00"},{"alias_kind":"pith_short_12","alias_value":"FXBCGKPUK7JU","created_at":"2026-06-19T16:10:28.978072+00:00"},{"alias_kind":"pith_short_16","alias_value":"FXBCGKPUK7JU4WD7","created_at":"2026-06-19T16:10:28.978072+00:00"},{"alias_kind":"pith_short_8","alias_value":"FXBCGKPU","created_at":"2026-06-19T16:10:28.978072+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.07662","citing_title":"Parameter-Free Non-Ergodic Extragradient Algorithms for Solving Monotone Variational Inequalities","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FXBCGKPUK7JU4WD7S4ZEKC2W6S","json":"https://pith.science/pith/FXBCGKPUK7JU4WD7S4ZEKC2W6S.json","graph_json":"https://pith.science/api/pith-number/FXBCGKPUK7JU4WD7S4ZEKC2W6S/graph.json","events_json":"https://pith.science/api/pith-number/FXBCGKPUK7JU4WD7S4ZEKC2W6S/events.json","paper":"https://pith.science/paper/FXBCGKPU"},"agent_actions":{"view_html":"https://pith.science/pith/FXBCGKPUK7JU4WD7S4ZEKC2W6S","download_json":"https://pith.science/pith/FXBCGKPUK7JU4WD7S4ZEKC2W6S.json","view_paper":"https://pith.science/paper/FXBCGKPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.03461&json=true","fetch_graph":"https://pith.science/api/pith-number/FXBCGKPUK7JU4WD7S4ZEKC2W6S/graph.json","fetch_events":"https://pith.science/api/pith-number/FXBCGKPUK7JU4WD7S4ZEKC2W6S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FXBCGKPUK7JU4WD7S4ZEKC2W6S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FXBCGKPUK7JU4WD7S4ZEKC2W6S/action/storage_attestation","attest_author":"https://pith.science/pith/FXBCGKPUK7JU4WD7S4ZEKC2W6S/action/author_attestation","sign_citation":"https://pith.science/pith/FXBCGKPUK7JU4WD7S4ZEKC2W6S/action/citation_signature","submit_replication":"https://pith.science/pith/FXBCGKPUK7JU4WD7S4ZEKC2W6S/action/replication_record"}},"created_at":"2026-06-19T16:10:28.978072+00:00","updated_at":"2026-06-19T16:10:28.978072+00:00"}