{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CLGNJ2ZBGG53L2IZYYXMKIGSQO","short_pith_number":"pith:CLGNJ2ZB","schema_version":"1.0","canonical_sha256":"12ccd4eb2131bbb5e919c62ec520d283b0180faf9e9e7842128f75f32f5ae522","source":{"kind":"arxiv","id":"1202.0435","version":3},"attestation_state":"computed","paper":{"title":"Exploiting Symmetry in Integer Convex Optimization using Core Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.OC","authors_text":"Achill Sch\\\"urmann, Katrin Herr, Thomas Rehn","submitted_at":"2012-02-02T14:13:23Z","abstract_excerpt":"We consider convex programming problems with integrality constraints that are invariant under a linear symmetry group. To decompose such problems we introduce the new concept of core points, i.e., integral points whose orbit polytopes are lattice-free. For symmetric integer linear programs we describe two algorithms based on this decomposition. Using a characterization of core points for direct products of symmetric groups, we show that prototype implementations can compete with state-of-the-art commercial solvers, and solve an open MIPLIB problem."},"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":"1202.0435","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-02-02T14:13:23Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"e90adde2edaf23ed9bc7d188f62622366f311ec490b702c9784bd98ea9ae9143","abstract_canon_sha256":"dbfd9b7222ba9c15330e881e25425967e94da8fd10b5999bd25abe51aa4bdc40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:20.591381Z","signature_b64":"yVXN0OevAnE/qYghZgpnI/1IWshlWPEYQWcOLHqHw/nBoXWgsvlATI7sQ1QO7oRdrgOoG/jgVc4ezY5eG9Q1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12ccd4eb2131bbb5e919c62ec520d283b0180faf9e9e7842128f75f32f5ae522","last_reissued_at":"2026-05-18T02:49:20.590685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:20.590685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Symmetry in Integer Convex Optimization using Core Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.OC","authors_text":"Achill Sch\\\"urmann, Katrin Herr, Thomas Rehn","submitted_at":"2012-02-02T14:13:23Z","abstract_excerpt":"We consider convex programming problems with integrality constraints that are invariant under a linear symmetry group. To decompose such problems we introduce the new concept of core points, i.e., integral points whose orbit polytopes are lattice-free. For symmetric integer linear programs we describe two algorithms based on this decomposition. Using a characterization of core points for direct products of symmetric groups, we show that prototype implementations can compete with state-of-the-art commercial solvers, and solve an open MIPLIB problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0435","kind":"arxiv","version":3},"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":"1202.0435","created_at":"2026-05-18T02:49:20.590780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0435v3","created_at":"2026-05-18T02:49:20.590780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0435","created_at":"2026-05-18T02:49:20.590780+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLGNJ2ZBGG53","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLGNJ2ZBGG53L2IZ","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLGNJ2ZB","created_at":"2026-05-18T12:27:01.376967+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/CLGNJ2ZBGG53L2IZYYXMKIGSQO","json":"https://pith.science/pith/CLGNJ2ZBGG53L2IZYYXMKIGSQO.json","graph_json":"https://pith.science/api/pith-number/CLGNJ2ZBGG53L2IZYYXMKIGSQO/graph.json","events_json":"https://pith.science/api/pith-number/CLGNJ2ZBGG53L2IZYYXMKIGSQO/events.json","paper":"https://pith.science/paper/CLGNJ2ZB"},"agent_actions":{"view_html":"https://pith.science/pith/CLGNJ2ZBGG53L2IZYYXMKIGSQO","download_json":"https://pith.science/pith/CLGNJ2ZBGG53L2IZYYXMKIGSQO.json","view_paper":"https://pith.science/paper/CLGNJ2ZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0435&json=true","fetch_graph":"https://pith.science/api/pith-number/CLGNJ2ZBGG53L2IZYYXMKIGSQO/graph.json","fetch_events":"https://pith.science/api/pith-number/CLGNJ2ZBGG53L2IZYYXMKIGSQO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLGNJ2ZBGG53L2IZYYXMKIGSQO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLGNJ2ZBGG53L2IZYYXMKIGSQO/action/storage_attestation","attest_author":"https://pith.science/pith/CLGNJ2ZBGG53L2IZYYXMKIGSQO/action/author_attestation","sign_citation":"https://pith.science/pith/CLGNJ2ZBGG53L2IZYYXMKIGSQO/action/citation_signature","submit_replication":"https://pith.science/pith/CLGNJ2ZBGG53L2IZYYXMKIGSQO/action/replication_record"}},"created_at":"2026-05-18T02:49:20.590780+00:00","updated_at":"2026-05-18T02:49:20.590780+00:00"}