{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:S4OZLJTRYWD5HOGDTMLKS6WD54","short_pith_number":"pith:S4OZLJTR","schema_version":"1.0","canonical_sha256":"971d95a671c587d3b8c39b16a97ac3ef060967efa63d6740cfa1ebc3bccff0ac","source":{"kind":"arxiv","id":"2008.01803","version":1},"attestation_state":"computed","paper":{"title":"GPLAN: Computer-Generated Dimensioned Floorplans for given Adjacencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Krishnendra Shekhawat, Nitant Upasani, Rahil Jain, Sumit Bisht","submitted_at":"2020-08-04T20:02:00Z","abstract_excerpt":"In this paper, we present GPLAN, software aimed at constructing dimensioned floorplan layouts based on graph-theoretical and optimization techniques. GPLAN takes user requirements as input in the following two forms: i. Adjacency graph: It allows user to draw an adjacency graph on a GUI(graphical user interface) corresponding to which GPLAN produces a set of dimensioned floorplans with a rectangular boundary, where each floorplan is topologically distinct from others. ii. Dimensionless layout: Here, user can draw any layout with rectangular or non-rectangular boundary on a GUI and GPLAN transf"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2008.01803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2020-08-04T20:02:00Z","cross_cats_sorted":[],"title_canon_sha256":"992a3d5a76bc07aae047d45255af5c26ccd3ac7ce4efbfa61a7366230e87f7d9","abstract_canon_sha256":"11fe0aacfd5005bb3858279baf9feb9a149dba56c254a205a41e7095b4a1faab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:24:54.921298Z","signature_b64":"GWBYZMFQuWdkM5CE2hJhbVyZ6KPuH16N/cuVTkj3vo598Rl/1OIFkx34l8lm0psYulRlR8lDyn4ivAgrt+LkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"971d95a671c587d3b8c39b16a97ac3ef060967efa63d6740cfa1ebc3bccff0ac","last_reissued_at":"2026-07-05T01:24:54.920905Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:24:54.920905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GPLAN: Computer-Generated Dimensioned Floorplans for given Adjacencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Krishnendra Shekhawat, Nitant Upasani, Rahil Jain, Sumit Bisht","submitted_at":"2020-08-04T20:02:00Z","abstract_excerpt":"In this paper, we present GPLAN, software aimed at constructing dimensioned floorplan layouts based on graph-theoretical and optimization techniques. GPLAN takes user requirements as input in the following two forms: i. Adjacency graph: It allows user to draw an adjacency graph on a GUI(graphical user interface) corresponding to which GPLAN produces a set of dimensioned floorplans with a rectangular boundary, where each floorplan is topologically distinct from others. ii. Dimensionless layout: Here, user can draw any layout with rectangular or non-rectangular boundary on a GUI and GPLAN transf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.01803","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/2008.01803/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2008.01803","created_at":"2026-07-05T01:24:54.920963+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.01803v1","created_at":"2026-07-05T01:24:54.920963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.01803","created_at":"2026-07-05T01:24:54.920963+00:00"},{"alias_kind":"pith_short_12","alias_value":"S4OZLJTRYWD5","created_at":"2026-07-05T01:24:54.920963+00:00"},{"alias_kind":"pith_short_16","alias_value":"S4OZLJTRYWD5HOGD","created_at":"2026-07-05T01:24:54.920963+00:00"},{"alias_kind":"pith_short_8","alias_value":"S4OZLJTR","created_at":"2026-07-05T01:24:54.920963+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.04407","citing_title":"Illuminating Spaces: Deep Reinforcement Learning and Laser-Wall Partitioning for Architectural Layout Generation","ref_index":2013,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S4OZLJTRYWD5HOGDTMLKS6WD54","json":"https://pith.science/pith/S4OZLJTRYWD5HOGDTMLKS6WD54.json","graph_json":"https://pith.science/api/pith-number/S4OZLJTRYWD5HOGDTMLKS6WD54/graph.json","events_json":"https://pith.science/api/pith-number/S4OZLJTRYWD5HOGDTMLKS6WD54/events.json","paper":"https://pith.science/paper/S4OZLJTR"},"agent_actions":{"view_html":"https://pith.science/pith/S4OZLJTRYWD5HOGDTMLKS6WD54","download_json":"https://pith.science/pith/S4OZLJTRYWD5HOGDTMLKS6WD54.json","view_paper":"https://pith.science/paper/S4OZLJTR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.01803&json=true","fetch_graph":"https://pith.science/api/pith-number/S4OZLJTRYWD5HOGDTMLKS6WD54/graph.json","fetch_events":"https://pith.science/api/pith-number/S4OZLJTRYWD5HOGDTMLKS6WD54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S4OZLJTRYWD5HOGDTMLKS6WD54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S4OZLJTRYWD5HOGDTMLKS6WD54/action/storage_attestation","attest_author":"https://pith.science/pith/S4OZLJTRYWD5HOGDTMLKS6WD54/action/author_attestation","sign_citation":"https://pith.science/pith/S4OZLJTRYWD5HOGDTMLKS6WD54/action/citation_signature","submit_replication":"https://pith.science/pith/S4OZLJTRYWD5HOGDTMLKS6WD54/action/replication_record"}},"created_at":"2026-07-05T01:24:54.920963+00:00","updated_at":"2026-07-05T01:24:54.920963+00:00"}