{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GGQ6IZHIJB6IXK34B6W3JQCMMT","short_pith_number":"pith:GGQ6IZHI","schema_version":"1.0","canonical_sha256":"31a1e464e8487c8bab7c0fadb4c04c64c7799ee7dc1d8eb05960fc361d18fbe0","source":{"kind":"arxiv","id":"1409.0845","version":1},"attestation_state":"computed","paper":{"title":"Geometric versions of the 3-dimensional assignment problem under general norms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Ante \\'Custi\\'c, Bettina Klinz, Gerhard J. Woeginger","submitted_at":"2014-09-02T19:49:59Z","abstract_excerpt":"We discuss the computational complexity of special cases of the 3-dimensional (axial) assignment problem where the elements are points in a Cartesian space and where the cost coefficients are the perimeters of the corresponding triangles measured according to a certain norm. (All our results also carry over to the corresponding special cases of the 3-dimensional matching problem.)\n  The minimization version is NP-hard for every norm, even if the underlying Cartesian space is 2-dimensional. The maximization version is polynomially solvable, if the dimension of the Cartesian space is fixed and i"},"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":"1409.0845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-02T19:49:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"aa3f37cd68d3da3feefd2e748925a4ac81a40a6272307f4b6e7132a53c96daae","abstract_canon_sha256":"f293719060b14cf0f4123075f2a0e3390482162a8a1d77e38fb21b2715af97c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:46.007423Z","signature_b64":"2jtFAzK2jd9faL5MCAmW2+q8eO7Zy20PcEjSQJI8CgoplfyHpjG1ZLl4ivIbhxm5Fd6OHlmw46F0dB0jXiTkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31a1e464e8487c8bab7c0fadb4c04c64c7799ee7dc1d8eb05960fc361d18fbe0","last_reissued_at":"2026-05-18T02:43:46.006941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:46.006941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometric versions of the 3-dimensional assignment problem under general norms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Ante \\'Custi\\'c, Bettina Klinz, Gerhard J. Woeginger","submitted_at":"2014-09-02T19:49:59Z","abstract_excerpt":"We discuss the computational complexity of special cases of the 3-dimensional (axial) assignment problem where the elements are points in a Cartesian space and where the cost coefficients are the perimeters of the corresponding triangles measured according to a certain norm. (All our results also carry over to the corresponding special cases of the 3-dimensional matching problem.)\n  The minimization version is NP-hard for every norm, even if the underlying Cartesian space is 2-dimensional. The maximization version is polynomially solvable, if the dimension of the Cartesian space is fixed and i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0845","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.0845","created_at":"2026-05-18T02:43:46.007022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.0845v1","created_at":"2026-05-18T02:43:46.007022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0845","created_at":"2026-05-18T02:43:46.007022+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGQ6IZHIJB6I","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGQ6IZHIJB6IXK34","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGQ6IZHI","created_at":"2026-05-18T12:28:30.664211+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/GGQ6IZHIJB6IXK34B6W3JQCMMT","json":"https://pith.science/pith/GGQ6IZHIJB6IXK34B6W3JQCMMT.json","graph_json":"https://pith.science/api/pith-number/GGQ6IZHIJB6IXK34B6W3JQCMMT/graph.json","events_json":"https://pith.science/api/pith-number/GGQ6IZHIJB6IXK34B6W3JQCMMT/events.json","paper":"https://pith.science/paper/GGQ6IZHI"},"agent_actions":{"view_html":"https://pith.science/pith/GGQ6IZHIJB6IXK34B6W3JQCMMT","download_json":"https://pith.science/pith/GGQ6IZHIJB6IXK34B6W3JQCMMT.json","view_paper":"https://pith.science/paper/GGQ6IZHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.0845&json=true","fetch_graph":"https://pith.science/api/pith-number/GGQ6IZHIJB6IXK34B6W3JQCMMT/graph.json","fetch_events":"https://pith.science/api/pith-number/GGQ6IZHIJB6IXK34B6W3JQCMMT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGQ6IZHIJB6IXK34B6W3JQCMMT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGQ6IZHIJB6IXK34B6W3JQCMMT/action/storage_attestation","attest_author":"https://pith.science/pith/GGQ6IZHIJB6IXK34B6W3JQCMMT/action/author_attestation","sign_citation":"https://pith.science/pith/GGQ6IZHIJB6IXK34B6W3JQCMMT/action/citation_signature","submit_replication":"https://pith.science/pith/GGQ6IZHIJB6IXK34B6W3JQCMMT/action/replication_record"}},"created_at":"2026-05-18T02:43:46.007022+00:00","updated_at":"2026-05-18T02:43:46.007022+00:00"}