{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:J6SLRALTAFAKTSPETQWJUCKRHH","short_pith_number":"pith:J6SLRALT","schema_version":"1.0","canonical_sha256":"4fa4b881730140a9c9e49c2c9a095139e6961f3c810d09ac7f4d948f42b94c22","source":{"kind":"arxiv","id":"2410.10078","version":1},"attestation_state":"computed","paper":{"title":"The Augmented Factorization Bound for Maximum-Entropy Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.OC","authors_text":"Yongchun Li","submitted_at":"2024-10-14T01:47:16Z","abstract_excerpt":"The maximum-entropy sampling problem (MESP) aims to select the most informative principal submatrix of a prespecified size from a given covariance matrix. This paper proposes an augmented factorization bound for MESP based on concave relaxation. By leveraging majorization and Schur-concavity theory, we demonstrate that this new bound dominates the classic factorization bound of Nikolov (2015) and a recent upper bound proposed by Li et al. (2024). Furthermore, we provide theoretical guarantees that quantify how much our proposed bound improves the two existing ones and establish sufficient cond"},"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":"2410.10078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-14T01:47:16Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"89c297881d80b4d11456454364da39980e475167c575467574311fedabe7f3c9","abstract_canon_sha256":"fdc18186f28e50489f2082e12be73b210c1c170e898855d4836e46eec261fae9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:20:10.714547Z","signature_b64":"+TaDH9LJesTAzdYyfL3rgcQoUCr7HvbSv0EQ+/v8Bxy6ahfbcQoJzIvFHIOIwGhG/WQz11HoxCpwVre2EkWTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fa4b881730140a9c9e49c2c9a095139e6961f3c810d09ac7f4d948f42b94c22","last_reissued_at":"2026-07-05T09:20:10.714046Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:20:10.714046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Augmented Factorization Bound for Maximum-Entropy Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.OC","authors_text":"Yongchun Li","submitted_at":"2024-10-14T01:47:16Z","abstract_excerpt":"The maximum-entropy sampling problem (MESP) aims to select the most informative principal submatrix of a prespecified size from a given covariance matrix. This paper proposes an augmented factorization bound for MESP based on concave relaxation. By leveraging majorization and Schur-concavity theory, we demonstrate that this new bound dominates the classic factorization bound of Nikolov (2015) and a recent upper bound proposed by Li et al. (2024). Furthermore, we provide theoretical guarantees that quantify how much our proposed bound improves the two existing ones and establish sufficient cond"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.10078","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/2410.10078/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":"2410.10078","created_at":"2026-07-05T09:20:10.714102+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.10078v1","created_at":"2026-07-05T09:20:10.714102+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.10078","created_at":"2026-07-05T09:20:10.714102+00:00"},{"alias_kind":"pith_short_12","alias_value":"J6SLRALTAFAK","created_at":"2026-07-05T09:20:10.714102+00:00"},{"alias_kind":"pith_short_16","alias_value":"J6SLRALTAFAKTSPE","created_at":"2026-07-05T09:20:10.714102+00:00"},{"alias_kind":"pith_short_8","alias_value":"J6SLRALT","created_at":"2026-07-05T09:20:10.714102+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.14957","citing_title":"Strong Formulations and Algorithms for Regularized A-optimal Design","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J6SLRALTAFAKTSPETQWJUCKRHH","json":"https://pith.science/pith/J6SLRALTAFAKTSPETQWJUCKRHH.json","graph_json":"https://pith.science/api/pith-number/J6SLRALTAFAKTSPETQWJUCKRHH/graph.json","events_json":"https://pith.science/api/pith-number/J6SLRALTAFAKTSPETQWJUCKRHH/events.json","paper":"https://pith.science/paper/J6SLRALT"},"agent_actions":{"view_html":"https://pith.science/pith/J6SLRALTAFAKTSPETQWJUCKRHH","download_json":"https://pith.science/pith/J6SLRALTAFAKTSPETQWJUCKRHH.json","view_paper":"https://pith.science/paper/J6SLRALT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.10078&json=true","fetch_graph":"https://pith.science/api/pith-number/J6SLRALTAFAKTSPETQWJUCKRHH/graph.json","fetch_events":"https://pith.science/api/pith-number/J6SLRALTAFAKTSPETQWJUCKRHH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J6SLRALTAFAKTSPETQWJUCKRHH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J6SLRALTAFAKTSPETQWJUCKRHH/action/storage_attestation","attest_author":"https://pith.science/pith/J6SLRALTAFAKTSPETQWJUCKRHH/action/author_attestation","sign_citation":"https://pith.science/pith/J6SLRALTAFAKTSPETQWJUCKRHH/action/citation_signature","submit_replication":"https://pith.science/pith/J6SLRALTAFAKTSPETQWJUCKRHH/action/replication_record"}},"created_at":"2026-07-05T09:20:10.714102+00:00","updated_at":"2026-07-05T09:20:10.714102+00:00"}