{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3U5WZT6EWUOM7PXFMVYN42YYQV","short_pith_number":"pith:3U5WZT6E","schema_version":"1.0","canonical_sha256":"dd3b6ccfc4b51ccfbee56570de6b188548e12366399f5c3bd45d6f1aae83f92d","source":{"kind":"arxiv","id":"1608.05258","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.05258","created_at":"2026-05-18T01:08:31.518410+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.05258v1","created_at":"2026-05-18T01:08:31.518410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05258","created_at":"2026-05-18T01:08:31.518410+00:00"},{"alias_kind":"pith_short_12","alias_value":"3U5WZT6EWUOM","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"3U5WZT6EWUOM7PXF","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"3U5WZT6E","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3U5WZT6EWUOM7PXFMVYN42YYQV","json":"https://pith.science/pith/3U5WZT6EWUOM7PXFMVYN42YYQV.json","graph_json":"https://pith.science/api/pith-number/3U5WZT6EWUOM7PXFMVYN42YYQV/graph.json","events_json":"https://pith.science/api/pith-number/3U5WZT6EWUOM7PXFMVYN42YYQV/events.json","paper":"https://pith.science/paper/3U5WZT6E"},"agent_actions":{"view_html":"https://pith.science/pith/3U5WZT6EWUOM7PXFMVYN42YYQV","download_json":"https://pith.science/pith/3U5WZT6EWUOM7PXFMVYN42YYQV.json","view_paper":"https://pith.science/paper/3U5WZT6E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.05258&json=true","fetch_graph":"https://pith.science/api/pith-number/3U5WZT6EWUOM7PXFMVYN42YYQV/graph.json","fetch_events":"https://pith.science/api/pith-number/3U5WZT6EWUOM7PXFMVYN42YYQV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3U5WZT6EWUOM7PXFMVYN42YYQV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3U5WZT6EWUOM7PXFMVYN42YYQV/action/storage_attestation","attest_author":"https://pith.science/pith/3U5WZT6EWUOM7PXFMVYN42YYQV/action/author_attestation","sign_citation":"https://pith.science/pith/3U5WZT6EWUOM7PXFMVYN42YYQV/action/citation_signature","submit_replication":"https://pith.science/pith/3U5WZT6EWUOM7PXFMVYN42YYQV/action/replication_record"}},"created_at":"2026-05-18T01:08:31.518410+00:00","updated_at":"2026-05-18T01:08:31.518410+00:00"}