{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:BSNOOMXVGKNTEKDTOZOIF2557L","short_pith_number":"pith:BSNOOMXV","schema_version":"1.0","canonical_sha256":"0c9ae732f5329b322873765c82ebbdfafdaec011802ede7a508be41d0f808751","source":{"kind":"arxiv","id":"math/0611531","version":5},"attestation_state":"computed","paper":{"title":"Orbitopal Fixing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Marc E. Pfetsch, Matthias Peinhardt, Volker Kaibel","submitted_at":"2006-11-17T13:11:54Z","abstract_excerpt":"The topic of this paper are integer programming models in which a subset of 0/1-variables encode a partitioning of a set of objects into disjoint subsets. Such models can be surprisingly hard to solve by branch-and-cut algorithms if the order of the subsets of the partition is irrelevant, since this kind of symmetry unnecessarily blows up the search tree. We present a general tool, called orbitopal fixing, for enhancing the capabilities of branch-and-cut algorithms in solving such symmetric integer programming models. We devise a linear time algorithm that, applied at each node of the search 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":"math/0611531","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2006-11-17T13:11:54Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"78d7194c4d4ded92bae24b5aca0becde329964ebd5969a79be308080193e6dc7","abstract_canon_sha256":"d1f7750b492a4bebdd9d5974663c0017fcacace9c8ec5d0779c287ba9847dbe8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:48.517904Z","signature_b64":"OfXBdKBQveOx0sP9o2ixpu/p2/dbcxdXSVJR3eAZkQZKrctBAhkPjoX1Y+YuWpU1ykGcjpXgFDwneojPLLGwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c9ae732f5329b322873765c82ebbdfafdaec011802ede7a508be41d0f808751","last_reissued_at":"2026-05-18T04:10:48.517471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:48.517471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Orbitopal Fixing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Marc E. Pfetsch, Matthias Peinhardt, Volker Kaibel","submitted_at":"2006-11-17T13:11:54Z","abstract_excerpt":"The topic of this paper are integer programming models in which a subset of 0/1-variables encode a partitioning of a set of objects into disjoint subsets. Such models can be surprisingly hard to solve by branch-and-cut algorithms if the order of the subsets of the partition is irrelevant, since this kind of symmetry unnecessarily blows up the search tree. We present a general tool, called orbitopal fixing, for enhancing the capabilities of branch-and-cut algorithms in solving such symmetric integer programming models. We devise a linear time algorithm that, applied at each node of the search t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0611531","kind":"arxiv","version":5},"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":"math/0611531","created_at":"2026-05-18T04:10:48.517531+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0611531v5","created_at":"2026-05-18T04:10:48.517531+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0611531","created_at":"2026-05-18T04:10:48.517531+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSNOOMXVGKNT","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSNOOMXVGKNTEKDT","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSNOOMXV","created_at":"2026-05-18T12:25:53.939244+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/BSNOOMXVGKNTEKDTOZOIF2557L","json":"https://pith.science/pith/BSNOOMXVGKNTEKDTOZOIF2557L.json","graph_json":"https://pith.science/api/pith-number/BSNOOMXVGKNTEKDTOZOIF2557L/graph.json","events_json":"https://pith.science/api/pith-number/BSNOOMXVGKNTEKDTOZOIF2557L/events.json","paper":"https://pith.science/paper/BSNOOMXV"},"agent_actions":{"view_html":"https://pith.science/pith/BSNOOMXVGKNTEKDTOZOIF2557L","download_json":"https://pith.science/pith/BSNOOMXVGKNTEKDTOZOIF2557L.json","view_paper":"https://pith.science/paper/BSNOOMXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0611531&json=true","fetch_graph":"https://pith.science/api/pith-number/BSNOOMXVGKNTEKDTOZOIF2557L/graph.json","fetch_events":"https://pith.science/api/pith-number/BSNOOMXVGKNTEKDTOZOIF2557L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSNOOMXVGKNTEKDTOZOIF2557L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSNOOMXVGKNTEKDTOZOIF2557L/action/storage_attestation","attest_author":"https://pith.science/pith/BSNOOMXVGKNTEKDTOZOIF2557L/action/author_attestation","sign_citation":"https://pith.science/pith/BSNOOMXVGKNTEKDTOZOIF2557L/action/citation_signature","submit_replication":"https://pith.science/pith/BSNOOMXVGKNTEKDTOZOIF2557L/action/replication_record"}},"created_at":"2026-05-18T04:10:48.517531+00:00","updated_at":"2026-05-18T04:10:48.517531+00:00"}