{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YKU6HVEJI3OVALEZD7A57MW3RI","short_pith_number":"pith:YKU6HVEJ","canonical_record":{"source":{"id":"1703.09440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-03-28T07:48:50Z","cross_cats_sorted":[],"title_canon_sha256":"4ef59df49ccb9f176ed0e79f23240b632d6daa1bfcb5e933eb38fe12f9c31910","abstract_canon_sha256":"5bc265ba6747eee807a1860ec117fc0bf303f76bae54dbcb2d996dd19fca56eb"},"schema_version":"1.0"},"canonical_sha256":"c2a9e3d48946dd502c991fc1dfb2db8a10d4d6d5621397c29d28a66bdfebd93b","source":{"kind":"arxiv","id":"1703.09440","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09440","created_at":"2026-05-18T00:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09440v1","created_at":"2026-05-18T00:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09440","created_at":"2026-05-18T00:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"YKU6HVEJI3OV","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YKU6HVEJI3OVALEZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YKU6HVEJ","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YKU6HVEJI3OVALEZD7A57MW3RI","target":"record","payload":{"canonical_record":{"source":{"id":"1703.09440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-03-28T07:48:50Z","cross_cats_sorted":[],"title_canon_sha256":"4ef59df49ccb9f176ed0e79f23240b632d6daa1bfcb5e933eb38fe12f9c31910","abstract_canon_sha256":"5bc265ba6747eee807a1860ec117fc0bf303f76bae54dbcb2d996dd19fca56eb"},"schema_version":"1.0"},"canonical_sha256":"c2a9e3d48946dd502c991fc1dfb2db8a10d4d6d5621397c29d28a66bdfebd93b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:44.540751Z","signature_b64":"ncmfHBUFdlt1xGalG5dmPl2CBfLc6SqSGoOnbiVARerOQPEh8JeUkAy+ohPgdoSFlTm2z5KOr3cpgmpiKxnLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2a9e3d48946dd502c991fc1dfb2db8a10d4d6d5621397c29d28a66bdfebd93b","last_reissued_at":"2026-05-18T00:47:44.540169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:44.540169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.09440","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:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5/UKOPCLq/+HITeRsflEbx0QxzlOm+V/JwI/llzfiYNkb0QgRdiI7v4fyUdCUpQC5MbWylZtLZ3utME/SMtLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T11:36:04.772910Z"},"content_sha256":"f73e8082bc0d38887b05e64b3ad26d5649301bb003510cb003005b9cb5b0ce38","schema_version":"1.0","event_id":"sha256:f73e8082bc0d38887b05e64b3ad26d5649301bb003510cb003005b9cb5b0ce38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YKU6HVEJI3OVALEZD7A57MW3RI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Site-specific Gordian distances of spatial graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Kouki Taniyama","submitted_at":"2017-03-28T07:48:50Z","abstract_excerpt":"A site-specific Gordian distance between two spatial embeddings of an abstract graph is the minimal number of crossing changes from one to another where each crossing change is performed between two previously specified abstract edges of the graph. It is infinite in some cases. We determine the site-specific Gordian distance between two spatial embeddings of an abstract graph in certain cases. It has an application to puzzle ring problem. The site-specific Gordian distances between Milnor links and trivial links are determined. We use covering space theory for the proofs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09440","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:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YRunlJVjGzUMbEMQ6LmpHyx+knppvU+0ww27avn8sWWaG+jX1hCsP5XI6N+RT7Wre6h+9taDriOEl0ubObC4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T11:36:04.773250Z"},"content_sha256":"4d5a1c78d6b7428c0d9d33f4e30d352da8a47f56a69f82fafb89b5e39d661818","schema_version":"1.0","event_id":"sha256:4d5a1c78d6b7428c0d9d33f4e30d352da8a47f56a69f82fafb89b5e39d661818"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YKU6HVEJI3OVALEZD7A57MW3RI/bundle.json","state_url":"https://pith.science/pith/YKU6HVEJI3OVALEZD7A57MW3RI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YKU6HVEJI3OVALEZD7A57MW3RI/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-24T11:36:04Z","links":{"resolver":"https://pith.science/pith/YKU6HVEJI3OVALEZD7A57MW3RI","bundle":"https://pith.science/pith/YKU6HVEJI3OVALEZD7A57MW3RI/bundle.json","state":"https://pith.science/pith/YKU6HVEJI3OVALEZD7A57MW3RI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YKU6HVEJI3OVALEZD7A57MW3RI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YKU6HVEJI3OVALEZD7A57MW3RI","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":"5bc265ba6747eee807a1860ec117fc0bf303f76bae54dbcb2d996dd19fca56eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-03-28T07:48:50Z","title_canon_sha256":"4ef59df49ccb9f176ed0e79f23240b632d6daa1bfcb5e933eb38fe12f9c31910"},"schema_version":"1.0","source":{"id":"1703.09440","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09440","created_at":"2026-05-18T00:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09440v1","created_at":"2026-05-18T00:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09440","created_at":"2026-05-18T00:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"YKU6HVEJI3OV","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YKU6HVEJI3OVALEZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YKU6HVEJ","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:4d5a1c78d6b7428c0d9d33f4e30d352da8a47f56a69f82fafb89b5e39d661818","target":"graph","created_at":"2026-05-18T00:47:44Z","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":"A site-specific Gordian distance between two spatial embeddings of an abstract graph is the minimal number of crossing changes from one to another where each crossing change is performed between two previously specified abstract edges of the graph. It is infinite in some cases. We determine the site-specific Gordian distance between two spatial embeddings of an abstract graph in certain cases. It has an application to puzzle ring problem. The site-specific Gordian distances between Milnor links and trivial links are determined. We use covering space theory for the proofs.","authors_text":"Kouki Taniyama","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-03-28T07:48:50Z","title":"Site-specific Gordian distances of spatial graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09440","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:f73e8082bc0d38887b05e64b3ad26d5649301bb003510cb003005b9cb5b0ce38","target":"record","created_at":"2026-05-18T00:47:44Z","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":"5bc265ba6747eee807a1860ec117fc0bf303f76bae54dbcb2d996dd19fca56eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-03-28T07:48:50Z","title_canon_sha256":"4ef59df49ccb9f176ed0e79f23240b632d6daa1bfcb5e933eb38fe12f9c31910"},"schema_version":"1.0","source":{"id":"1703.09440","kind":"arxiv","version":1}},"canonical_sha256":"c2a9e3d48946dd502c991fc1dfb2db8a10d4d6d5621397c29d28a66bdfebd93b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2a9e3d48946dd502c991fc1dfb2db8a10d4d6d5621397c29d28a66bdfebd93b","first_computed_at":"2026-05-18T00:47:44.540169Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:44.540169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ncmfHBUFdlt1xGalG5dmPl2CBfLc6SqSGoOnbiVARerOQPEh8JeUkAy+ohPgdoSFlTm2z5KOr3cpgmpiKxnLCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:44.540751Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.09440","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f73e8082bc0d38887b05e64b3ad26d5649301bb003510cb003005b9cb5b0ce38","sha256:4d5a1c78d6b7428c0d9d33f4e30d352da8a47f56a69f82fafb89b5e39d661818"],"state_sha256":"5f32a1954a332016df75d51e36e05f36037cd382c63e1f84a2ccb9c1942163f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vCVlI9dBvaMq1hMwrFHRSAnhapgedyTGmSwL3QZCIS9Lsulcp3B3nf2n9Ve4Z7+iPRwdd5mcBMZQRRzudYJ0DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T11:36:04.775266Z","bundle_sha256":"59b0c31a166782daac39aa1bbb59b85f7ff690e0215c3280fcf1dd15d4d38d96"}}