{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HATDQIG3EH4IPBWNBRTPFOYWFD","short_pith_number":"pith:HATDQIG3","schema_version":"1.0","canonical_sha256":"38263820db21f88786cd0c66f2bb1628ca5c66868ade4b810228be61324a86d5","source":{"kind":"arxiv","id":"1805.07178","version":2},"attestation_state":"computed","paper":{"title":"Plastic number and possible optimal solutions for an Euclidean 2-matching in one dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"Andrea Di Gioacchino, Enrico M. Malatesta, Sergio Caracciolo","submitted_at":"2018-05-18T12:45:47Z","abstract_excerpt":"In this work we consider the problem of finding the minimum-weight loop cover of an undirected graph. This combinatorial optimization problem is called 2-matching and can be seen as a relaxation of the traveling salesman problem since one does not have the unique loop condition. We consider this problem both on the complete bipartite and complete graph embedded in a one dimensional interval, the weights being chosen as a convex function of the Euclidean distance between each couple of points. Randomness is introduced throwing independently and uniformly the points in space. We derive the avera"},"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":"1805.07178","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-05-18T12:45:47Z","cross_cats_sorted":[],"title_canon_sha256":"4d7e91918c14ca084c191b640fe93b11083a2efabee89dcf118086f752f0295a","abstract_canon_sha256":"bad49a9131785e960878afc1f50eaacd779425c89214bffa298550fbfe4773c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:17.540640Z","signature_b64":"swK0t+mtFRrC4ZOCvoa22B8OqCmoRsaeUupvMIANNck1xM8YpyHZNFVnJLpeaJTyci5mLpy1n6pZu3HTxj/fCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38263820db21f88786cd0c66f2bb1628ca5c66868ade4b810228be61324a86d5","last_reissued_at":"2026-05-18T00:07:17.539789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:17.539789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Plastic number and possible optimal solutions for an Euclidean 2-matching in one dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"Andrea Di Gioacchino, Enrico M. Malatesta, Sergio Caracciolo","submitted_at":"2018-05-18T12:45:47Z","abstract_excerpt":"In this work we consider the problem of finding the minimum-weight loop cover of an undirected graph. This combinatorial optimization problem is called 2-matching and can be seen as a relaxation of the traveling salesman problem since one does not have the unique loop condition. We consider this problem both on the complete bipartite and complete graph embedded in a one dimensional interval, the weights being chosen as a convex function of the Euclidean distance between each couple of points. Randomness is introduced throwing independently and uniformly the points in space. We derive the avera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07178","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":"1805.07178","created_at":"2026-05-18T00:07:17.539937+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07178v2","created_at":"2026-05-18T00:07:17.539937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07178","created_at":"2026-05-18T00:07:17.539937+00:00"},{"alias_kind":"pith_short_12","alias_value":"HATDQIG3EH4I","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HATDQIG3EH4IPBWN","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HATDQIG3","created_at":"2026-05-18T12:32:28.185984+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/HATDQIG3EH4IPBWNBRTPFOYWFD","json":"https://pith.science/pith/HATDQIG3EH4IPBWNBRTPFOYWFD.json","graph_json":"https://pith.science/api/pith-number/HATDQIG3EH4IPBWNBRTPFOYWFD/graph.json","events_json":"https://pith.science/api/pith-number/HATDQIG3EH4IPBWNBRTPFOYWFD/events.json","paper":"https://pith.science/paper/HATDQIG3"},"agent_actions":{"view_html":"https://pith.science/pith/HATDQIG3EH4IPBWNBRTPFOYWFD","download_json":"https://pith.science/pith/HATDQIG3EH4IPBWNBRTPFOYWFD.json","view_paper":"https://pith.science/paper/HATDQIG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07178&json=true","fetch_graph":"https://pith.science/api/pith-number/HATDQIG3EH4IPBWNBRTPFOYWFD/graph.json","fetch_events":"https://pith.science/api/pith-number/HATDQIG3EH4IPBWNBRTPFOYWFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HATDQIG3EH4IPBWNBRTPFOYWFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HATDQIG3EH4IPBWNBRTPFOYWFD/action/storage_attestation","attest_author":"https://pith.science/pith/HATDQIG3EH4IPBWNBRTPFOYWFD/action/author_attestation","sign_citation":"https://pith.science/pith/HATDQIG3EH4IPBWNBRTPFOYWFD/action/citation_signature","submit_replication":"https://pith.science/pith/HATDQIG3EH4IPBWNBRTPFOYWFD/action/replication_record"}},"created_at":"2026-05-18T00:07:17.539937+00:00","updated_at":"2026-05-18T00:07:17.539937+00:00"}