Pith Number

pith:TDAI6VTJ

pith:2026:TDAI6VTJLNAR3GR4KQ3ASO22P6

not attested not anchored not stored refs resolved

Image-aware Layout Generation with User Constraints for Poster Design

Chenchen Xu, Kaixin Han, Weiwei Xu

A neural model generates poster layouts that respect user constraints on element types and partial designs while remaining aware of the product image.

arxiv:2605.13856 v1 · 2026-04-08 · cs.GR

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{TDAI6VTJLNAR3GR4KQ3ASO22P6}

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

Both quantitative and qualitative evaluations demonstrate that our model can generate different image-aware layouts according to various user constraints while achieving state-of-the-art performance.

C2weakest assumption

That sampling multidimensional Gaussian noise with different means plus the attribute-consistent, attribute-disentangled, and partial-constraint losses will reliably enforce the specified constraints without degrading image awareness or layout quality.

C3one line summary

A deep learning model generates image-aware poster layouts that satisfy user-specified attribute constraints via Gaussian noise sampling and partial layout constraints via a dedicated loss and random mask, reaching state-of-the-art performance.

References

88 extracted · 88 resolved · 0 Pith anchors

[1] Structure and Interpretation of Computer Programs 1985

[2] Visual Information Extraction with Lixto 2001

[3] Brachman and James G 1985

[4] Complexity results for nonmonotonic logics 1992

[5] Hypertree Decompositions and Tractable Queries 2002

Receipt and verification

First computed	2026-05-17T23:39:19.546565Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

98c08f56695b411d9a3c5436093b5a7f891175ed9262ebc9fb496c299264bc60

Aliases

arxiv: 2605.13856 · arxiv_version: 2605.13856v1 · doi: 10.48550/arxiv.2605.13856 · pith_short_12: TDAI6VTJLNAR · pith_short_16: TDAI6VTJLNAR3GR4 · pith_short_8: TDAI6VTJ

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/TDAI6VTJLNAR3GR4KQ3ASO22P6 \
  | 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: 98c08f56695b411d9a3c5436093b5a7f891175ed9262ebc9fb496c299264bc60

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "387524f043397af914da8e60ce3e37996bdf4bd8044b6e43690c7d6155da4d70",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.GR",
    "submitted_at": "2026-04-08T11:38:12Z",
    "title_canon_sha256": "f6e94dab6d19a53b80c861c8194834b2a3d8aae7013b517bd6b4c5aa78847f78"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.13856",
    "kind": "arxiv",
    "version": 1
  }
}