{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VQEZH3ZB3KLLZKN3FGHYFFUM2Y","short_pith_number":"pith:VQEZH3ZB","schema_version":"1.0","canonical_sha256":"ac0993ef21da96bca9bb298f82968cd638ad9ca22e396e87f320f0c44634ea45","source":{"kind":"arxiv","id":"1409.6796","version":1},"attestation_state":"computed","paper":{"title":"Linearly embedded graphs in 3-space with homotopically free exteriors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Jung Hoon Lee, Youngsik Huh","submitted_at":"2014-09-24T02:17:00Z","abstract_excerpt":"An embedding of a graph into $\\mathbb{R}^3$ is said to be linear, if any edge of the graph is sent to be a line segment. And we say that an embedding $f$ of a graph $G$ into $\\mathbb{R}^3$ is free, if $\\pi_1(\\mathbb{R}^3-f(G))$ is a free group. It was known that for any complete graph its linear embedding is always free.\n  In this paper we investigate the freeness of linear embeddings considering the number of vertices. It is shown that for any simple connected graph with at most 6 vertices, if its minimal valency is at least 3, then its linear embedding is always free. On the contrary when th"},"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":"1409.6796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2014-09-24T02:17:00Z","cross_cats_sorted":[],"title_canon_sha256":"4f36b7e1161ec4781badd8ca2a74565612b03eeafb2b7bf5745e0176c852a1f9","abstract_canon_sha256":"780102a5521d04e00e674977e098770b226274d5793a790633921b3de7bc086d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:00.403771Z","signature_b64":"t9JrePI9YulxJWKZUDYwY1pEhoL7DZT0h9IqFF1B5p8QBLEQ1PM6TpLsaNveYvln7ETQSE+/rVE5s/GyTfMTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac0993ef21da96bca9bb298f82968cd638ad9ca22e396e87f320f0c44634ea45","last_reissued_at":"2026-05-18T02:42:00.403395Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:00.403395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linearly embedded graphs in 3-space with homotopically free exteriors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Jung Hoon Lee, Youngsik Huh","submitted_at":"2014-09-24T02:17:00Z","abstract_excerpt":"An embedding of a graph into $\\mathbb{R}^3$ is said to be linear, if any edge of the graph is sent to be a line segment. And we say that an embedding $f$ of a graph $G$ into $\\mathbb{R}^3$ is free, if $\\pi_1(\\mathbb{R}^3-f(G))$ is a free group. It was known that for any complete graph its linear embedding is always free.\n  In this paper we investigate the freeness of linear embeddings considering the number of vertices. It is shown that for any simple connected graph with at most 6 vertices, if its minimal valency is at least 3, then its linear embedding is always free. On the contrary when th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6796","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":"1409.6796","created_at":"2026-05-18T02:42:00.403447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.6796v1","created_at":"2026-05-18T02:42:00.403447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6796","created_at":"2026-05-18T02:42:00.403447+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQEZH3ZB3KLL","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQEZH3ZB3KLLZKN3","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQEZH3ZB","created_at":"2026-05-18T12:28:54.890064+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/VQEZH3ZB3KLLZKN3FGHYFFUM2Y","json":"https://pith.science/pith/VQEZH3ZB3KLLZKN3FGHYFFUM2Y.json","graph_json":"https://pith.science/api/pith-number/VQEZH3ZB3KLLZKN3FGHYFFUM2Y/graph.json","events_json":"https://pith.science/api/pith-number/VQEZH3ZB3KLLZKN3FGHYFFUM2Y/events.json","paper":"https://pith.science/paper/VQEZH3ZB"},"agent_actions":{"view_html":"https://pith.science/pith/VQEZH3ZB3KLLZKN3FGHYFFUM2Y","download_json":"https://pith.science/pith/VQEZH3ZB3KLLZKN3FGHYFFUM2Y.json","view_paper":"https://pith.science/paper/VQEZH3ZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.6796&json=true","fetch_graph":"https://pith.science/api/pith-number/VQEZH3ZB3KLLZKN3FGHYFFUM2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/VQEZH3ZB3KLLZKN3FGHYFFUM2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQEZH3ZB3KLLZKN3FGHYFFUM2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQEZH3ZB3KLLZKN3FGHYFFUM2Y/action/storage_attestation","attest_author":"https://pith.science/pith/VQEZH3ZB3KLLZKN3FGHYFFUM2Y/action/author_attestation","sign_citation":"https://pith.science/pith/VQEZH3ZB3KLLZKN3FGHYFFUM2Y/action/citation_signature","submit_replication":"https://pith.science/pith/VQEZH3ZB3KLLZKN3FGHYFFUM2Y/action/replication_record"}},"created_at":"2026-05-18T02:42:00.403447+00:00","updated_at":"2026-05-18T02:42:00.403447+00:00"}