{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BDX7NKXDGVI2KLF6IZ7B5LXRE5","short_pith_number":"pith:BDX7NKXD","schema_version":"1.0","canonical_sha256":"08eff6aae33551a52cbe467e1eaef1275aa3447e0d5d58718fff9f607696e430","source":{"kind":"arxiv","id":"1707.02953","version":1},"attestation_state":"computed","paper":{"title":"On String Contact Representations in 3D","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Debajyoti Mondal","submitted_at":"2017-07-10T17:15:42Z","abstract_excerpt":"An axis-aligned string is a simple polygonal path, where each line segment is parallel to an axis in $\\mathbb{R}^3$. Given a graph $G$, a string contact representation $\\Psi$ of $G$ maps the vertices of $G$ to interior disjoint axis-aligned strings, where no three strings meet at a point, and two strings share a common point if and only if their corresponding vertices are adjacent in $G$. The complexity of $\\Psi$ is the minimum integer $r$ such that every string in $\\Psi$ is a $B_r$-string, i.e., a string with at most $r$ bends. While a result of Duncan et al. implies that every graph $G$ with"},"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":"1707.02953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-07-10T17:15:42Z","cross_cats_sorted":[],"title_canon_sha256":"187494b4a98142d9893cc9160a96b67185d4fc849114102c7a6cda48d437555f","abstract_canon_sha256":"79c4f76995be097f65d0663beaee14b4f7848337448af87cc9eb99c56a83607e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:35.358339Z","signature_b64":"aFjcO9prDESlnFob2mf3Ujwtxy5OPB9kjeCht5hQUPb7Z8nj1c35ijbYoJwP+TWNQ9eYBvGWduOC15t5ti5CBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08eff6aae33551a52cbe467e1eaef1275aa3447e0d5d58718fff9f607696e430","last_reissued_at":"2026-05-18T00:40:35.357662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:35.357662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On String Contact Representations in 3D","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Debajyoti Mondal","submitted_at":"2017-07-10T17:15:42Z","abstract_excerpt":"An axis-aligned string is a simple polygonal path, where each line segment is parallel to an axis in $\\mathbb{R}^3$. Given a graph $G$, a string contact representation $\\Psi$ of $G$ maps the vertices of $G$ to interior disjoint axis-aligned strings, where no three strings meet at a point, and two strings share a common point if and only if their corresponding vertices are adjacent in $G$. The complexity of $\\Psi$ is the minimum integer $r$ such that every string in $\\Psi$ is a $B_r$-string, i.e., a string with at most $r$ bends. While a result of Duncan et al. implies that every graph $G$ with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02953","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":""},"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":"1707.02953","created_at":"2026-05-18T00:40:35.357765+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.02953v1","created_at":"2026-05-18T00:40:35.357765+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02953","created_at":"2026-05-18T00:40:35.357765+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDX7NKXDGVI2","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDX7NKXDGVI2KLF6","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDX7NKXD","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BDX7NKXDGVI2KLF6IZ7B5LXRE5","json":"https://pith.science/pith/BDX7NKXDGVI2KLF6IZ7B5LXRE5.json","graph_json":"https://pith.science/api/pith-number/BDX7NKXDGVI2KLF6IZ7B5LXRE5/graph.json","events_json":"https://pith.science/api/pith-number/BDX7NKXDGVI2KLF6IZ7B5LXRE5/events.json","paper":"https://pith.science/paper/BDX7NKXD"},"agent_actions":{"view_html":"https://pith.science/pith/BDX7NKXDGVI2KLF6IZ7B5LXRE5","download_json":"https://pith.science/pith/BDX7NKXDGVI2KLF6IZ7B5LXRE5.json","view_paper":"https://pith.science/paper/BDX7NKXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.02953&json=true","fetch_graph":"https://pith.science/api/pith-number/BDX7NKXDGVI2KLF6IZ7B5LXRE5/graph.json","fetch_events":"https://pith.science/api/pith-number/BDX7NKXDGVI2KLF6IZ7B5LXRE5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDX7NKXDGVI2KLF6IZ7B5LXRE5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDX7NKXDGVI2KLF6IZ7B5LXRE5/action/storage_attestation","attest_author":"https://pith.science/pith/BDX7NKXDGVI2KLF6IZ7B5LXRE5/action/author_attestation","sign_citation":"https://pith.science/pith/BDX7NKXDGVI2KLF6IZ7B5LXRE5/action/citation_signature","submit_replication":"https://pith.science/pith/BDX7NKXDGVI2KLF6IZ7B5LXRE5/action/replication_record"}},"created_at":"2026-05-18T00:40:35.357765+00:00","updated_at":"2026-05-18T00:40:35.357765+00:00"}