{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DENDB4X63QQ34BCDCWDVBKHLDV","short_pith_number":"pith:DENDB4X6","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"},"canonical_sha256":"191a30f2fedc21be0443158750a8eb1d5ee9f87145a9718b2b032a0681883146","source":{"kind":"arxiv","id":"1405.6096","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6096","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6096v2","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6096","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"pith_short_12","alias_value":"DENDB4X63QQ3","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DENDB4X63QQ34BCD","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DENDB4X6","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DENDB4X63QQ34BCDCWDVBKHLDV","target":"record","payload":{"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"},"canonical_sha256":"191a30f2fedc21be0443158750a8eb1d5ee9f87145a9718b2b032a0681883146","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"},"source_kind":"arxiv","source_id":"1405.6096","source_version":2,"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:48:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+r86DvRvnGfbE7T9JUjwvPQERudTTHe/0BTYOE22jPXwJfeM0aoGKuViVyMBlr852YuFWRtw8dSZEb9zHARqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:03:25.443537Z"},"content_sha256":"82191d1025bf14c023a52f38c44a2cb7a586994c2350b33d5de115fd618fbfd1","schema_version":"1.0","event_id":"sha256:82191d1025bf14c023a52f38c44a2cb7a586994c2350b33d5de115fd618fbfd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DENDB4X63QQ34BCDCWDVBKHLDV","target":"graph","payload":{"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"},"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:48:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uqBHGbnz8Fr0ekJqDc21rb/0taqAJ2V161s3Io2nRiZVSwahEAyacKwysm03FTo6i6TFcB4gCgSBAObEpc6XCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:03:25.443879Z"},"content_sha256":"fb4961dede8b6a5c72008c9beb0ddf143303ad29c2dff7a3859a61ec4716af71","schema_version":"1.0","event_id":"sha256:fb4961dede8b6a5c72008c9beb0ddf143303ad29c2dff7a3859a61ec4716af71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DENDB4X63QQ34BCDCWDVBKHLDV/bundle.json","state_url":"https://pith.science/pith/DENDB4X63QQ34BCDCWDVBKHLDV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DENDB4X63QQ34BCDCWDVBKHLDV/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:03:25Z","links":{"resolver":"https://pith.science/pith/DENDB4X63QQ34BCDCWDVBKHLDV","bundle":"https://pith.science/pith/DENDB4X63QQ34BCDCWDVBKHLDV/bundle.json","state":"https://pith.science/pith/DENDB4X63QQ34BCDCWDVBKHLDV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DENDB4X63QQ34BCDCWDVBKHLDV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DENDB4X63QQ34BCDCWDVBKHLDV","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":"972db13c92180e8f8f6568f645aea7a3e7cb7406afb108bad1de2251602de15a","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-19T20:36:50Z","title_canon_sha256":"fa66b27fe4348d1051db111d9e47ad58074d47b08374b7ad45c5c654f6637091"},"schema_version":"1.0","source":{"id":"1405.6096","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6096","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6096v2","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6096","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"pith_short_12","alias_value":"DENDB4X63QQ3","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DENDB4X63QQ34BCD","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DENDB4X6","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:fb4961dede8b6a5c72008c9beb0ddf143303ad29c2dff7a3859a61ec4716af71","target":"graph","created_at":"2026-05-18T02:48:01Z","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 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 ","authors_text":"Ante \\'Custi\\'c, Bettina Klinz","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-19T20:36:50Z","title":"The constant objective value property for combinatorial optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6096","kind":"arxiv","version":2},"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:82191d1025bf14c023a52f38c44a2cb7a586994c2350b33d5de115fd618fbfd1","target":"record","created_at":"2026-05-18T02:48:01Z","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":"972db13c92180e8f8f6568f645aea7a3e7cb7406afb108bad1de2251602de15a","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-19T20:36:50Z","title_canon_sha256":"fa66b27fe4348d1051db111d9e47ad58074d47b08374b7ad45c5c654f6637091"},"schema_version":"1.0","source":{"id":"1405.6096","kind":"arxiv","version":2}},"canonical_sha256":"191a30f2fedc21be0443158750a8eb1d5ee9f87145a9718b2b032a0681883146","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"191a30f2fedc21be0443158750a8eb1d5ee9f87145a9718b2b032a0681883146","first_computed_at":"2026-05-18T02:48:01.987555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:01.987555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Iw29iBjHex1T7n3p094qHNv+yYpjTQr1kLB90FFDz83TACf6TunG0QLqgAAylr4x3kSsrC+z1P2GKq2lsIvRBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:01.988123Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6096","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82191d1025bf14c023a52f38c44a2cb7a586994c2350b33d5de115fd618fbfd1","sha256:fb4961dede8b6a5c72008c9beb0ddf143303ad29c2dff7a3859a61ec4716af71"],"state_sha256":"e8b1a16d67340e901e8db0b60dd47a5ba6c581e789e36044f53ad8b4f9fd2826"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Vim9B/hIpXnOe3CgdIJcBAbkAXHatedImgS1b2KBEIZwP3uLTnyfmroLiR3jOa8WJ/7vwq/zOj1Qh1ufYzzAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:03:25.445809Z","bundle_sha256":"2df72516537b7d95f31896a05ca65b0fc742edef660d80bc418eb106f3fdddc4"}}