{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LKQFFEQPJIOSP3EVB6VFMTSCDL","short_pith_number":"pith:LKQFFEQP","canonical_record":{"source":{"id":"1702.07799","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-24T23:23:51Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ce4313ad92226f91f487bc8b05265cbd89c5b7dc2e8c1529e5c9dc03356b7fbf","abstract_canon_sha256":"efba1dd57f720c86827382410ad23aedeef11c4e46acb46d3ac1c2d178844c9d"},"schema_version":"1.0"},"canonical_sha256":"5aa052920f4a1d27ec950faa564e421af675d09c5ea361e2cc2462c871fb9e5c","source":{"kind":"arxiv","id":"1702.07799","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07799","created_at":"2026-05-17T23:56:58Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07799v2","created_at":"2026-05-17T23:56:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07799","created_at":"2026-05-17T23:56:58Z"},{"alias_kind":"pith_short_12","alias_value":"LKQFFEQPJIOS","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LKQFFEQPJIOSP3EV","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LKQFFEQP","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LKQFFEQPJIOSP3EVB6VFMTSCDL","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07799","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-24T23:23:51Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ce4313ad92226f91f487bc8b05265cbd89c5b7dc2e8c1529e5c9dc03356b7fbf","abstract_canon_sha256":"efba1dd57f720c86827382410ad23aedeef11c4e46acb46d3ac1c2d178844c9d"},"schema_version":"1.0"},"canonical_sha256":"5aa052920f4a1d27ec950faa564e421af675d09c5ea361e2cc2462c871fb9e5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:58.881593Z","signature_b64":"9clDz/vTs/Zh4P2j8tb4Ff0tjCAc/7pEQ9KmC5/Bq1CAWNDa5Ra8THaqK0tUZhl77cKT1ezGQ/SlFgeASxoaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aa052920f4a1d27ec950faa564e421af675d09c5ea361e2cc2462c871fb9e5c","last_reissued_at":"2026-05-17T23:56:58.880988Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:58.880988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07799","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-17T23:56:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0BeVoppcsOxTVauX4m1uqW73WIXyGBuJksNrspHhSAm1Lh6n+U/Y46HKeyhT4mDiPKsc+Ag1Cnh0CJK8TEhKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:41:38.235338Z"},"content_sha256":"604a63143b5f7201c422aa7421bae02feff746d85142dfbb1aa3c982956ab59c","schema_version":"1.0","event_id":"sha256:604a63143b5f7201c422aa7421bae02feff746d85142dfbb1aa3c982956ab59c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LKQFFEQPJIOSP3EVB6VFMTSCDL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Methods for Recursive Circle Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Ambros Gleixner, Benjamin M\\\"uller, Jo\\~ao Pedro Pedroso, Stephen Maher","submitted_at":"2017-02-24T23:23:51Z","abstract_excerpt":"Packing rings into a minimum number of rectangles is an optimization problem which appears naturally in the logistics operations of the tube industry. It encompasses two major difficulties, namely the positioning of rings in rectangles and the recursive packing of rings into other rings. This problem is known as the Recursive Circle Packing Problem (RCPP). We present the first dedicated method for solving RCPP that provides strong dual bounds based on an exact Dantzig--Wolfe reformulation of a nonconvex mixed-integer nonlinear programming formulation. The key idea of this reformulation is to b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07799","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-17T23:56:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R1ex6GjqANJQcwjBw1kC2Ty7cr90dsu8Ltmy2Ue/+4527mlbgdK08G5mj4fY/UhPRMioTaZJQiBn6yg/ld/sDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:41:38.236025Z"},"content_sha256":"6a0836caf7c1cbd7dfb5e874f5ec58d3926cbf6a852221bb19689ce159f59121","schema_version":"1.0","event_id":"sha256:6a0836caf7c1cbd7dfb5e874f5ec58d3926cbf6a852221bb19689ce159f59121"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LKQFFEQPJIOSP3EVB6VFMTSCDL/bundle.json","state_url":"https://pith.science/pith/LKQFFEQPJIOSP3EVB6VFMTSCDL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LKQFFEQPJIOSP3EVB6VFMTSCDL/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-04T20:41:38Z","links":{"resolver":"https://pith.science/pith/LKQFFEQPJIOSP3EVB6VFMTSCDL","bundle":"https://pith.science/pith/LKQFFEQPJIOSP3EVB6VFMTSCDL/bundle.json","state":"https://pith.science/pith/LKQFFEQPJIOSP3EVB6VFMTSCDL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LKQFFEQPJIOSP3EVB6VFMTSCDL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LKQFFEQPJIOSP3EVB6VFMTSCDL","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":"efba1dd57f720c86827382410ad23aedeef11c4e46acb46d3ac1c2d178844c9d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-24T23:23:51Z","title_canon_sha256":"ce4313ad92226f91f487bc8b05265cbd89c5b7dc2e8c1529e5c9dc03356b7fbf"},"schema_version":"1.0","source":{"id":"1702.07799","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07799","created_at":"2026-05-17T23:56:58Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07799v2","created_at":"2026-05-17T23:56:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07799","created_at":"2026-05-17T23:56:58Z"},{"alias_kind":"pith_short_12","alias_value":"LKQFFEQPJIOS","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LKQFFEQPJIOSP3EV","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LKQFFEQP","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:6a0836caf7c1cbd7dfb5e874f5ec58d3926cbf6a852221bb19689ce159f59121","target":"graph","created_at":"2026-05-17T23:56:58Z","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":"Packing rings into a minimum number of rectangles is an optimization problem which appears naturally in the logistics operations of the tube industry. It encompasses two major difficulties, namely the positioning of rings in rectangles and the recursive packing of rings into other rings. This problem is known as the Recursive Circle Packing Problem (RCPP). We present the first dedicated method for solving RCPP that provides strong dual bounds based on an exact Dantzig--Wolfe reformulation of a nonconvex mixed-integer nonlinear programming formulation. The key idea of this reformulation is to b","authors_text":"Ambros Gleixner, Benjamin M\\\"uller, Jo\\~ao Pedro Pedroso, Stephen Maher","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-24T23:23:51Z","title":"Exact Methods for Recursive Circle Packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07799","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:604a63143b5f7201c422aa7421bae02feff746d85142dfbb1aa3c982956ab59c","target":"record","created_at":"2026-05-17T23:56:58Z","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":"efba1dd57f720c86827382410ad23aedeef11c4e46acb46d3ac1c2d178844c9d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-24T23:23:51Z","title_canon_sha256":"ce4313ad92226f91f487bc8b05265cbd89c5b7dc2e8c1529e5c9dc03356b7fbf"},"schema_version":"1.0","source":{"id":"1702.07799","kind":"arxiv","version":2}},"canonical_sha256":"5aa052920f4a1d27ec950faa564e421af675d09c5ea361e2cc2462c871fb9e5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5aa052920f4a1d27ec950faa564e421af675d09c5ea361e2cc2462c871fb9e5c","first_computed_at":"2026-05-17T23:56:58.880988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:58.880988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9clDz/vTs/Zh4P2j8tb4Ff0tjCAc/7pEQ9KmC5/Bq1CAWNDa5Ra8THaqK0tUZhl77cKT1ezGQ/SlFgeASxoaCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:58.881593Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07799","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:604a63143b5f7201c422aa7421bae02feff746d85142dfbb1aa3c982956ab59c","sha256:6a0836caf7c1cbd7dfb5e874f5ec58d3926cbf6a852221bb19689ce159f59121"],"state_sha256":"fe94e57e57b3a68f537eb1d9a8b946974568fab6292261be3285fa280c456b48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wy7wVBTPbrH4jP57c3ADGnzriSXoNgY+wvoocEYniTHhs7hIZWU+5ztZyfThKdga1hv/z5QoJFF3YKSwru+mBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:41:38.239773Z","bundle_sha256":"60f788d086511658a32b9fc869778cbe4b66e2725a582ff20784b3cd79d09173"}}