{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CXCEXPNLEJH2YDAVVEFADWK5EC","short_pith_number":"pith:CXCEXPNL","schema_version":"1.0","canonical_sha256":"15c44bbdab224fac0c15a90a01d95d20bd7f2201679bfb6324d13683f9934799","source":{"kind":"arxiv","id":"1308.1006","version":1},"attestation_state":"computed","paper":{"title":"Fast Semidifferential-based Submodular Function Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG"],"primary_cat":"cs.DS","authors_text":"Jeff Bilmes, Rishabh Iyer, Stefanie Jegelka","submitted_at":"2013-08-05T15:19:48Z","abstract_excerpt":"We present a practical and powerful new framework for both unconstrained and constrained submodular function optimization based on discrete semidifferentials (sub- and super-differentials). The resulting algorithms, which repeatedly compute and then efficiently optimize submodular semigradients, offer new and generalize many old methods for submodular optimization. Our approach, moreover, takes steps towards providing a unifying paradigm applicable to both submodular min- imization and maximization, problems that historically have been treated quite distinctly. The practicality of our algorith"},"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":"1308.1006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-05T15:19:48Z","cross_cats_sorted":["cs.DM","cs.LG"],"title_canon_sha256":"e84795678d0b19a5d31c290f50166db618d7e52927cca4083e22654ad5bbb018","abstract_canon_sha256":"451eeb264820dd3324e1381fa73a9d22c1dcf2fde449dea1ea6b4ca4c48646a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:08.254959Z","signature_b64":"XP0L/B5Ecwupi+TmZLxqrVoP+sBDVItqePEjHKJWycxL4vmM5bK/Az2doWguWjUeMfW6sp/G8oqA8mBnFK89DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15c44bbdab224fac0c15a90a01d95d20bd7f2201679bfb6324d13683f9934799","last_reissued_at":"2026-05-18T03:16:08.254122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:08.254122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Semidifferential-based Submodular Function Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG"],"primary_cat":"cs.DS","authors_text":"Jeff Bilmes, Rishabh Iyer, Stefanie Jegelka","submitted_at":"2013-08-05T15:19:48Z","abstract_excerpt":"We present a practical and powerful new framework for both unconstrained and constrained submodular function optimization based on discrete semidifferentials (sub- and super-differentials). The resulting algorithms, which repeatedly compute and then efficiently optimize submodular semigradients, offer new and generalize many old methods for submodular optimization. Our approach, moreover, takes steps towards providing a unifying paradigm applicable to both submodular min- imization and maximization, problems that historically have been treated quite distinctly. The practicality of our algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1006","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":"1308.1006","created_at":"2026-05-18T03:16:08.254269+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.1006v1","created_at":"2026-05-18T03:16:08.254269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1006","created_at":"2026-05-18T03:16:08.254269+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXCEXPNLEJH2","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXCEXPNLEJH2YDAV","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXCEXPNL","created_at":"2026-05-18T12:27:40.988391+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/CXCEXPNLEJH2YDAVVEFADWK5EC","json":"https://pith.science/pith/CXCEXPNLEJH2YDAVVEFADWK5EC.json","graph_json":"https://pith.science/api/pith-number/CXCEXPNLEJH2YDAVVEFADWK5EC/graph.json","events_json":"https://pith.science/api/pith-number/CXCEXPNLEJH2YDAVVEFADWK5EC/events.json","paper":"https://pith.science/paper/CXCEXPNL"},"agent_actions":{"view_html":"https://pith.science/pith/CXCEXPNLEJH2YDAVVEFADWK5EC","download_json":"https://pith.science/pith/CXCEXPNLEJH2YDAVVEFADWK5EC.json","view_paper":"https://pith.science/paper/CXCEXPNL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.1006&json=true","fetch_graph":"https://pith.science/api/pith-number/CXCEXPNLEJH2YDAVVEFADWK5EC/graph.json","fetch_events":"https://pith.science/api/pith-number/CXCEXPNLEJH2YDAVVEFADWK5EC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXCEXPNLEJH2YDAVVEFADWK5EC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXCEXPNLEJH2YDAVVEFADWK5EC/action/storage_attestation","attest_author":"https://pith.science/pith/CXCEXPNLEJH2YDAVVEFADWK5EC/action/author_attestation","sign_citation":"https://pith.science/pith/CXCEXPNLEJH2YDAVVEFADWK5EC/action/citation_signature","submit_replication":"https://pith.science/pith/CXCEXPNLEJH2YDAVVEFADWK5EC/action/replication_record"}},"created_at":"2026-05-18T03:16:08.254269+00:00","updated_at":"2026-05-18T03:16:08.254269+00:00"}