{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:2DBFUURKF36ISS5NZV424UGRKZ","short_pith_number":"pith:2DBFUURK","canonical_record":{"source":{"id":"2411.17596","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-26T17:05:56Z","cross_cats_sorted":[],"title_canon_sha256":"c93256d360d1a66c520deb04a8a9dba37cff7872b1fc0f385a7ca2c8448fd102","abstract_canon_sha256":"37d1312b305801979b39f6caa27b44aeb470ab1a5842ac2c2ea52dbbfbf87c5c"},"schema_version":"1.0"},"canonical_sha256":"d0c25a522a2efc894badcd79ae50d15676617aedc6ea313626736b476b200018","source":{"kind":"arxiv","id":"2411.17596","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17596","created_at":"2026-07-05T09:41:05Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17596v2","created_at":"2026-07-05T09:41:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17596","created_at":"2026-07-05T09:41:05Z"},{"alias_kind":"pith_short_12","alias_value":"2DBFUURKF36I","created_at":"2026-07-05T09:41:05Z"},{"alias_kind":"pith_short_16","alias_value":"2DBFUURKF36ISS5N","created_at":"2026-07-05T09:41:05Z"},{"alias_kind":"pith_short_8","alias_value":"2DBFUURK","created_at":"2026-07-05T09:41:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:2DBFUURKF36ISS5NZV424UGRKZ","target":"record","payload":{"canonical_record":{"source":{"id":"2411.17596","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-26T17:05:56Z","cross_cats_sorted":[],"title_canon_sha256":"c93256d360d1a66c520deb04a8a9dba37cff7872b1fc0f385a7ca2c8448fd102","abstract_canon_sha256":"37d1312b305801979b39f6caa27b44aeb470ab1a5842ac2c2ea52dbbfbf87c5c"},"schema_version":"1.0"},"canonical_sha256":"d0c25a522a2efc894badcd79ae50d15676617aedc6ea313626736b476b200018","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:05.058561Z","signature_b64":"oN4sbIW2HgfPZ0fdOuKcV4huaOpRoY7PjPvs6Ka1KRf3NRGXAxXvWcpu9BIauZdtG6v/2Kq0DQJ+eMfumaEzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0c25a522a2efc894badcd79ae50d15676617aedc6ea313626736b476b200018","last_reissued_at":"2026-07-05T09:41:05.058082Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:05.058082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.17596","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:41:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2srqy1+ivTrLBtoT4Q7Z3S5rYrrd5b9yyqFr1naKfy11E24Y/zqkjXF7h6oi45w1LRULbKYudTuxka+iHqgcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:27:42.847677Z"},"content_sha256":"7fd510485c7b6c32700285e4821d93e97bb4ef260d872df96e3a16b1bee4cb1e","schema_version":"1.0","event_id":"sha256:7fd510485c7b6c32700285e4821d93e97bb4ef260d872df96e3a16b1bee4cb1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:2DBFUURKF36ISS5NZV424UGRKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Arcee: An OCM-Solver","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fanny Hauser, Jesse Palarus, Kimon Boehmer, Lukas Lee George","submitted_at":"2024-11-26T17:05:56Z","abstract_excerpt":"The 2024 PACE Challenge focused on the One-Sided Crossing Minimization (OCM) problem, which aims to minimize edge crossings in a bipartite graph with a fixed order in one partition and a free order in the other. We describe our OCM solver submission that utilizes various reduction rules for OCM and, for the heuristic track, employs local search approaches as well as techniques to escape local minima. The exact and parameterized solver uses an ILP formulation and branch & bound to solve an equivalent Feedback Arc Set instance."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17596","kind":"arxiv","version":2},"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/2411.17596/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:41:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3YpEPg51D7WSl2j06k2RAHkD0tKcVmGPPaNvH0dFxAP4t+TH+jk88rgAJN6nrF0Hlk3SOUAlTZOXXAu/w70pBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:27:42.848219Z"},"content_sha256":"e8db48e31aadc083ceafe741a4326617afabb82edec4f0b47f6de53a61b7c7d9","schema_version":"1.0","event_id":"sha256:e8db48e31aadc083ceafe741a4326617afabb82edec4f0b47f6de53a61b7c7d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2DBFUURKF36ISS5NZV424UGRKZ/bundle.json","state_url":"https://pith.science/pith/2DBFUURKF36ISS5NZV424UGRKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2DBFUURKF36ISS5NZV424UGRKZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T23:27:42Z","links":{"resolver":"https://pith.science/pith/2DBFUURKF36ISS5NZV424UGRKZ","bundle":"https://pith.science/pith/2DBFUURKF36ISS5NZV424UGRKZ/bundle.json","state":"https://pith.science/pith/2DBFUURKF36ISS5NZV424UGRKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2DBFUURKF36ISS5NZV424UGRKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:2DBFUURKF36ISS5NZV424UGRKZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"37d1312b305801979b39f6caa27b44aeb470ab1a5842ac2c2ea52dbbfbf87c5c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-26T17:05:56Z","title_canon_sha256":"c93256d360d1a66c520deb04a8a9dba37cff7872b1fc0f385a7ca2c8448fd102"},"schema_version":"1.0","source":{"id":"2411.17596","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17596","created_at":"2026-07-05T09:41:05Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17596v2","created_at":"2026-07-05T09:41:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17596","created_at":"2026-07-05T09:41:05Z"},{"alias_kind":"pith_short_12","alias_value":"2DBFUURKF36I","created_at":"2026-07-05T09:41:05Z"},{"alias_kind":"pith_short_16","alias_value":"2DBFUURKF36ISS5N","created_at":"2026-07-05T09:41:05Z"},{"alias_kind":"pith_short_8","alias_value":"2DBFUURK","created_at":"2026-07-05T09:41:05Z"}],"graph_snapshots":[{"event_id":"sha256:e8db48e31aadc083ceafe741a4326617afabb82edec4f0b47f6de53a61b7c7d9","target":"graph","created_at":"2026-07-05T09:41:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.17596/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The 2024 PACE Challenge focused on the One-Sided Crossing Minimization (OCM) problem, which aims to minimize edge crossings in a bipartite graph with a fixed order in one partition and a free order in the other. We describe our OCM solver submission that utilizes various reduction rules for OCM and, for the heuristic track, employs local search approaches as well as techniques to escape local minima. The exact and parameterized solver uses an ILP formulation and branch & bound to solve an equivalent Feedback Arc Set instance.","authors_text":"Fanny Hauser, Jesse Palarus, Kimon Boehmer, Lukas Lee George","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17596","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7fd510485c7b6c32700285e4821d93e97bb4ef260d872df96e3a16b1bee4cb1e","target":"record","created_at":"2026-07-05T09:41:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"37d1312b305801979b39f6caa27b44aeb470ab1a5842ac2c2ea52dbbfbf87c5c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-26T17:05:56Z","title_canon_sha256":"c93256d360d1a66c520deb04a8a9dba37cff7872b1fc0f385a7ca2c8448fd102"},"schema_version":"1.0","source":{"id":"2411.17596","kind":"arxiv","version":2}},"canonical_sha256":"d0c25a522a2efc894badcd79ae50d15676617aedc6ea313626736b476b200018","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0c25a522a2efc894badcd79ae50d15676617aedc6ea313626736b476b200018","first_computed_at":"2026-07-05T09:41:05.058082Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:41:05.058082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oN4sbIW2HgfPZ0fdOuKcV4huaOpRoY7PjPvs6Ka1KRf3NRGXAxXvWcpu9BIauZdtG6v/2Kq0DQJ+eMfumaEzDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:41:05.058561Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.17596","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fd510485c7b6c32700285e4821d93e97bb4ef260d872df96e3a16b1bee4cb1e","sha256:e8db48e31aadc083ceafe741a4326617afabb82edec4f0b47f6de53a61b7c7d9"],"state_sha256":"e6d92d7128835fe4ce13fab8c11e454d8bdfb2e1c6237e98aa7836c815a95649"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7jNJve1M2FwbZJgs6oGL9mMoTiUMBfIO236Di1bK7aJ5tQIGUGM1hAz9hC9rQ/X34afc7PNDwDhLnkfyHHONAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T23:27:42.851779Z","bundle_sha256":"cf1221350b873eaa5665cb2ec0702740aedcf41b4c99a1ca917ff3489a6b77b6"}}