{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VQEZH3ZB3KLLZKN3FGHYFFUM2Y","short_pith_number":"pith:VQEZH3ZB","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"},"canonical_sha256":"ac0993ef21da96bca9bb298f82968cd638ad9ca22e396e87f320f0c44634ea45","source":{"kind":"arxiv","id":"1409.6796","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6796","created_at":"2026-05-18T02:42:00Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6796v1","created_at":"2026-05-18T02:42:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6796","created_at":"2026-05-18T02:42:00Z"},{"alias_kind":"pith_short_12","alias_value":"VQEZH3ZB3KLL","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VQEZH3ZB3KLLZKN3","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VQEZH3ZB","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VQEZH3ZB3KLLZKN3FGHYFFUM2Y","target":"record","payload":{"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"},"canonical_sha256":"ac0993ef21da96bca9bb298f82968cd638ad9ca22e396e87f320f0c44634ea45","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"},"source_kind":"arxiv","source_id":"1409.6796","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-18T02:42:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FlScf+Zm28dsIAnjVv8bUtzuvhjSz/EphWmAYnMhjlmGUJVqJz2MovtwINkGEyWDWerJIxsVTyAVpTBicLqjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:13:21.254147Z"},"content_sha256":"6b8dd1abd0547b32071e42ee1e93f323ee017a65bf85367449eca297f6271096","schema_version":"1.0","event_id":"sha256:6b8dd1abd0547b32071e42ee1e93f323ee017a65bf85367449eca297f6271096"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VQEZH3ZB3KLLZKN3FGHYFFUM2Y","target":"graph","payload":{"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"},"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-18T02:42:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ddF6v0R2fH0Ldodes08zDukNNmolG2hXEk4qKEvlV/YlrEK/UirB2yW5tnq8Y2SkcEpfxUxk36/aN2lvNKyzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:13:21.254722Z"},"content_sha256":"b1f1f0319e25fb7d1ec72038f314d63c5bfc1b2bfb3d13a97080fa5d68e4330b","schema_version":"1.0","event_id":"sha256:b1f1f0319e25fb7d1ec72038f314d63c5bfc1b2bfb3d13a97080fa5d68e4330b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQEZH3ZB3KLLZKN3FGHYFFUM2Y/bundle.json","state_url":"https://pith.science/pith/VQEZH3ZB3KLLZKN3FGHYFFUM2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQEZH3ZB3KLLZKN3FGHYFFUM2Y/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-05-28T15:13:21Z","links":{"resolver":"https://pith.science/pith/VQEZH3ZB3KLLZKN3FGHYFFUM2Y","bundle":"https://pith.science/pith/VQEZH3ZB3KLLZKN3FGHYFFUM2Y/bundle.json","state":"https://pith.science/pith/VQEZH3ZB3KLLZKN3FGHYFFUM2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQEZH3ZB3KLLZKN3FGHYFFUM2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VQEZH3ZB3KLLZKN3FGHYFFUM2Y","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":"780102a5521d04e00e674977e098770b226274d5793a790633921b3de7bc086d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2014-09-24T02:17:00Z","title_canon_sha256":"4f36b7e1161ec4781badd8ca2a74565612b03eeafb2b7bf5745e0176c852a1f9"},"schema_version":"1.0","source":{"id":"1409.6796","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6796","created_at":"2026-05-18T02:42:00Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6796v1","created_at":"2026-05-18T02:42:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6796","created_at":"2026-05-18T02:42:00Z"},{"alias_kind":"pith_short_12","alias_value":"VQEZH3ZB3KLL","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VQEZH3ZB3KLLZKN3","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VQEZH3ZB","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:b1f1f0319e25fb7d1ec72038f314d63c5bfc1b2bfb3d13a97080fa5d68e4330b","target":"graph","created_at":"2026-05-18T02:42:00Z","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 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","authors_text":"Jung Hoon Lee, Youngsik Huh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2014-09-24T02:17:00Z","title":"Linearly embedded graphs in 3-space with homotopically free exteriors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6796","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:6b8dd1abd0547b32071e42ee1e93f323ee017a65bf85367449eca297f6271096","target":"record","created_at":"2026-05-18T02:42:00Z","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":"780102a5521d04e00e674977e098770b226274d5793a790633921b3de7bc086d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2014-09-24T02:17:00Z","title_canon_sha256":"4f36b7e1161ec4781badd8ca2a74565612b03eeafb2b7bf5745e0176c852a1f9"},"schema_version":"1.0","source":{"id":"1409.6796","kind":"arxiv","version":1}},"canonical_sha256":"ac0993ef21da96bca9bb298f82968cd638ad9ca22e396e87f320f0c44634ea45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac0993ef21da96bca9bb298f82968cd638ad9ca22e396e87f320f0c44634ea45","first_computed_at":"2026-05-18T02:42:00.403395Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:00.403395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t9JrePI9YulxJWKZUDYwY1pEhoL7DZT0h9IqFF1B5p8QBLEQ1PM6TpLsaNveYvln7ETQSE+/rVE5s/GyTfMTAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:00.403771Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.6796","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b8dd1abd0547b32071e42ee1e93f323ee017a65bf85367449eca297f6271096","sha256:b1f1f0319e25fb7d1ec72038f314d63c5bfc1b2bfb3d13a97080fa5d68e4330b"],"state_sha256":"a2767f095a8477b3a785da95c9d554c30ab0ebdda62d2a570f81a2a0f792823d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u1Ch7Vpti36gZv52H3LrPRTvhMUHNmTPC63IwkxYK6ov7uzHvsa4xmRuCrT1B4R7lJc30iD5HC4GkifLjLWyBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:13:21.257852Z","bundle_sha256":"d95f59e9a5c26e9c648d1980f26df3aa305a54e531944397d319979ec3aa1a47"}}