{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4TRYVWOQEVSGZBZCK6LINJXN7E","short_pith_number":"pith:4TRYVWOQ","canonical_record":{"source":{"id":"1405.5210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-20T19:59:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e8433f8c223366e870ba54877d29f528454a2d0e0afadd659de20e3ba50c104b","abstract_canon_sha256":"c04e6048aaba6ac21fe6fe76b08a413ada004308254ad5b52c0c85c11b01da6f"},"schema_version":"1.0"},"canonical_sha256":"e4e38ad9d025646c8722579686a6edf9301bffa08b7eb430db5e0babd7a67828","source":{"kind":"arxiv","id":"1405.5210","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5210","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5210v1","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5210","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"4TRYVWOQEVSG","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4TRYVWOQEVSGZBZC","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4TRYVWOQ","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4TRYVWOQEVSGZBZCK6LINJXN7E","target":"record","payload":{"canonical_record":{"source":{"id":"1405.5210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-20T19:59:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e8433f8c223366e870ba54877d29f528454a2d0e0afadd659de20e3ba50c104b","abstract_canon_sha256":"c04e6048aaba6ac21fe6fe76b08a413ada004308254ad5b52c0c85c11b01da6f"},"schema_version":"1.0"},"canonical_sha256":"e4e38ad9d025646c8722579686a6edf9301bffa08b7eb430db5e0babd7a67828","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:25.823737Z","signature_b64":"CsD8g0XtTJ6RtWlLV46/GIqWXhhOxmbG2V7ajNozaWjzPw4Sq2eQTRpVTJ5yWBMjh3kxjYdMB0CdtBtFq5w2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4e38ad9d025646c8722579686a6edf9301bffa08b7eb430db5e0babd7a67828","last_reissued_at":"2026-05-18T02:51:25.823207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:25.823207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.5210","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-18T02:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z020GD0+jFmqB97UMXgY+xXEllXEqJ93HWlVHixUMmYRG6wO25SvA0tJoMiiFMDPCUhdyBFubAVed5p8CVrHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:23:24.790365Z"},"content_sha256":"c8ce98c0a47e093dce6c484922c62464fe840ca4019b9dee4077a7273ae8b02b","schema_version":"1.0","event_id":"sha256:c8ce98c0a47e093dce6c484922c62464fe840ca4019b9dee4077a7273ae8b02b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4TRYVWOQEVSGZBZCK6LINJXN7E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Planar 3-dimensional assignment problems with Monge-like cost arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Ante \\'Custi\\'c, Bettina Klinz, Gerhard J. Woeginger","submitted_at":"2014-05-20T19:59:41Z","abstract_excerpt":"Given an $n\\times n\\times p$ cost array $C$ we consider the problem $p$-P3AP which consists in finding $p$ pairwise disjoint permutations $\\varphi_1,\\varphi_2,\\ldots,\\varphi_p$ of $\\{1,\\ldots,n\\}$ such that $\\sum_{k=1}^{p}\\sum_{i=1}^nc_{i\\varphi_k(i)k}$ is minimized. For the case $p=n$ the planar 3-dimensional assignment problem P3AP results.\n  Our main result concerns the $p$-P3AP on cost arrays $C$ that are layered Monge arrays. In a layered Monge array all $n\\times n$ matrices that result from fixing the third index $k$ are Monge matrices. We prove that the $p$-P3AP and the P3AP remain NP-h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5210","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-18T02:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VBJfsCM5cQix4xf/y5FhGiNrlxaviHkhH4H83IWJo50sRzdy1WFKKFHdnYYaBUcse6qCoaMVxbF741Xja+4aDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:23:24.790711Z"},"content_sha256":"1d47d932ab39285951279383356a68bd0cb1d9f6c6985d953fa6f70013a712ef","schema_version":"1.0","event_id":"sha256:1d47d932ab39285951279383356a68bd0cb1d9f6c6985d953fa6f70013a712ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TRYVWOQEVSGZBZCK6LINJXN7E/bundle.json","state_url":"https://pith.science/pith/4TRYVWOQEVSGZBZCK6LINJXN7E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TRYVWOQEVSGZBZCK6LINJXN7E/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-22T23:23:24Z","links":{"resolver":"https://pith.science/pith/4TRYVWOQEVSGZBZCK6LINJXN7E","bundle":"https://pith.science/pith/4TRYVWOQEVSGZBZCK6LINJXN7E/bundle.json","state":"https://pith.science/pith/4TRYVWOQEVSGZBZCK6LINJXN7E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TRYVWOQEVSGZBZCK6LINJXN7E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4TRYVWOQEVSGZBZCK6LINJXN7E","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":"c04e6048aaba6ac21fe6fe76b08a413ada004308254ad5b52c0c85c11b01da6f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-20T19:59:41Z","title_canon_sha256":"e8433f8c223366e870ba54877d29f528454a2d0e0afadd659de20e3ba50c104b"},"schema_version":"1.0","source":{"id":"1405.5210","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5210","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5210v1","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5210","created_at":"2026-05-18T02:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"4TRYVWOQEVSG","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4TRYVWOQEVSGZBZC","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4TRYVWOQ","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:1d47d932ab39285951279383356a68bd0cb1d9f6c6985d953fa6f70013a712ef","target":"graph","created_at":"2026-05-18T02:51:25Z","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":"Given an $n\\times n\\times p$ cost array $C$ we consider the problem $p$-P3AP which consists in finding $p$ pairwise disjoint permutations $\\varphi_1,\\varphi_2,\\ldots,\\varphi_p$ of $\\{1,\\ldots,n\\}$ such that $\\sum_{k=1}^{p}\\sum_{i=1}^nc_{i\\varphi_k(i)k}$ is minimized. For the case $p=n$ the planar 3-dimensional assignment problem P3AP results.\n  Our main result concerns the $p$-P3AP on cost arrays $C$ that are layered Monge arrays. In a layered Monge array all $n\\times n$ matrices that result from fixing the third index $k$ are Monge matrices. We prove that the $p$-P3AP and the P3AP remain NP-h","authors_text":"Ante \\'Custi\\'c, Bettina Klinz, Gerhard J. Woeginger","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-20T19:59:41Z","title":"Planar 3-dimensional assignment problems with Monge-like cost arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5210","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:c8ce98c0a47e093dce6c484922c62464fe840ca4019b9dee4077a7273ae8b02b","target":"record","created_at":"2026-05-18T02:51:25Z","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":"c04e6048aaba6ac21fe6fe76b08a413ada004308254ad5b52c0c85c11b01da6f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-20T19:59:41Z","title_canon_sha256":"e8433f8c223366e870ba54877d29f528454a2d0e0afadd659de20e3ba50c104b"},"schema_version":"1.0","source":{"id":"1405.5210","kind":"arxiv","version":1}},"canonical_sha256":"e4e38ad9d025646c8722579686a6edf9301bffa08b7eb430db5e0babd7a67828","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4e38ad9d025646c8722579686a6edf9301bffa08b7eb430db5e0babd7a67828","first_computed_at":"2026-05-18T02:51:25.823207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:25.823207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CsD8g0XtTJ6RtWlLV46/GIqWXhhOxmbG2V7ajNozaWjzPw4Sq2eQTRpVTJ5yWBMjh3kxjYdMB0CdtBtFq5w2Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:25.823737Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.5210","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8ce98c0a47e093dce6c484922c62464fe840ca4019b9dee4077a7273ae8b02b","sha256:1d47d932ab39285951279383356a68bd0cb1d9f6c6985d953fa6f70013a712ef"],"state_sha256":"f80b0cc8b1f09877f26545724fb38646d30f0a545350eb562b4210114af58e6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dmEbf24bOBuY++o7HWGF5+hmrUTAFMP9wNNl2jt4FhhVVKuoz3M0H7v7zfsdQomZzdImbTDrjhOsa7LOkEB4Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:23:24.792633Z","bundle_sha256":"6625eecfe94c93a94f3f0ddb0da4a0f4bdbc4fff3c5b809d67911b5855ad2d66"}}