{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:W52H5RAVUZFLC5YLNC5FWZ3LOO","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":"d4ae772a9bac57e820fd0d971be89642581e3ce565ba11631da05f5c25555543","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-11-22T02:52:11Z","title_canon_sha256":"b7503ab7406b0b3991a92f7a7ccee94045cdf42efaad42c4685658f395f88bb7"},"schema_version":"1.0","source":{"id":"1711.08116","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08116","created_at":"2026-05-18T00:29:50Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08116v1","created_at":"2026-05-18T00:29:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08116","created_at":"2026-05-18T00:29:50Z"},{"alias_kind":"pith_short_12","alias_value":"W52H5RAVUZFL","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"W52H5RAVUZFLC5YL","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"W52H5RAV","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:cd53b1f1639f6eeedef0246f8feef3f719610baf094be77f5d1154da681d54db","target":"graph","created_at":"2026-05-18T00:29:50Z","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":"Bae and Park found an upper bound on the arc index of prime links in terms of the minimal crossing number. In this paper, we extend the definition of the arc presentation to spatial graphs and find an upper bound on the arc index $\\alpha (G)$ of any spatial graph $G$ as $$\\alpha(G) \\leq c(G)+e+b,$$ where $c(G)$ is the minimal crossing number of $G$, $e$ is the number of edges, and $b$ is the number of bouquet cut-components. This upper bound is lowest possible.","authors_text":"Minjung Lee, Seungsang Oh, Sungjong No","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-11-22T02:52:11Z","title":"Arc index of spatial graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08116","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:3312e8fdb33f6b1a8e82aeae84719d48eb7db364e534ce4181b1dc3d68371d41","target":"record","created_at":"2026-05-18T00:29:50Z","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":"d4ae772a9bac57e820fd0d971be89642581e3ce565ba11631da05f5c25555543","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-11-22T02:52:11Z","title_canon_sha256":"b7503ab7406b0b3991a92f7a7ccee94045cdf42efaad42c4685658f395f88bb7"},"schema_version":"1.0","source":{"id":"1711.08116","kind":"arxiv","version":1}},"canonical_sha256":"b7747ec415a64ab1770b68ba5b676b73bb64f7391f2ae8a16121dd6230b02503","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7747ec415a64ab1770b68ba5b676b73bb64f7391f2ae8a16121dd6230b02503","first_computed_at":"2026-05-18T00:29:50.642821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:50.642821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sxM9lVaaDsdUbO6OT0M60JEsdVKMHse8XjgjtrJwgIaldlMuNDGclgRdNk7nu+95i852DUh6SKHspht9cSsZAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:50.643346Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08116","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3312e8fdb33f6b1a8e82aeae84719d48eb7db364e534ce4181b1dc3d68371d41","sha256:cd53b1f1639f6eeedef0246f8feef3f719610baf094be77f5d1154da681d54db"],"state_sha256":"88bd2f4a18eff9e1e1c45cfaf4e99f1f263548b7428cacc7e90a37eb4f9e5a91"}