{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:RZHCR32KNMCTUS2GOY743KR3KQ","short_pith_number":"pith:RZHCR32K","canonical_record":{"source":{"id":"2011.13417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-11-26T18:18:37Z","cross_cats_sorted":["cs.GR"],"title_canon_sha256":"5307cefb51ac7cd5b3e4d77e11a2c5a55300fa36ef62645187710ab7e51a9975","abstract_canon_sha256":"01ecf5b21548eb94ab50c3ecf2ba0359f75560126b2df33676462853640798db"},"schema_version":"1.0"},"canonical_sha256":"8e4e28ef4a6b053a4b46763fcdaa3b541725023e3a97a181958f3b788e9bcd85","source":{"kind":"arxiv","id":"2011.13417","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.13417","created_at":"2026-07-05T01:54:53Z"},{"alias_kind":"arxiv_version","alias_value":"2011.13417v1","created_at":"2026-07-05T01:54:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.13417","created_at":"2026-07-05T01:54:53Z"},{"alias_kind":"pith_short_12","alias_value":"RZHCR32KNMCT","created_at":"2026-07-05T01:54:53Z"},{"alias_kind":"pith_short_16","alias_value":"RZHCR32KNMCTUS2G","created_at":"2026-07-05T01:54:53Z"},{"alias_kind":"pith_short_8","alias_value":"RZHCR32K","created_at":"2026-07-05T01:54:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:RZHCR32KNMCTUS2GOY743KR3KQ","target":"record","payload":{"canonical_record":{"source":{"id":"2011.13417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-11-26T18:18:37Z","cross_cats_sorted":["cs.GR"],"title_canon_sha256":"5307cefb51ac7cd5b3e4d77e11a2c5a55300fa36ef62645187710ab7e51a9975","abstract_canon_sha256":"01ecf5b21548eb94ab50c3ecf2ba0359f75560126b2df33676462853640798db"},"schema_version":"1.0"},"canonical_sha256":"8e4e28ef4a6b053a4b46763fcdaa3b541725023e3a97a181958f3b788e9bcd85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:54:53.963653Z","signature_b64":"fnZ54mIheYH8JkJfEL8pH1nJFUgcRBJ/EDQuTUCY5Vdt2IVv6ElX4qlV2xbGP7zvNSdkAK7u35BkusSTubzxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e4e28ef4a6b053a4b46763fcdaa3b541725023e3a97a181958f3b788e9bcd85","last_reissued_at":"2026-07-05T01:54:53.963233Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:54:53.963233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.13417","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-07-05T01:54:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f2CtYfDV5HYVE12UabqjLJaC2oxoLNAg1uQO9MAYegGXglUNVq7xkDEV8brw49fl6ZGThIekwVqircVDrs3HBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T11:52:48.566603Z"},"content_sha256":"ce588eef6180959bb67eb1b2f79ec40b0804f56bfbd65a11cd722dc805ea8201","schema_version":"1.0","event_id":"sha256:ce588eef6180959bb67eb1b2f79ec40b0804f56bfbd65a11cd722dc805ea8201"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:RZHCR32KNMCTUS2GOY743KR3KQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generative Layout Modeling using Constraint Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.CV","authors_text":"Leonidas Guibas, Paul Guerrero, Peter Wonka, Tom Kelly, Wamiq Para","submitted_at":"2020-11-26T18:18:37Z","abstract_excerpt":"We propose a new generative model for layout generation. We generate layouts in three steps. First, we generate the layout elements as nodes in a layout graph. Second, we compute constraints between layout elements as edges in the layout graph. Third, we solve for the final layout using constrained optimization. For the first two steps, we build on recent transformer architectures. The layout optimization implements the constraints efficiently. We show three practical contributions compared to the state of the art: our work requires no user input, produces higher quality layouts, and enables m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.13417","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.13417/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:54:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QJtkNaO/KFs36YUgGPC85CtNOYMv94W/KpnmjTtMXCFLdkgaWI2E4wPAkSf+AgmhJZeT0Y5nZlXpyNuEGXalAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T11:52:48.567282Z"},"content_sha256":"f8a72de295cd1560d1d6b31001d1142a5cc35245e03046cef4eecec22d88ff33","schema_version":"1.0","event_id":"sha256:f8a72de295cd1560d1d6b31001d1142a5cc35245e03046cef4eecec22d88ff33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RZHCR32KNMCTUS2GOY743KR3KQ/bundle.json","state_url":"https://pith.science/pith/RZHCR32KNMCTUS2GOY743KR3KQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RZHCR32KNMCTUS2GOY743KR3KQ/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-08-05T11:52:48Z","links":{"resolver":"https://pith.science/pith/RZHCR32KNMCTUS2GOY743KR3KQ","bundle":"https://pith.science/pith/RZHCR32KNMCTUS2GOY743KR3KQ/bundle.json","state":"https://pith.science/pith/RZHCR32KNMCTUS2GOY743KR3KQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RZHCR32KNMCTUS2GOY743KR3KQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:RZHCR32KNMCTUS2GOY743KR3KQ","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":"01ecf5b21548eb94ab50c3ecf2ba0359f75560126b2df33676462853640798db","cross_cats_sorted":["cs.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-11-26T18:18:37Z","title_canon_sha256":"5307cefb51ac7cd5b3e4d77e11a2c5a55300fa36ef62645187710ab7e51a9975"},"schema_version":"1.0","source":{"id":"2011.13417","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.13417","created_at":"2026-07-05T01:54:53Z"},{"alias_kind":"arxiv_version","alias_value":"2011.13417v1","created_at":"2026-07-05T01:54:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.13417","created_at":"2026-07-05T01:54:53Z"},{"alias_kind":"pith_short_12","alias_value":"RZHCR32KNMCT","created_at":"2026-07-05T01:54:53Z"},{"alias_kind":"pith_short_16","alias_value":"RZHCR32KNMCTUS2G","created_at":"2026-07-05T01:54:53Z"},{"alias_kind":"pith_short_8","alias_value":"RZHCR32K","created_at":"2026-07-05T01:54:53Z"}],"graph_snapshots":[{"event_id":"sha256:f8a72de295cd1560d1d6b31001d1142a5cc35245e03046cef4eecec22d88ff33","target":"graph","created_at":"2026-07-05T01:54:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.13417/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a new generative model for layout generation. We generate layouts in three steps. First, we generate the layout elements as nodes in a layout graph. Second, we compute constraints between layout elements as edges in the layout graph. Third, we solve for the final layout using constrained optimization. For the first two steps, we build on recent transformer architectures. The layout optimization implements the constraints efficiently. We show three practical contributions compared to the state of the art: our work requires no user input, produces higher quality layouts, and enables m","authors_text":"Leonidas Guibas, Paul Guerrero, Peter Wonka, Tom Kelly, Wamiq Para","cross_cats":["cs.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-11-26T18:18:37Z","title":"Generative Layout Modeling using Constraint Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.13417","kind":"arxiv","version":1},"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:ce588eef6180959bb67eb1b2f79ec40b0804f56bfbd65a11cd722dc805ea8201","target":"record","created_at":"2026-07-05T01:54:53Z","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":"01ecf5b21548eb94ab50c3ecf2ba0359f75560126b2df33676462853640798db","cross_cats_sorted":["cs.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-11-26T18:18:37Z","title_canon_sha256":"5307cefb51ac7cd5b3e4d77e11a2c5a55300fa36ef62645187710ab7e51a9975"},"schema_version":"1.0","source":{"id":"2011.13417","kind":"arxiv","version":1}},"canonical_sha256":"8e4e28ef4a6b053a4b46763fcdaa3b541725023e3a97a181958f3b788e9bcd85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e4e28ef4a6b053a4b46763fcdaa3b541725023e3a97a181958f3b788e9bcd85","first_computed_at":"2026-07-05T01:54:53.963233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:54:53.963233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fnZ54mIheYH8JkJfEL8pH1nJFUgcRBJ/EDQuTUCY5Vdt2IVv6ElX4qlV2xbGP7zvNSdkAK7u35BkusSTubzxBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:54:53.963653Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.13417","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce588eef6180959bb67eb1b2f79ec40b0804f56bfbd65a11cd722dc805ea8201","sha256:f8a72de295cd1560d1d6b31001d1142a5cc35245e03046cef4eecec22d88ff33"],"state_sha256":"bedcdbd47b38cf96078c043b914cdc8faac102d754863bbaa2ab445d109e9207"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"al+1XveOhgrRhVvFA6ZVla6/Yfmx9PXMS79bRoXOpZ/IcYaWp8HFi5H0H8r57/+0iQ/dzQq8cQbBAoNFCYXcDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T11:52:48.571541Z","bundle_sha256":"3a927eeacbcabfb19a3137f200b1145188363c0a5172f419fb772d03c1b5a379"}}