{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Z6WFWDNX3SA7QLRXOKFHR75AOK","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":"82cefc96b82eeb49e0a49e378af60755af2a719622083841093d3e3ac970bfcc","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-01-28T19:13:28Z","title_canon_sha256":"1ca5c444971b605f9fe8e29b82c64e2990606f18aa857065cc9a4fab05b3b26c"},"schema_version":"1.0","source":{"id":"2601.20970","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.20970","created_at":"2026-06-10T01:08:32Z"},{"alias_kind":"arxiv_version","alias_value":"2601.20970v3","created_at":"2026-06-10T01:08:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.20970","created_at":"2026-06-10T01:08:32Z"},{"alias_kind":"pith_short_12","alias_value":"Z6WFWDNX3SA7","created_at":"2026-06-10T01:08:32Z"},{"alias_kind":"pith_short_16","alias_value":"Z6WFWDNX3SA7QLRX","created_at":"2026-06-10T01:08:32Z"},{"alias_kind":"pith_short_8","alias_value":"Z6WFWDNX","created_at":"2026-06-10T01:08:32Z"}],"graph_snapshots":[{"event_id":"sha256:6821c4330e395ea038b8712d6763d371bbc8afbe023969b3cadc31ab5cf39baf","target":"graph","created_at":"2026-06-10T01:08:32Z","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/2601.20970/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The maximum-entropy remote sampling problem (MERSP) is to select a subset of $s$ random variables from a set of $n$ random variables, so as to maximize the information concerning a set of target random variables that are not directly observable. We assume that the set of all of these random variables follows a joint Gaussian distribution, and that we have the covariance matrix available. Finally, we measure information using Shannon's differential entropy.\n  The main approach for exact solution of moderate-sized instances of MERSP has been branch-and-bound (B\\&B), and so previous work concentr","authors_text":"Gabriel Ponte, Jon Lee, Marcia Fampa","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-01-28T19:13:28Z","title":"The hyper-scaled NLP bound for maximum-entropy remote sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.20970","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:c453d76c2a04fd9c2f617613a0d0bd3654fe824a661622367d2d31c5f2d430d3","target":"record","created_at":"2026-06-10T01:08:32Z","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":"82cefc96b82eeb49e0a49e378af60755af2a719622083841093d3e3ac970bfcc","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-01-28T19:13:28Z","title_canon_sha256":"1ca5c444971b605f9fe8e29b82c64e2990606f18aa857065cc9a4fab05b3b26c"},"schema_version":"1.0","source":{"id":"2601.20970","kind":"arxiv","version":3}},"canonical_sha256":"cfac5b0db7dc81f82e37728a78ffa07298920e71b2d906d2b6b8b719a9915e0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfac5b0db7dc81f82e37728a78ffa07298920e71b2d906d2b6b8b719a9915e0f","first_computed_at":"2026-06-10T01:08:32.823919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-10T01:08:32.823919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YdEJDGmvI2linS3xd9yTtHXKcsniBIb2qcHBtTmgcOWe9yMnhL3fe1/yYgJox4cikMyw3azwNya7Zl5PZtDsDw==","signature_status":"signed_v1","signed_at":"2026-06-10T01:08:32.825038Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.20970","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c453d76c2a04fd9c2f617613a0d0bd3654fe824a661622367d2d31c5f2d430d3","sha256:6821c4330e395ea038b8712d6763d371bbc8afbe023969b3cadc31ab5cf39baf"],"state_sha256":"722b66aaf83399e6ea73d7b35aceef9016926be4fe7a2c9b4f7aa4b4fb22b3c7"}