{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:C7UCZT3EYZ53EZCMVOMHSJNNLT","short_pith_number":"pith:C7UCZT3E","canonical_record":{"source":{"id":"1607.03204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-12T00:11:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9ac7d17307bb67e71467e2ad7c6c1124568651490c88e9225086fd87be694699","abstract_canon_sha256":"35febc1f5d05abca18201e8349f3b26617dcf591c2d405360445b53640dd5b73"},"schema_version":"1.0"},"canonical_sha256":"17e82ccf64c67bb2644cab987925ad5cc61a88139ea0fc5adf93ff95259056a4","source":{"kind":"arxiv","id":"1607.03204","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03204","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03204v1","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03204","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"C7UCZT3EYZ53","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C7UCZT3EYZ53EZCM","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C7UCZT3E","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:C7UCZT3EYZ53EZCMVOMHSJNNLT","target":"record","payload":{"canonical_record":{"source":{"id":"1607.03204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-12T00:11:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9ac7d17307bb67e71467e2ad7c6c1124568651490c88e9225086fd87be694699","abstract_canon_sha256":"35febc1f5d05abca18201e8349f3b26617dcf591c2d405360445b53640dd5b73"},"schema_version":"1.0"},"canonical_sha256":"17e82ccf64c67bb2644cab987925ad5cc61a88139ea0fc5adf93ff95259056a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:09.557238Z","signature_b64":"7OgvDXYcBsTOncIxou+hoJOk929kC/MkHWZ/8U5vmpg5rP3Yw3P9Lj23pGczO5AcMm17eXlrFYVq1UAYZ/ABAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17e82ccf64c67bb2644cab987925ad5cc61a88139ea0fc5adf93ff95259056a4","last_reissued_at":"2026-05-18T01:11:09.556708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:09.556708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.03204","source_version":1,"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-05-18T01:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sAvoIThMgbHimsTwkdNqKfDBm3KHuQbzactv7+kZ54CHd9kqSkRmhSVp+O/heiTIQFY7lvdQI00qkagULWsiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:26:38.074121Z"},"content_sha256":"a646b38b29db2b9cda29d302e3aae3475c9595397230d993ea0578227c7cd550","schema_version":"1.0","event_id":"sha256:a646b38b29db2b9cda29d302e3aae3475c9595397230d993ea0578227c7cd550"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:C7UCZT3EYZ53EZCMVOMHSJNNLT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Projection and Approximate Inference for Structured Sparse Variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Joydeep Ghosh, Oluwasanmi Koyejo, Rajiv Khanna, Russell Poldrack","submitted_at":"2016-07-12T00:11:59Z","abstract_excerpt":"Approximate inference via information projection has been recently introduced as a general-purpose approach for efficient probabilistic inference given sparse variables. This manuscript goes beyond classical sparsity by proposing efficient algorithms for approximate inference via information projection that are applicable to any structure on the set of variables that admits enumeration using a \\emph{matroid}. We show that the resulting information projection can be reduced to combinatorial submodular optimization subject to matroid constraints. Further, leveraging recent advances in submodular"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03204","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":""},"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-05-18T01:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bbnuOe0xztJ3x2deWCO4AZiXlyYtyn0o+yk3qRRmTIPmm+3havA4HwajbwoDBq+cJlXBngWIgOIWzc6ER96mCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:26:38.074658Z"},"content_sha256":"f75dca76f43079f6c6191539b1fb5fff1f2690ec9e1665b0d0ea9ccf45e8b5fe","schema_version":"1.0","event_id":"sha256:f75dca76f43079f6c6191539b1fb5fff1f2690ec9e1665b0d0ea9ccf45e8b5fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7UCZT3EYZ53EZCMVOMHSJNNLT/bundle.json","state_url":"https://pith.science/pith/C7UCZT3EYZ53EZCMVOMHSJNNLT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7UCZT3EYZ53EZCMVOMHSJNNLT/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-01T22:26:38Z","links":{"resolver":"https://pith.science/pith/C7UCZT3EYZ53EZCMVOMHSJNNLT","bundle":"https://pith.science/pith/C7UCZT3EYZ53EZCMVOMHSJNNLT/bundle.json","state":"https://pith.science/pith/C7UCZT3EYZ53EZCMVOMHSJNNLT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7UCZT3EYZ53EZCMVOMHSJNNLT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C7UCZT3EYZ53EZCMVOMHSJNNLT","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":"35febc1f5d05abca18201e8349f3b26617dcf591c2d405360445b53640dd5b73","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-12T00:11:59Z","title_canon_sha256":"9ac7d17307bb67e71467e2ad7c6c1124568651490c88e9225086fd87be694699"},"schema_version":"1.0","source":{"id":"1607.03204","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03204","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03204v1","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03204","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"C7UCZT3EYZ53","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C7UCZT3EYZ53EZCM","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C7UCZT3E","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:f75dca76f43079f6c6191539b1fb5fff1f2690ec9e1665b0d0ea9ccf45e8b5fe","target":"graph","created_at":"2026-05-18T01:11:09Z","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"},"paper":{"abstract_excerpt":"Approximate inference via information projection has been recently introduced as a general-purpose approach for efficient probabilistic inference given sparse variables. This manuscript goes beyond classical sparsity by proposing efficient algorithms for approximate inference via information projection that are applicable to any structure on the set of variables that admits enumeration using a \\emph{matroid}. We show that the resulting information projection can be reduced to combinatorial submodular optimization subject to matroid constraints. Further, leveraging recent advances in submodular","authors_text":"Joydeep Ghosh, Oluwasanmi Koyejo, Rajiv Khanna, Russell Poldrack","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-12T00:11:59Z","title":"Information Projection and Approximate Inference for Structured Sparse Variables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03204","kind":"arxiv","version":1},"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:a646b38b29db2b9cda29d302e3aae3475c9595397230d993ea0578227c7cd550","target":"record","created_at":"2026-05-18T01:11:09Z","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":"35febc1f5d05abca18201e8349f3b26617dcf591c2d405360445b53640dd5b73","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-12T00:11:59Z","title_canon_sha256":"9ac7d17307bb67e71467e2ad7c6c1124568651490c88e9225086fd87be694699"},"schema_version":"1.0","source":{"id":"1607.03204","kind":"arxiv","version":1}},"canonical_sha256":"17e82ccf64c67bb2644cab987925ad5cc61a88139ea0fc5adf93ff95259056a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17e82ccf64c67bb2644cab987925ad5cc61a88139ea0fc5adf93ff95259056a4","first_computed_at":"2026-05-18T01:11:09.556708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:09.556708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7OgvDXYcBsTOncIxou+hoJOk929kC/MkHWZ/8U5vmpg5rP3Yw3P9Lj23pGczO5AcMm17eXlrFYVq1UAYZ/ABAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:09.557238Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.03204","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a646b38b29db2b9cda29d302e3aae3475c9595397230d993ea0578227c7cd550","sha256:f75dca76f43079f6c6191539b1fb5fff1f2690ec9e1665b0d0ea9ccf45e8b5fe"],"state_sha256":"14b391153fddcbf161bd389171dfa442b9f2b7bae331db1e7687ed9ecb8cbb90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"phZhvTlCxg+iNsujaOS+KTIXGcl49j00tV50pGAd4fOqRlqKE8Ks3gQQBvoyZi0IhiO1WKW0kkTAkxrO+Ui3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:26:38.076833Z","bundle_sha256":"a05d2b92a7d877574414c1690f3c02642937b95006767ded2a026abaa19b4315"}}