{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BDX7NKXDGVI2KLF6IZ7B5LXRE5","short_pith_number":"pith:BDX7NKXD","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"},"canonical_sha256":"08eff6aae33551a52cbe467e1eaef1275aa3447e0d5d58718fff9f607696e430","source":{"kind":"arxiv","id":"1707.02953","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02953","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02953v1","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02953","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"pith_short_12","alias_value":"BDX7NKXDGVI2","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BDX7NKXDGVI2KLF6","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BDX7NKXD","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BDX7NKXDGVI2KLF6IZ7B5LXRE5","target":"record","payload":{"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"},"canonical_sha256":"08eff6aae33551a52cbe467e1eaef1275aa3447e0d5d58718fff9f607696e430","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"},"source_kind":"arxiv","source_id":"1707.02953","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-05-18T00:40:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xU4N/7bv2sXe9HiyKehnCiR+bWE6YFNS8NDPhKrIr8g7oGY9lk+II1A7CnZNhoMyAi3pcsGWSUr0rs90tHvJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:03:43.406145Z"},"content_sha256":"7bc632ab42745a0c967153e92a129564e82483ed113ab5f767c274cafcc12505","schema_version":"1.0","event_id":"sha256:7bc632ab42745a0c967153e92a129564e82483ed113ab5f767c274cafcc12505"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BDX7NKXDGVI2KLF6IZ7B5LXRE5","target":"graph","payload":{"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"},"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-05-18T00:40:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N9YAW8Vd6wMenRRTnUqL3cGbxvsn8WrBBSI9fUtmxvCOoltn2+6cGZEI0eJPerLT1tsiQ1M9UaqNqU78FZErCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:03:43.406505Z"},"content_sha256":"0ea5512485d89c6b02f7c2832b43ecf895dbdfd4bd4f8e0d7edf4b3beff1dc59","schema_version":"1.0","event_id":"sha256:0ea5512485d89c6b02f7c2832b43ecf895dbdfd4bd4f8e0d7edf4b3beff1dc59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BDX7NKXDGVI2KLF6IZ7B5LXRE5/bundle.json","state_url":"https://pith.science/pith/BDX7NKXDGVI2KLF6IZ7B5LXRE5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BDX7NKXDGVI2KLF6IZ7B5LXRE5/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-06-27T19:03:43Z","links":{"resolver":"https://pith.science/pith/BDX7NKXDGVI2KLF6IZ7B5LXRE5","bundle":"https://pith.science/pith/BDX7NKXDGVI2KLF6IZ7B5LXRE5/bundle.json","state":"https://pith.science/pith/BDX7NKXDGVI2KLF6IZ7B5LXRE5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BDX7NKXDGVI2KLF6IZ7B5LXRE5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BDX7NKXDGVI2KLF6IZ7B5LXRE5","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":"79c4f76995be097f65d0663beaee14b4f7848337448af87cc9eb99c56a83607e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-07-10T17:15:42Z","title_canon_sha256":"187494b4a98142d9893cc9160a96b67185d4fc849114102c7a6cda48d437555f"},"schema_version":"1.0","source":{"id":"1707.02953","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02953","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02953v1","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02953","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"pith_short_12","alias_value":"BDX7NKXDGVI2","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BDX7NKXDGVI2KLF6","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BDX7NKXD","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:0ea5512485d89c6b02f7c2832b43ecf895dbdfd4bd4f8e0d7edf4b3beff1dc59","target":"graph","created_at":"2026-05-18T00:40:35Z","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"},"paper":{"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","authors_text":"Debajyoti Mondal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-07-10T17:15:42Z","title":"On String Contact Representations in 3D"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02953","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:7bc632ab42745a0c967153e92a129564e82483ed113ab5f767c274cafcc12505","target":"record","created_at":"2026-05-18T00:40:35Z","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":"79c4f76995be097f65d0663beaee14b4f7848337448af87cc9eb99c56a83607e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-07-10T17:15:42Z","title_canon_sha256":"187494b4a98142d9893cc9160a96b67185d4fc849114102c7a6cda48d437555f"},"schema_version":"1.0","source":{"id":"1707.02953","kind":"arxiv","version":1}},"canonical_sha256":"08eff6aae33551a52cbe467e1eaef1275aa3447e0d5d58718fff9f607696e430","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08eff6aae33551a52cbe467e1eaef1275aa3447e0d5d58718fff9f607696e430","first_computed_at":"2026-05-18T00:40:35.357662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:35.357662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aFjcO9prDESlnFob2mf3Ujwtxy5OPB9kjeCht5hQUPb7Z8nj1c35ijbYoJwP+TWNQ9eYBvGWduOC15t5ti5CBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:35.358339Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02953","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bc632ab42745a0c967153e92a129564e82483ed113ab5f767c274cafcc12505","sha256:0ea5512485d89c6b02f7c2832b43ecf895dbdfd4bd4f8e0d7edf4b3beff1dc59"],"state_sha256":"5ae07df5270e241ca47d1df6c77fbbe1b8cea39d4a77076bf23518d1b859e15a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FgMzZZipFeJHKMaRbPEMbFmRutTR5vl89lLhCjiBSscUwUAl8ddZEoBit2/wzaPYdAoNp1HjrB+YHWQD6aWkAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T19:03:43.408401Z","bundle_sha256":"8e146c3a3f08a63b20a72b9e89fb5e8569ccfe663095586af20225812fdde2ed"}}