{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3U5WZT6EWUOM7PXFMVYN42YYQV","short_pith_number":"pith:3U5WZT6E","canonical_record":{"source":{"id":"1608.05258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-18T13:55:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6f7c525ab4467b1db9a30c6b35741f9d39b9036d426ec6802a8a0e64bfa2312c","abstract_canon_sha256":"8186915583983f09f8c77a6f0e918f3cfa8d95fefdcc1a1c2a7a966f3e343f8b"},"schema_version":"1.0"},"canonical_sha256":"dd3b6ccfc4b51ccfbee56570de6b188548e12366399f5c3bd45d6f1aae83f92d","source":{"kind":"arxiv","id":"1608.05258","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05258","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05258v1","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05258","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"3U5WZT6EWUOM","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3U5WZT6EWUOM7PXF","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3U5WZT6E","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3U5WZT6EWUOM7PXFMVYN42YYQV","target":"record","payload":{"canonical_record":{"source":{"id":"1608.05258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-18T13:55:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6f7c525ab4467b1db9a30c6b35741f9d39b9036d426ec6802a8a0e64bfa2312c","abstract_canon_sha256":"8186915583983f09f8c77a6f0e918f3cfa8d95fefdcc1a1c2a7a966f3e343f8b"},"schema_version":"1.0"},"canonical_sha256":"dd3b6ccfc4b51ccfbee56570de6b188548e12366399f5c3bd45d6f1aae83f92d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:31.518804Z","signature_b64":"kgeXmDsfhT0hotBQumTmOP3Ap6SP0z5gl1tGhOTVShAL44Eo3gutG0dqenJ7/CQI3m8MvK0GXnGG0pMYjH+cCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd3b6ccfc4b51ccfbee56570de6b188548e12366399f5c3bd45d6f1aae83f92d","last_reissued_at":"2026-05-18T01:08:31.518330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:31.518330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.05258","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:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W+qhLY9hMaHmNNpe/xYUf266n/Zc1mbUv/F76j9ntMvmSbc85vgELoxyR95smJnpc0zcy0wznlHs/fq2gZ8BCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:49:51.583271Z"},"content_sha256":"41092203ce3f63c6765f4cd9688652cba65b27ec08e613dd275434769d7edfbc","schema_version":"1.0","event_id":"sha256:41092203ce3f63c6765f4cd9688652cba65b27ec08e613dd275434769d7edfbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3U5WZT6EWUOM7PXFMVYN42YYQV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameter Learning for Log-supermodular Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Francis Bach, Tatiana Shpakova","submitted_at":"2016-08-18T13:55:41Z","abstract_excerpt":"We consider log-supermodular models on binary variables, which are probabilistic models with negative log-densities which are submodular. These models provide probabilistic interpretations of common combinatorial optimization tasks such as image segmentation. In this paper, we focus primarily on parameter estimation in the models from known upper-bounds on the intractable log-partition function. We show that the bound based on separable optimization on the base polytope of the submodular function is always inferior to a bound based on \"perturb-and-MAP\" ideas. Then, to learn parameters, given t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05258","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:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4d6pGV0s56XEhj0CxUR2gRIZ83w5VT2OA6qw//oPXgh6014J05TRkwO/IpGQmVeKPN+uHvaCBu5TgA6UkICQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:49:51.583880Z"},"content_sha256":"87d0015837aa3d4be5068fa16be0d30db5194a43a937678ad87ac642a8a29c38","schema_version":"1.0","event_id":"sha256:87d0015837aa3d4be5068fa16be0d30db5194a43a937678ad87ac642a8a29c38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3U5WZT6EWUOM7PXFMVYN42YYQV/bundle.json","state_url":"https://pith.science/pith/3U5WZT6EWUOM7PXFMVYN42YYQV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3U5WZT6EWUOM7PXFMVYN42YYQV/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-05-30T08:49:51Z","links":{"resolver":"https://pith.science/pith/3U5WZT6EWUOM7PXFMVYN42YYQV","bundle":"https://pith.science/pith/3U5WZT6EWUOM7PXFMVYN42YYQV/bundle.json","state":"https://pith.science/pith/3U5WZT6EWUOM7PXFMVYN42YYQV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3U5WZT6EWUOM7PXFMVYN42YYQV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3U5WZT6EWUOM7PXFMVYN42YYQV","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":"8186915583983f09f8c77a6f0e918f3cfa8d95fefdcc1a1c2a7a966f3e343f8b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-18T13:55:41Z","title_canon_sha256":"6f7c525ab4467b1db9a30c6b35741f9d39b9036d426ec6802a8a0e64bfa2312c"},"schema_version":"1.0","source":{"id":"1608.05258","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05258","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05258v1","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05258","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"3U5WZT6EWUOM","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3U5WZT6EWUOM7PXF","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3U5WZT6E","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:87d0015837aa3d4be5068fa16be0d30db5194a43a937678ad87ac642a8a29c38","target":"graph","created_at":"2026-05-18T01:08:31Z","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":"We consider log-supermodular models on binary variables, which are probabilistic models with negative log-densities which are submodular. These models provide probabilistic interpretations of common combinatorial optimization tasks such as image segmentation. In this paper, we focus primarily on parameter estimation in the models from known upper-bounds on the intractable log-partition function. We show that the bound based on separable optimization on the base polytope of the submodular function is always inferior to a bound based on \"perturb-and-MAP\" ideas. Then, to learn parameters, given t","authors_text":"Francis Bach, Tatiana Shpakova","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-18T13:55:41Z","title":"Parameter Learning for Log-supermodular Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05258","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:41092203ce3f63c6765f4cd9688652cba65b27ec08e613dd275434769d7edfbc","target":"record","created_at":"2026-05-18T01:08:31Z","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":"8186915583983f09f8c77a6f0e918f3cfa8d95fefdcc1a1c2a7a966f3e343f8b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-18T13:55:41Z","title_canon_sha256":"6f7c525ab4467b1db9a30c6b35741f9d39b9036d426ec6802a8a0e64bfa2312c"},"schema_version":"1.0","source":{"id":"1608.05258","kind":"arxiv","version":1}},"canonical_sha256":"dd3b6ccfc4b51ccfbee56570de6b188548e12366399f5c3bd45d6f1aae83f92d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd3b6ccfc4b51ccfbee56570de6b188548e12366399f5c3bd45d6f1aae83f92d","first_computed_at":"2026-05-18T01:08:31.518330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:31.518330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kgeXmDsfhT0hotBQumTmOP3Ap6SP0z5gl1tGhOTVShAL44Eo3gutG0dqenJ7/CQI3m8MvK0GXnGG0pMYjH+cCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:31.518804Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05258","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41092203ce3f63c6765f4cd9688652cba65b27ec08e613dd275434769d7edfbc","sha256:87d0015837aa3d4be5068fa16be0d30db5194a43a937678ad87ac642a8a29c38"],"state_sha256":"ec9a2a4b4b22d9385dce9cac2700e3417abf1e1ef249bae7d68d1206907c3171"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MYt5Mbz0V+b1wvMfMHhLi1gToM/kNusMo+k02vspqbc2pY/t4gtpUNeCffCB/RJYgXkMUVvPDh+hnAGLUadeCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:49:51.587488Z","bundle_sha256":"6becae7c94cc7660d08d6470bcd0701aba141b19a866dc6160b2010f121746d6"}}