{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DENDB4X63QQ34BCDCWDVBKHLDV","short_pith_number":"pith:DENDB4X6","schema_version":"1.0","canonical_sha256":"191a30f2fedc21be0443158750a8eb1d5ee9f87145a9718b2b032a0681883146","source":{"kind":"arxiv","id":"1405.6096","version":2},"attestation_state":"computed","paper":{"title":"The constant objective value property for combinatorial optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Ante \\'Custi\\'c, Bettina Klinz","submitted_at":"2014-05-19T20:36:50Z","abstract_excerpt":"Given a combinatorial optimization problem, we aim at characterizing the set of all instances for which every feasible solution has the same objective value.\n  Our central result deals with multi-dimensional assignment problems. We show that for the axial and for the planar $d$-dimensional assignment problem instances with constant objective value property are characterized by sum-decomposable arrays. We provide a counterexample to show that the result does not carry over to general $d$-dimensional assignment problems.\n  Our result for the axial $d$-dimensional assignment problem can be shown "},"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":"1405.6096","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-19T20:36:50Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"fa66b27fe4348d1051db111d9e47ad58074d47b08374b7ad45c5c654f6637091","abstract_canon_sha256":"972db13c92180e8f8f6568f645aea7a3e7cb7406afb108bad1de2251602de15a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:01.988123Z","signature_b64":"Iw29iBjHex1T7n3p094qHNv+yYpjTQr1kLB90FFDz83TACf6TunG0QLqgAAylr4x3kSsrC+z1P2GKq2lsIvRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"191a30f2fedc21be0443158750a8eb1d5ee9f87145a9718b2b032a0681883146","last_reissued_at":"2026-05-18T02:48:01.987555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:01.987555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The constant objective value property for combinatorial optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Ante \\'Custi\\'c, Bettina Klinz","submitted_at":"2014-05-19T20:36:50Z","abstract_excerpt":"Given a combinatorial optimization problem, we aim at characterizing the set of all instances for which every feasible solution has the same objective value.\n  Our central result deals with multi-dimensional assignment problems. We show that for the axial and for the planar $d$-dimensional assignment problem instances with constant objective value property are characterized by sum-decomposable arrays. We provide a counterexample to show that the result does not carry over to general $d$-dimensional assignment problems.\n  Our result for the axial $d$-dimensional assignment problem can be shown "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6096","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":"1405.6096","created_at":"2026-05-18T02:48:01.987631+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.6096v2","created_at":"2026-05-18T02:48:01.987631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6096","created_at":"2026-05-18T02:48:01.987631+00:00"},{"alias_kind":"pith_short_12","alias_value":"DENDB4X63QQ3","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DENDB4X63QQ34BCD","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DENDB4X6","created_at":"2026-05-18T12:28:25.294606+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/DENDB4X63QQ34BCDCWDVBKHLDV","json":"https://pith.science/pith/DENDB4X63QQ34BCDCWDVBKHLDV.json","graph_json":"https://pith.science/api/pith-number/DENDB4X63QQ34BCDCWDVBKHLDV/graph.json","events_json":"https://pith.science/api/pith-number/DENDB4X63QQ34BCDCWDVBKHLDV/events.json","paper":"https://pith.science/paper/DENDB4X6"},"agent_actions":{"view_html":"https://pith.science/pith/DENDB4X63QQ34BCDCWDVBKHLDV","download_json":"https://pith.science/pith/DENDB4X63QQ34BCDCWDVBKHLDV.json","view_paper":"https://pith.science/paper/DENDB4X6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.6096&json=true","fetch_graph":"https://pith.science/api/pith-number/DENDB4X63QQ34BCDCWDVBKHLDV/graph.json","fetch_events":"https://pith.science/api/pith-number/DENDB4X63QQ34BCDCWDVBKHLDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DENDB4X63QQ34BCDCWDVBKHLDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DENDB4X63QQ34BCDCWDVBKHLDV/action/storage_attestation","attest_author":"https://pith.science/pith/DENDB4X63QQ34BCDCWDVBKHLDV/action/author_attestation","sign_citation":"https://pith.science/pith/DENDB4X63QQ34BCDCWDVBKHLDV/action/citation_signature","submit_replication":"https://pith.science/pith/DENDB4X63QQ34BCDCWDVBKHLDV/action/replication_record"}},"created_at":"2026-05-18T02:48:01.987631+00:00","updated_at":"2026-05-18T02:48:01.987631+00:00"}