pith. sign in
Pith Number

pith:JTRJV6T6

pith:2026:JTRJV6T6IUGZSOK6IYL5XTWD6J
not attested not anchored not stored refs resolved

OPTIMUS: Optimization Productivity Tool for Intelligent Management of Utilizable Space

Balaji Nagarajan, Karthik Nair, Nisha Singh, Nithin Surendran, Salman Haider, Souvik Bhattacharyya, Ved Prakash Dwivedi

A linear binary knapsack model solved by dynamic programming optimizes retail bay space and delivers 11.8 percent average sales lift.

arxiv:2605.14430 v1 · 2026-05-14 · math.OC

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{JTRJV6T6IUGZSOK6IYL5XTWD6J}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest 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%.

C2weakest 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.

C3one 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.

References

12 extracted · 12 resolved · 0 Pith anchors

[1] Management Science , volume= 1981
[2] Journal of retailing , volume= 1994
[3] European Journal of Operational Research , volume= 2017
[4] Management Science , volume= 2010
[5] Knapsack problems , pages= 2004
Receipt and verification
First computed 2026-05-17T23:39:07.143806Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

4ce29afa7e450d99395e4617dbcec3f2774013b736a7bb7afd2c0c2ace5cfd67

Aliases

arxiv: 2605.14430 · arxiv_version: 2605.14430v1 · doi: 10.48550/arxiv.2605.14430 · pith_short_12: JTRJV6T6IUGZ · pith_short_16: JTRJV6T6IUGZSOK6 · pith_short_8: JTRJV6T6
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/JTRJV6T6IUGZSOK6IYL5XTWD6J \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 4ce29afa7e450d99395e4617dbcec3f2774013b736a7bb7afd2c0c2ace5cfd67
Canonical record JSON
{
  "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
  }
}