{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FCPMUJA22FKZBXLRM4UF3C5MU7","short_pith_number":"pith:FCPMUJA2","canonical_record":{"source":{"id":"1709.00252","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-01T11:27:55Z","cross_cats_sorted":[],"title_canon_sha256":"2c293c5d52eafb623dac0eb3d640039925582fd9849ab0e47e87870db4fa7c0e","abstract_canon_sha256":"521d595c5298fb5d2a62d35e4ec7bd24fb6e7a49750aefa935b181e8b919a940"},"schema_version":"1.0"},"canonical_sha256":"289eca241ad15590dd7167285d8baca7e8dc629a0444ed81cc9dd771cc7a1336","source":{"kind":"arxiv","id":"1709.00252","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00252","created_at":"2026-05-18T00:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00252v2","created_at":"2026-05-18T00:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00252","created_at":"2026-05-18T00:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"FCPMUJA22FKZ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FCPMUJA22FKZBXLR","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FCPMUJA2","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FCPMUJA22FKZBXLRM4UF3C5MU7","target":"record","payload":{"canonical_record":{"source":{"id":"1709.00252","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-01T11:27:55Z","cross_cats_sorted":[],"title_canon_sha256":"2c293c5d52eafb623dac0eb3d640039925582fd9849ab0e47e87870db4fa7c0e","abstract_canon_sha256":"521d595c5298fb5d2a62d35e4ec7bd24fb6e7a49750aefa935b181e8b919a940"},"schema_version":"1.0"},"canonical_sha256":"289eca241ad15590dd7167285d8baca7e8dc629a0444ed81cc9dd771cc7a1336","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:38.897715Z","signature_b64":"qj6d8Fr/jBJvcZMl8inb57yIDNI1vqx9ty8VEZts70Y/uxAWzg43c5PjxL4nKgMejIby9+xTMZrCHEBJ+IaIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"289eca241ad15590dd7167285d8baca7e8dc629a0444ed81cc9dd771cc7a1336","last_reissued_at":"2026-05-18T00:33:38.897171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:38.897171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.00252","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-05-18T00:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WVjDfaZL+XfPIkpsD43rgE5so8UZl/ORMTjsMCy9RSluDiOX9QvuQPyhzj/1ZjBApCYysi9ov5myIBfXE2rIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:14:17.500372Z"},"content_sha256":"49ffd2310f185216c5ce2d733d72fb5e968b2a27097e346cedc591810bc34c8d","schema_version":"1.0","event_id":"sha256:49ffd2310f185216c5ce2d733d72fb5e968b2a27097e346cedc591810bc34c8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FCPMUJA22FKZBXLRM4UF3C5MU7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MILP and Max-Clique based heuristics for the Eternity II puzzle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabio Salassa, Federico Della Croce, Greet Vanden Berghe, Tony Wauters, Wim Vancroonenburg","submitted_at":"2017-09-01T11:27:55Z","abstract_excerpt":"The present paper considers a hybrid local search approach to the Eternity II puzzle and to unsigned, rectangular, edge matching puzzles in general. Both an original mixed-integer linear programming (MILP) formulation and a novel Max-Clique formulation are presented for this NP-hard problem. Although the presented formulations remain computationally intractable for medium and large sized instances, they can serve as the basis for developing heuristic decompositions and very large scale neighbourhoods. As a side product of the Max-Clique formulation, new hard-to-solve instances are published fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00252","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":""},"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-05-18T00:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"csHw9hZKTh7K77pEe878897vbqsl5cP7JqKfdFPHWnjU0U7RFuVdXKfh6iK7nCoJ1VDo5FSMQPlFBi8Z44CVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:14:17.500721Z"},"content_sha256":"072f585979146b1b3f6228a49e6c4b24732853e6f94d37c08e9c65d004451396","schema_version":"1.0","event_id":"sha256:072f585979146b1b3f6228a49e6c4b24732853e6f94d37c08e9c65d004451396"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FCPMUJA22FKZBXLRM4UF3C5MU7/bundle.json","state_url":"https://pith.science/pith/FCPMUJA22FKZBXLRM4UF3C5MU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FCPMUJA22FKZBXLRM4UF3C5MU7/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-06-25T08:14:17Z","links":{"resolver":"https://pith.science/pith/FCPMUJA22FKZBXLRM4UF3C5MU7","bundle":"https://pith.science/pith/FCPMUJA22FKZBXLRM4UF3C5MU7/bundle.json","state":"https://pith.science/pith/FCPMUJA22FKZBXLRM4UF3C5MU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FCPMUJA22FKZBXLRM4UF3C5MU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FCPMUJA22FKZBXLRM4UF3C5MU7","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":"521d595c5298fb5d2a62d35e4ec7bd24fb6e7a49750aefa935b181e8b919a940","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-01T11:27:55Z","title_canon_sha256":"2c293c5d52eafb623dac0eb3d640039925582fd9849ab0e47e87870db4fa7c0e"},"schema_version":"1.0","source":{"id":"1709.00252","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00252","created_at":"2026-05-18T00:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00252v2","created_at":"2026-05-18T00:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00252","created_at":"2026-05-18T00:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"FCPMUJA22FKZ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FCPMUJA22FKZBXLR","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FCPMUJA2","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:072f585979146b1b3f6228a49e6c4b24732853e6f94d37c08e9c65d004451396","target":"graph","created_at":"2026-05-18T00:33:38Z","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"},"paper":{"abstract_excerpt":"The present paper considers a hybrid local search approach to the Eternity II puzzle and to unsigned, rectangular, edge matching puzzles in general. Both an original mixed-integer linear programming (MILP) formulation and a novel Max-Clique formulation are presented for this NP-hard problem. Although the presented formulations remain computationally intractable for medium and large sized instances, they can serve as the basis for developing heuristic decompositions and very large scale neighbourhoods. As a side product of the Max-Clique formulation, new hard-to-solve instances are published fo","authors_text":"Fabio Salassa, Federico Della Croce, Greet Vanden Berghe, Tony Wauters, Wim Vancroonenburg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-01T11:27:55Z","title":"MILP and Max-Clique based heuristics for the Eternity II puzzle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00252","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:49ffd2310f185216c5ce2d733d72fb5e968b2a27097e346cedc591810bc34c8d","target":"record","created_at":"2026-05-18T00:33:38Z","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":"521d595c5298fb5d2a62d35e4ec7bd24fb6e7a49750aefa935b181e8b919a940","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-01T11:27:55Z","title_canon_sha256":"2c293c5d52eafb623dac0eb3d640039925582fd9849ab0e47e87870db4fa7c0e"},"schema_version":"1.0","source":{"id":"1709.00252","kind":"arxiv","version":2}},"canonical_sha256":"289eca241ad15590dd7167285d8baca7e8dc629a0444ed81cc9dd771cc7a1336","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"289eca241ad15590dd7167285d8baca7e8dc629a0444ed81cc9dd771cc7a1336","first_computed_at":"2026-05-18T00:33:38.897171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:38.897171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qj6d8Fr/jBJvcZMl8inb57yIDNI1vqx9ty8VEZts70Y/uxAWzg43c5PjxL4nKgMejIby9+xTMZrCHEBJ+IaIBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:38.897715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.00252","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49ffd2310f185216c5ce2d733d72fb5e968b2a27097e346cedc591810bc34c8d","sha256:072f585979146b1b3f6228a49e6c4b24732853e6f94d37c08e9c65d004451396"],"state_sha256":"4a4560b634d104685450ae9dca045599808fd11884d80039a3f97e7f59e74320"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GVWx+4BfALt3QVPp4nstX5gYFRh4oE3aS+7HIJjIc2IyaVzIgMszrbGtmGzG+7vIZjM+7gcdwnr5xXn2RwHHBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T08:14:17.502664Z","bundle_sha256":"ce23fda703e3d26cab77366c9c7ee3953a92cfe772031681cb6318f56d14a995"}}