{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:FXBCGKPUK7JU4WD7S4ZEKC2W6S","short_pith_number":"pith:FXBCGKPU","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"},"canonical_sha256":"2dc22329f457d34e587f9732450b56f485a4c4c0eb21eb90cc6f16c1e399a5be","source":{"kind":"arxiv","id":"2411.03461","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.03461","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"arxiv_version","alias_value":"2411.03461v3","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03461","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"pith_short_12","alias_value":"FXBCGKPUK7JU","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"pith_short_16","alias_value":"FXBCGKPUK7JU4WD7","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"pith_short_8","alias_value":"FXBCGKPU","created_at":"2026-06-19T16:10:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:FXBCGKPUK7JU4WD7S4ZEKC2W6S","target":"record","payload":{"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"},"canonical_sha256":"2dc22329f457d34e587f9732450b56f485a4c4c0eb21eb90cc6f16c1e399a5be","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"},"source_kind":"arxiv","source_id":"2411.03461","source_version":3,"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-06-19T16:10:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S0IizxiiCPZS5kIOavlI2vOLyyvbE9/XOVTj3vn4EbEFF0SmpGovJTITUHQ15M7Fd0CaYZPQeirbQHTczDHTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:01:43.311689Z"},"content_sha256":"63350af7995f88b861bda06ef49d38ccbc285cf75c5ae5478dc5c75dcbad10a7","schema_version":"1.0","event_id":"sha256:63350af7995f88b861bda06ef49d38ccbc285cf75c5ae5478dc5c75dcbad10a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:FXBCGKPUK7JU4WD7S4ZEKC2W6S","target":"graph","payload":{"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"},"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-06-19T16:10:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lQQ09owOOY6B2rTtcOfYuaOiNlgCXx/2LrgZ0G33TIzmI81k1dCFnaQhgFVvRP2s42tLVhDr/horbTJ6eTAdDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:01:43.312063Z"},"content_sha256":"9ff5ebef909f9b938262551c24c698af86281b611885d0bbe8f395e3918972c2","schema_version":"1.0","event_id":"sha256:9ff5ebef909f9b938262551c24c698af86281b611885d0bbe8f395e3918972c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FXBCGKPUK7JU4WD7S4ZEKC2W6S/bundle.json","state_url":"https://pith.science/pith/FXBCGKPUK7JU4WD7S4ZEKC2W6S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FXBCGKPUK7JU4WD7S4ZEKC2W6S/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-25T23:01:43Z","links":{"resolver":"https://pith.science/pith/FXBCGKPUK7JU4WD7S4ZEKC2W6S","bundle":"https://pith.science/pith/FXBCGKPUK7JU4WD7S4ZEKC2W6S/bundle.json","state":"https://pith.science/pith/FXBCGKPUK7JU4WD7S4ZEKC2W6S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FXBCGKPUK7JU4WD7S4ZEKC2W6S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:FXBCGKPUK7JU4WD7S4ZEKC2W6S","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":"a231c6d172be00db7273d272ecf7b5c89c470d902ac54744c5d715e560d6d80b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-11-05T19:24:30Z","title_canon_sha256":"c9a3fe350c1fbeff7612e78f61be122db4ee48fc91e86080865eac1081b237b9"},"schema_version":"1.0","source":{"id":"2411.03461","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.03461","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"arxiv_version","alias_value":"2411.03461v3","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03461","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"pith_short_12","alias_value":"FXBCGKPUK7JU","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"pith_short_16","alias_value":"FXBCGKPUK7JU4WD7","created_at":"2026-06-19T16:10:28Z"},{"alias_kind":"pith_short_8","alias_value":"FXBCGKPU","created_at":"2026-06-19T16:10:28Z"}],"graph_snapshots":[{"event_id":"sha256:9ff5ebef909f9b938262551c24c698af86281b611885d0bbe8f395e3918972c2","target":"graph","created_at":"2026-06-19T16:10:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.03461/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Gabriel Ponte, Jon Lee, Luze Xu, Marcia Fampa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-11-05T19:24:30Z","title":"ADMM for 0/1 D-optimality and Maximum-Entropy Sampling Relaxations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03461","kind":"arxiv","version":3},"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:63350af7995f88b861bda06ef49d38ccbc285cf75c5ae5478dc5c75dcbad10a7","target":"record","created_at":"2026-06-19T16:10:28Z","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":"a231c6d172be00db7273d272ecf7b5c89c470d902ac54744c5d715e560d6d80b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-11-05T19:24:30Z","title_canon_sha256":"c9a3fe350c1fbeff7612e78f61be122db4ee48fc91e86080865eac1081b237b9"},"schema_version":"1.0","source":{"id":"2411.03461","kind":"arxiv","version":3}},"canonical_sha256":"2dc22329f457d34e587f9732450b56f485a4c4c0eb21eb90cc6f16c1e399a5be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2dc22329f457d34e587f9732450b56f485a4c4c0eb21eb90cc6f16c1e399a5be","first_computed_at":"2026-06-19T16:10:28.978014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:28.978014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DQkR4XaExvBYPDJxioNMR/8rPVg/hifHxsCMZx4BxQmlTDr6zgBNkAIfOT8wQ7CuZpUVDNX7sIju/5ZHGAEPCQ==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:28.978454Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.03461","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63350af7995f88b861bda06ef49d38ccbc285cf75c5ae5478dc5c75dcbad10a7","sha256:9ff5ebef909f9b938262551c24c698af86281b611885d0bbe8f395e3918972c2"],"state_sha256":"fa61f4aefe4eae023843f6e279fdb6851288f6ab0a92480d23ebda82a0b89d9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xZVGsWrt+EizO2lVt9/ZJYLFZHsHCXCZI4d79H1yKFTZKP0QbJulkofE5zNlxtF7nGTDIEV7Z2CAjtL9okYaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T23:01:43.314087Z","bundle_sha256":"f269d3fcecf81452da7a715566ef91ebea5746bd8bf2e3a587235361164fe745"}}