{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4YXD5CUKBRRDKV3ZVYWEPWFDYV","short_pith_number":"pith:4YXD5CUK","schema_version":"1.0","canonical_sha256":"e62e3e8a8a0c62355779ae2c47d8a3c579f02e3232e2485c9e1dfecf5aa6f888","source":{"kind":"arxiv","id":"1511.03354","version":2},"attestation_state":"computed","paper":{"title":"Approximate global minimizers to pairwise interaction problems via convex relaxation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"David Shirokoff, Mahdi Bandegi","submitted_at":"2015-11-11T01:47:13Z","abstract_excerpt":"We present a new approach for computing approximate global minimizers to a large class of non-local pairwise interaction problems defined over probability distributions. The approach predicts candidate global minimizers, with a recovery guarantee, that are sometimes exact, and often within a few percent of the optimum energy (under appropriate normalization of the energy). The procedure relies on a convex relaxation of the pairwise energy that exploits translational symmetry, followed by a recovery procedure that minimizes a relative entropy. Numerical discretizations of the convex relaxation "},"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":"1511.03354","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-11T01:47:13Z","cross_cats_sorted":[],"title_canon_sha256":"649467959822a71b95b30ea37807f296f7102071808ba1efb6af20111ca5c63e","abstract_canon_sha256":"8a2bec21117e5c9fffe671cbf53d050e19c8d28b278fbb20dc2d2f3b77875b46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:53.465423Z","signature_b64":"6a2XYSp5T2bg6AB71iR/izRRQjGCyb+ibNuSONPcO6/eg7N6o0UsevFdivzOzqmKGsVxmHkGJKJ3H8wthdtJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e62e3e8a8a0c62355779ae2c47d8a3c579f02e3232e2485c9e1dfecf5aa6f888","last_reissued_at":"2026-05-18T00:33:53.464887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:53.464887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate global minimizers to pairwise interaction problems via convex relaxation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"David Shirokoff, Mahdi Bandegi","submitted_at":"2015-11-11T01:47:13Z","abstract_excerpt":"We present a new approach for computing approximate global minimizers to a large class of non-local pairwise interaction problems defined over probability distributions. The approach predicts candidate global minimizers, with a recovery guarantee, that are sometimes exact, and often within a few percent of the optimum energy (under appropriate normalization of the energy). The procedure relies on a convex relaxation of the pairwise energy that exploits translational symmetry, followed by a recovery procedure that minimizes a relative entropy. Numerical discretizations of the convex relaxation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03354","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.03354","created_at":"2026-05-18T00:33:53.464980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.03354v2","created_at":"2026-05-18T00:33:53.464980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03354","created_at":"2026-05-18T00:33:53.464980+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YXD5CUKBRRD","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YXD5CUKBRRDKV3Z","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YXD5CUK","created_at":"2026-05-18T12:29:05.191682+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/4YXD5CUKBRRDKV3ZVYWEPWFDYV","json":"https://pith.science/pith/4YXD5CUKBRRDKV3ZVYWEPWFDYV.json","graph_json":"https://pith.science/api/pith-number/4YXD5CUKBRRDKV3ZVYWEPWFDYV/graph.json","events_json":"https://pith.science/api/pith-number/4YXD5CUKBRRDKV3ZVYWEPWFDYV/events.json","paper":"https://pith.science/paper/4YXD5CUK"},"agent_actions":{"view_html":"https://pith.science/pith/4YXD5CUKBRRDKV3ZVYWEPWFDYV","download_json":"https://pith.science/pith/4YXD5CUKBRRDKV3ZVYWEPWFDYV.json","view_paper":"https://pith.science/paper/4YXD5CUK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.03354&json=true","fetch_graph":"https://pith.science/api/pith-number/4YXD5CUKBRRDKV3ZVYWEPWFDYV/graph.json","fetch_events":"https://pith.science/api/pith-number/4YXD5CUKBRRDKV3ZVYWEPWFDYV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YXD5CUKBRRDKV3ZVYWEPWFDYV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YXD5CUKBRRDKV3ZVYWEPWFDYV/action/storage_attestation","attest_author":"https://pith.science/pith/4YXD5CUKBRRDKV3ZVYWEPWFDYV/action/author_attestation","sign_citation":"https://pith.science/pith/4YXD5CUKBRRDKV3ZVYWEPWFDYV/action/citation_signature","submit_replication":"https://pith.science/pith/4YXD5CUKBRRDKV3ZVYWEPWFDYV/action/replication_record"}},"created_at":"2026-05-18T00:33:53.464980+00:00","updated_at":"2026-05-18T00:33:53.464980+00:00"}