{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5OJNH5EIX5RJGPROJK32FEPD7L","short_pith_number":"pith:5OJNH5EI","canonical_record":{"source":{"id":"1605.05473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-05-18T08:05:39Z","cross_cats_sorted":[],"title_canon_sha256":"78b4f0216391d474ce6b644632417bed302340c607c406037fc83fea147a13ea","abstract_canon_sha256":"d13e08c417bcd7f42122a915367fa38be0b2a5890dfd6f54c8010d67af996fd0"},"schema_version":"1.0"},"canonical_sha256":"eb92d3f488bf62933e2e4ab7a291e3faeaf6ac358e92ed7bc5acb863f8441000","source":{"kind":"arxiv","id":"1605.05473","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05473","created_at":"2026-05-18T00:53:26Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05473v1","created_at":"2026-05-18T00:53:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05473","created_at":"2026-05-18T00:53:26Z"},{"alias_kind":"pith_short_12","alias_value":"5OJNH5EIX5RJ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5OJNH5EIX5RJGPRO","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5OJNH5EI","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5OJNH5EIX5RJGPROJK32FEPD7L","target":"record","payload":{"canonical_record":{"source":{"id":"1605.05473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-05-18T08:05:39Z","cross_cats_sorted":[],"title_canon_sha256":"78b4f0216391d474ce6b644632417bed302340c607c406037fc83fea147a13ea","abstract_canon_sha256":"d13e08c417bcd7f42122a915367fa38be0b2a5890dfd6f54c8010d67af996fd0"},"schema_version":"1.0"},"canonical_sha256":"eb92d3f488bf62933e2e4ab7a291e3faeaf6ac358e92ed7bc5acb863f8441000","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:26.077311Z","signature_b64":"BvOOl14bQ5TZpzOTHjH+TyaYuswOISfZXRR4hl5pC3GPB0Lsab2skp3vFdupnrAGolQkIaIWiQt2Fipd9SZCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb92d3f488bf62933e2e4ab7a291e3faeaf6ac358e92ed7bc5acb863f8441000","last_reissued_at":"2026-05-18T00:53:26.076771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:26.076771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.05473","source_version":1,"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:53:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LCrP0xd5/Oo8NlH4B/YdTSuoYrKKgsDO/BeXNC8fLY/ft13VvBs7qrL8Vo4N9dnpDDH+QsE+4tI2n6b2InZvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:39:15.876723Z"},"content_sha256":"a3a60d125e978a87be101da41e0f6a82f4bee77b586cf4de98dc237bce4893dc","schema_version":"1.0","event_id":"sha256:a3a60d125e978a87be101da41e0f6a82f4bee77b586cf4de98dc237bce4893dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5OJNH5EIX5RJGPROJK32FEPD7L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Damped Arrow-Hurwicz algorithm for sphere packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Marina A. Ferreira, Pierre Degond, S\\'ebastien Motsch","submitted_at":"2016-05-18T08:05:39Z","abstract_excerpt":"We consider algorithms that, from an arbitrarily sampling of $N$ spheres (possibly overlapping), find a close packed configuration without overlapping. These problems can be formulated as minimization problems with non-convex constraints. For such packing problems, we observe that the classical iterative Arrow-Hurwicz algorithm does not converge. We derive a novel algorithm from a multi-step variant of the Arrow-Hurwicz scheme with damping. We compare this algorithm with classical algorithms belonging to the class of linearly constrained Lagrangian methods and show that it performs better. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05473","kind":"arxiv","version":1},"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:53:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JqygIRupVd5WtbPlRE6NWFdI2+ILk8a4ehWGrJ2Nuh/i7h0wjLQreNNFvORGl0P2aMMQfkwlDxG8dGfKqydcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:39:15.877184Z"},"content_sha256":"2abe83ee71942c1b1a5232599cdbf372f979724f23a89f4ab45f0bb1a3851ca3","schema_version":"1.0","event_id":"sha256:2abe83ee71942c1b1a5232599cdbf372f979724f23a89f4ab45f0bb1a3851ca3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5OJNH5EIX5RJGPROJK32FEPD7L/bundle.json","state_url":"https://pith.science/pith/5OJNH5EIX5RJGPROJK32FEPD7L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5OJNH5EIX5RJGPROJK32FEPD7L/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-23T17:39:15Z","links":{"resolver":"https://pith.science/pith/5OJNH5EIX5RJGPROJK32FEPD7L","bundle":"https://pith.science/pith/5OJNH5EIX5RJGPROJK32FEPD7L/bundle.json","state":"https://pith.science/pith/5OJNH5EIX5RJGPROJK32FEPD7L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5OJNH5EIX5RJGPROJK32FEPD7L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5OJNH5EIX5RJGPROJK32FEPD7L","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":"d13e08c417bcd7f42122a915367fa38be0b2a5890dfd6f54c8010d67af996fd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-05-18T08:05:39Z","title_canon_sha256":"78b4f0216391d474ce6b644632417bed302340c607c406037fc83fea147a13ea"},"schema_version":"1.0","source":{"id":"1605.05473","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05473","created_at":"2026-05-18T00:53:26Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05473v1","created_at":"2026-05-18T00:53:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05473","created_at":"2026-05-18T00:53:26Z"},{"alias_kind":"pith_short_12","alias_value":"5OJNH5EIX5RJ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5OJNH5EIX5RJGPRO","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5OJNH5EI","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:2abe83ee71942c1b1a5232599cdbf372f979724f23a89f4ab45f0bb1a3851ca3","target":"graph","created_at":"2026-05-18T00:53:26Z","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":"We consider algorithms that, from an arbitrarily sampling of $N$ spheres (possibly overlapping), find a close packed configuration without overlapping. These problems can be formulated as minimization problems with non-convex constraints. For such packing problems, we observe that the classical iterative Arrow-Hurwicz algorithm does not converge. We derive a novel algorithm from a multi-step variant of the Arrow-Hurwicz scheme with damping. We compare this algorithm with classical algorithms belonging to the class of linearly constrained Lagrangian methods and show that it performs better. We ","authors_text":"Marina A. Ferreira, Pierre Degond, S\\'ebastien Motsch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-05-18T08:05:39Z","title":"Damped Arrow-Hurwicz algorithm for sphere packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05473","kind":"arxiv","version":1},"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:a3a60d125e978a87be101da41e0f6a82f4bee77b586cf4de98dc237bce4893dc","target":"record","created_at":"2026-05-18T00:53:26Z","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":"d13e08c417bcd7f42122a915367fa38be0b2a5890dfd6f54c8010d67af996fd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-05-18T08:05:39Z","title_canon_sha256":"78b4f0216391d474ce6b644632417bed302340c607c406037fc83fea147a13ea"},"schema_version":"1.0","source":{"id":"1605.05473","kind":"arxiv","version":1}},"canonical_sha256":"eb92d3f488bf62933e2e4ab7a291e3faeaf6ac358e92ed7bc5acb863f8441000","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb92d3f488bf62933e2e4ab7a291e3faeaf6ac358e92ed7bc5acb863f8441000","first_computed_at":"2026-05-18T00:53:26.076771Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:26.076771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BvOOl14bQ5TZpzOTHjH+TyaYuswOISfZXRR4hl5pC3GPB0Lsab2skp3vFdupnrAGolQkIaIWiQt2Fipd9SZCAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:26.077311Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05473","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3a60d125e978a87be101da41e0f6a82f4bee77b586cf4de98dc237bce4893dc","sha256:2abe83ee71942c1b1a5232599cdbf372f979724f23a89f4ab45f0bb1a3851ca3"],"state_sha256":"1cc64d69c394c2c5d99cfe088c44fee8f0fe9d3601fe96b6fa8d01bc5a565acb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u24mwYv9aCkaGEmuR05MNxk16nc+zep3jhm3MCF6EHy/RKP7RvrNGeMDWTal5KdIGE6ZYwy2hmrQpDXiNwb1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T17:39:15.879739Z","bundle_sha256":"8603a29625b467326493abefadd8f7fce756a9d72bd62ff112278baed1cc0ed5"}}