{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AZ5LWOKLQ56L7HUNUUSSFFNGAB","short_pith_number":"pith:AZ5LWOKL","schema_version":"1.0","canonical_sha256":"067abb394b877cbf9e8da5252295a60049e47d48b977419bccba3efb51fe3907","source":{"kind":"arxiv","id":"1910.07600","version":1},"attestation_state":"computed","paper":{"title":"Learning chordal extensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrea Lodi, Defeng Liu, Mathieu Tanneau","submitted_at":"2019-10-16T20:25:45Z","abstract_excerpt":"A highly influential ingredient of many techniques designed to exploit sparsity in numerical optimization is the so-called chordal extension of a graph representation of the optimization problem. The definitive relation between chordal extension and the performance of the optimization algorithm that uses the extension is not a mathematically understood task. For this reason, we follow the current research trend of looking at Combinatorial Optimization tasks by using a Machine Learning lens, and we devise a framework for learning elimination rules yielding high-quality chordal extensions. As a "},"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":"1910.07600","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-16T20:25:45Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"ff9a8dc857fdd827654b160680b5e5eb69fbff6c6dce932bc9fcfeafc76f6e1a","abstract_canon_sha256":"9b816b333ff551ab6a7d97ad4a18135f7d86f16a58ef1911e1ce0502a045f474"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:12:38.647374Z","signature_b64":"JjOj3aExt9wlEamaHCwCs/gYumidVOYhL8oO3C9cQoXKebvm0orMbs85ZFSRdf+32jN3SbkKUAAOYSivHSTQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"067abb394b877cbf9e8da5252295a60049e47d48b977419bccba3efb51fe3907","last_reissued_at":"2026-07-05T00:12:38.646865Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:12:38.646865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning chordal extensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrea Lodi, Defeng Liu, Mathieu Tanneau","submitted_at":"2019-10-16T20:25:45Z","abstract_excerpt":"A highly influential ingredient of many techniques designed to exploit sparsity in numerical optimization is the so-called chordal extension of a graph representation of the optimization problem. The definitive relation between chordal extension and the performance of the optimization algorithm that uses the extension is not a mathematically understood task. For this reason, we follow the current research trend of looking at Combinatorial Optimization tasks by using a Machine Learning lens, and we devise a framework for learning elimination rules yielding high-quality chordal extensions. As a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.07600","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.07600/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1910.07600","created_at":"2026-07-05T00:12:38.646938+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.07600v1","created_at":"2026-07-05T00:12:38.646938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.07600","created_at":"2026-07-05T00:12:38.646938+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZ5LWOKLQ56L","created_at":"2026-07-05T00:12:38.646938+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZ5LWOKLQ56L7HUN","created_at":"2026-07-05T00:12:38.646938+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZ5LWOKL","created_at":"2026-07-05T00:12:38.646938+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/AZ5LWOKLQ56L7HUNUUSSFFNGAB","json":"https://pith.science/pith/AZ5LWOKLQ56L7HUNUUSSFFNGAB.json","graph_json":"https://pith.science/api/pith-number/AZ5LWOKLQ56L7HUNUUSSFFNGAB/graph.json","events_json":"https://pith.science/api/pith-number/AZ5LWOKLQ56L7HUNUUSSFFNGAB/events.json","paper":"https://pith.science/paper/AZ5LWOKL"},"agent_actions":{"view_html":"https://pith.science/pith/AZ5LWOKLQ56L7HUNUUSSFFNGAB","download_json":"https://pith.science/pith/AZ5LWOKLQ56L7HUNUUSSFFNGAB.json","view_paper":"https://pith.science/paper/AZ5LWOKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.07600&json=true","fetch_graph":"https://pith.science/api/pith-number/AZ5LWOKLQ56L7HUNUUSSFFNGAB/graph.json","fetch_events":"https://pith.science/api/pith-number/AZ5LWOKLQ56L7HUNUUSSFFNGAB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZ5LWOKLQ56L7HUNUUSSFFNGAB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZ5LWOKLQ56L7HUNUUSSFFNGAB/action/storage_attestation","attest_author":"https://pith.science/pith/AZ5LWOKLQ56L7HUNUUSSFFNGAB/action/author_attestation","sign_citation":"https://pith.science/pith/AZ5LWOKLQ56L7HUNUUSSFFNGAB/action/citation_signature","submit_replication":"https://pith.science/pith/AZ5LWOKLQ56L7HUNUUSSFFNGAB/action/replication_record"}},"created_at":"2026-07-05T00:12:38.646938+00:00","updated_at":"2026-07-05T00:12:38.646938+00:00"}