{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JTRJV6T6IUGZSOK6IYL5XTWD6J","short_pith_number":"pith:JTRJV6T6","canonical_record":{"source":{"id":"2605.14430","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T06:21:02Z","cross_cats_sorted":[],"title_canon_sha256":"3e38fcc8502f97077e4d39c329e839dd14857527ba78fb16b07140a9a24c4ce6","abstract_canon_sha256":"c41bc410450cd90bb80a2ba1c0fd0fcff1d7c7b3f840da1bde325d4a7255ca39"},"schema_version":"1.0"},"canonical_sha256":"4ce29afa7e450d99395e4617dbcec3f2774013b736a7bb7afd2c0c2ace5cfd67","source":{"kind":"arxiv","id":"2605.14430","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14430","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14430v1","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14430","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"JTRJV6T6IUGZ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"JTRJV6T6IUGZSOK6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"JTRJV6T6","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JTRJV6T6IUGZSOK6IYL5XTWD6J","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14430","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T06:21:02Z","cross_cats_sorted":[],"title_canon_sha256":"3e38fcc8502f97077e4d39c329e839dd14857527ba78fb16b07140a9a24c4ce6","abstract_canon_sha256":"c41bc410450cd90bb80a2ba1c0fd0fcff1d7c7b3f840da1bde325d4a7255ca39"},"schema_version":"1.0"},"canonical_sha256":"4ce29afa7e450d99395e4617dbcec3f2774013b736a7bb7afd2c0c2ace5cfd67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:07.144672Z","signature_b64":"gxPjnc2QJKkD/CqpoOGyVbUkM22QiwVEQqKq0pmNltrQHDWPi6NWmhzAhx9aytMP1vE8cNWqtSprKAxFGFRMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ce29afa7e450d99395e4617dbcec3f2774013b736a7bb7afd2c0c2ace5cfd67","last_reissued_at":"2026-05-17T23:39:07.143806Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:07.143806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14430","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-17T23:39:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MxjbBOtsa5M1y9Rcw1abSpA08cvp8Wg8UjyJJ5sUa3TaQ6eYTIXB3+SBNLUnbw6W5GxrB/J8Wf6sli/rnuv3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:09:26.826888Z"},"content_sha256":"f6539d45fb27344d10e61e8910111452cae7f95719d91410cf5852bbfb96c16f","schema_version":"1.0","event_id":"sha256:f6539d45fb27344d10e61e8910111452cae7f95719d91410cf5852bbfb96c16f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JTRJV6T6IUGZSOK6IYL5XTWD6J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"OPTIMUS: Optimization Productivity Tool for Intelligent Management of Utilizable Space","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A linear binary knapsack model solved by dynamic programming optimizes retail bay space and delivers 11.8 percent average sales lift.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Balaji Nagarajan, Karthik Nair, Nisha Singh, Nithin Surendran, Salman Haider, Souvik Bhattacharyya, Ved Prakash Dwivedi","submitted_at":"2026-05-14T06:21:02Z","abstract_excerpt":"We study department-level retail space optimization, where limited bay capacity must be allocated among planograms (POGs) under business and operational constraints. The problem is formulated as a linear binary knapsack model, with potential SKUs treated as items characterized by space requirements and weighted value contributions from sales, margin, units, and assortment similarity. Dynamic Programming (DP) is employed to obtain exact and reproducible assortment decisions in O(nc) time, avoiding the variance inherent in heuristic approaches. These decisions are integrated with a second-stage "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Evaluated end-to-end across ten optimization runs spanning multiple departments and store clusters, the OPTIMUS framework achieves an average sales lift of 11.8% and an average margin lift of 9.5%.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that a linear binary knapsack model with hand-chosen or fitted weights for sales, margin, units, and assortment similarity fully captures real business and operational constraints without significant omitted factors or non-linear effects.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"OPTIMUS uses binary knapsack modeling and dynamic programming to allocate retail space among planograms, achieving 11.8% average sales lift and 9.5% margin lift in multi-department evaluations.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A linear binary knapsack model solved by dynamic programming optimizes retail bay space and delivers 11.8 percent average sales lift.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"7a46fb342c2086ada14218fb634a652646d6d1eb333bb932c4e9c944cf52e1e6"},"source":{"id":"2605.14430","kind":"arxiv","version":1},"verdict":{"id":"6669eaef-d6bc-46d7-ba6b-8b31ea93989e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T01:53:45.481270Z","strongest_claim":"Evaluated end-to-end across ten optimization runs spanning multiple departments and store clusters, the OPTIMUS framework achieves an average sales lift of 11.8% and an average margin lift of 9.5%.","one_line_summary":"OPTIMUS uses binary knapsack modeling and dynamic programming to allocate retail space among planograms, achieving 11.8% average sales lift and 9.5% margin lift in multi-department evaluations.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that a linear binary knapsack model with hand-chosen or fitted weights for sales, margin, units, and assortment similarity fully captures real business and operational constraints without significant omitted factors or non-linear effects.","pith_extraction_headline":"A linear binary knapsack model solved by dynamic programming optimizes retail bay space and delivers 11.8 percent average sales lift."},"references":{"count":12,"sample":[{"doi":"","year":1981,"title":"Management Science , volume=","work_id":"316d5472-d0d9-4dbd-8605-024b5238a764","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1994,"title":"Journal of retailing , volume=","work_id":"5d3e2f50-2cfc-4e3a-9824-5ac27cd13360","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"European Journal of Operational Research , volume=","work_id":"5cac54ab-d74a-4ae2-a4e6-b6cb7a78a161","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2010,"title":"Management Science , volume=","work_id":"e778daf3-326e-483b-b3a7-600dc6fa9e0c","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"Knapsack problems , pages=","work_id":"bb3dc065-5e25-4ea1-a955-e2ebf0177b3f","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":12,"snapshot_sha256":"800159dad3c5c97a983ec46a4e2379518843221caaa7c62fbe5d0e0ed3ed597a","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":"6669eaef-d6bc-46d7-ba6b-8b31ea93989e"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EkLQp/CX7gkTs30GiFrtekD9Huj6ISOij8XOGIPH+DhGEnCK1rBjFoIimiy2T7dRiIQTas3h3+jOCWK9LDG9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:09:26.827422Z"},"content_sha256":"3c716cb59cbdf925e997faa4a9cd7e3b8b88549268910322602188e5e8f31a14","schema_version":"1.0","event_id":"sha256:3c716cb59cbdf925e997faa4a9cd7e3b8b88549268910322602188e5e8f31a14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JTRJV6T6IUGZSOK6IYL5XTWD6J/bundle.json","state_url":"https://pith.science/pith/JTRJV6T6IUGZSOK6IYL5XTWD6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JTRJV6T6IUGZSOK6IYL5XTWD6J/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-04T10:09:26Z","links":{"resolver":"https://pith.science/pith/JTRJV6T6IUGZSOK6IYL5XTWD6J","bundle":"https://pith.science/pith/JTRJV6T6IUGZSOK6IYL5XTWD6J/bundle.json","state":"https://pith.science/pith/JTRJV6T6IUGZSOK6IYL5XTWD6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JTRJV6T6IUGZSOK6IYL5XTWD6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JTRJV6T6IUGZSOK6IYL5XTWD6J","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":"c41bc410450cd90bb80a2ba1c0fd0fcff1d7c7b3f840da1bde325d4a7255ca39","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T06:21:02Z","title_canon_sha256":"3e38fcc8502f97077e4d39c329e839dd14857527ba78fb16b07140a9a24c4ce6"},"schema_version":"1.0","source":{"id":"2605.14430","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14430","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14430v1","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14430","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"JTRJV6T6IUGZ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"JTRJV6T6IUGZSOK6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"JTRJV6T6","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:3c716cb59cbdf925e997faa4a9cd7e3b8b88549268910322602188e5e8f31a14","target":"graph","created_at":"2026-05-17T23:39:07Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Evaluated end-to-end across ten optimization runs spanning multiple departments and store clusters, the OPTIMUS framework achieves an average sales lift of 11.8% and an average margin lift of 9.5%."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that a linear binary knapsack model with hand-chosen or fitted weights for sales, margin, units, and assortment similarity fully captures real business and operational constraints without significant omitted factors or non-linear effects."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"OPTIMUS uses binary knapsack modeling and dynamic programming to allocate retail space among planograms, achieving 11.8% average sales lift and 9.5% margin lift in multi-department evaluations."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A linear binary knapsack model solved by dynamic programming optimizes retail bay space and delivers 11.8 percent average sales lift."}],"snapshot_sha256":"7a46fb342c2086ada14218fb634a652646d6d1eb333bb932c4e9c944cf52e1e6"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study department-level retail space optimization, where limited bay capacity must be allocated among planograms (POGs) under business and operational constraints. The problem is formulated as a linear binary knapsack model, with potential SKUs treated as items characterized by space requirements and weighted value contributions from sales, margin, units, and assortment similarity. Dynamic Programming (DP) is employed to obtain exact and reproducible assortment decisions in O(nc) time, avoiding the variance inherent in heuristic approaches. These decisions are integrated with a second-stage ","authors_text":"Balaji Nagarajan, Karthik Nair, Nisha Singh, Nithin Surendran, Salman Haider, Souvik Bhattacharyya, Ved Prakash Dwivedi","cross_cats":[],"headline":"A linear binary knapsack model solved by dynamic programming optimizes retail bay space and delivers 11.8 percent average sales lift.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T06:21:02Z","title":"OPTIMUS: Optimization Productivity Tool for Intelligent Management of Utilizable Space"},"references":{"count":12,"internal_anchors":0,"resolved_work":12,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Management Science , volume=","work_id":"316d5472-d0d9-4dbd-8605-024b5238a764","year":1981},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Journal of retailing , volume=","work_id":"5d3e2f50-2cfc-4e3a-9824-5ac27cd13360","year":1994},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"European Journal of Operational Research , volume=","work_id":"5cac54ab-d74a-4ae2-a4e6-b6cb7a78a161","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Management Science , volume=","work_id":"e778daf3-326e-483b-b3a7-600dc6fa9e0c","year":2010},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Knapsack problems , pages=","work_id":"bb3dc065-5e25-4ea1-a955-e2ebf0177b3f","year":2004}],"snapshot_sha256":"800159dad3c5c97a983ec46a4e2379518843221caaa7c62fbe5d0e0ed3ed597a"},"source":{"id":"2605.14430","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T01:53:45.481270Z","id":"6669eaef-d6bc-46d7-ba6b-8b31ea93989e","model_set":{"reader":"grok-4.3"},"one_line_summary":"OPTIMUS uses binary knapsack modeling and dynamic programming to allocate retail space among planograms, achieving 11.8% average sales lift and 9.5% margin lift in multi-department evaluations.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A linear binary knapsack model solved by dynamic programming optimizes retail bay space and delivers 11.8 percent average sales lift.","strongest_claim":"Evaluated end-to-end across ten optimization runs spanning multiple departments and store clusters, the OPTIMUS framework achieves an average sales lift of 11.8% and an average margin lift of 9.5%.","weakest_assumption":"The assumption that a linear binary knapsack model with hand-chosen or fitted weights for sales, margin, units, and assortment similarity fully captures real business and operational constraints without significant omitted factors or non-linear effects."}},"verdict_id":"6669eaef-d6bc-46d7-ba6b-8b31ea93989e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f6539d45fb27344d10e61e8910111452cae7f95719d91410cf5852bbfb96c16f","target":"record","created_at":"2026-05-17T23:39:07Z","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":"c41bc410450cd90bb80a2ba1c0fd0fcff1d7c7b3f840da1bde325d4a7255ca39","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T06:21:02Z","title_canon_sha256":"3e38fcc8502f97077e4d39c329e839dd14857527ba78fb16b07140a9a24c4ce6"},"schema_version":"1.0","source":{"id":"2605.14430","kind":"arxiv","version":1}},"canonical_sha256":"4ce29afa7e450d99395e4617dbcec3f2774013b736a7bb7afd2c0c2ace5cfd67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ce29afa7e450d99395e4617dbcec3f2774013b736a7bb7afd2c0c2ace5cfd67","first_computed_at":"2026-05-17T23:39:07.143806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:07.143806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gxPjnc2QJKkD/CqpoOGyVbUkM22QiwVEQqKq0pmNltrQHDWPi6NWmhzAhx9aytMP1vE8cNWqtSprKAxFGFRMAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:07.144672Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14430","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6539d45fb27344d10e61e8910111452cae7f95719d91410cf5852bbfb96c16f","sha256:3c716cb59cbdf925e997faa4a9cd7e3b8b88549268910322602188e5e8f31a14"],"state_sha256":"29db75587083ee68481ba0d57f616547b3a719cbe0744be7aa7aeb4a96e267f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KANt8AOwx+UiyewOGTZpFne2FVWe9J7APxEeFdyM/buDivm+sXwRPA+qN1/LvChWVTjYYRgQUlcYhciFOBFWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T10:09:26.829720Z","bundle_sha256":"5cc04fea58b67459ce81e95a09d9aacb1a6e2fd1a456676c8fd2ef8bbab64091"}}