{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5U6LCASQOJDK27JLGDQC2K7UD4","short_pith_number":"pith:5U6LCASQ","schema_version":"1.0","canonical_sha256":"ed3cb102507246ad7d2b30e02d2bf41f3e4a74e486b78b9303c49f803769a887","source":{"kind":"arxiv","id":"1304.4307","version":2},"attestation_state":"computed","paper":{"title":"Hyperbolicity of the graph of non-separating multicurves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Ursula Hamenstaedt","submitted_at":"2013-04-16T01:59:20Z","abstract_excerpt":"A non-separating multicurve of a surface S of genus g with m punctures is a multicurve c so that S-c is connected. For k>0 define the graph of non-separting k-multicurves to be the graph whose vertices are non-separating multicurves with k components and where two such multicurves are connected by an edge if they can be realized disjointly. We show that if k is smaller than g/2+1 then this graph is hyperbolic."},"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":"1304.4307","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-04-16T01:59:20Z","cross_cats_sorted":[],"title_canon_sha256":"11ba5305c6ab6675b25b649de75e62770e5246b0e223f946421c0e4fb2189e04","abstract_canon_sha256":"5f904a346815182a00dba04d7b0cfc2bdcf4d161edf81709674d90c8449482fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:57.575441Z","signature_b64":"/blulj+WOaV+NW8+Y3muxmLp+K8JgJgcsdvLWBhrrKZZMXD5WRkEv6MEoyE/zDoVLiGP3t07Hw6zpejJM1KiBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed3cb102507246ad7d2b30e02d2bf41f3e4a74e486b78b9303c49f803769a887","last_reissued_at":"2026-05-18T03:11:57.574761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:57.574761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hyperbolicity of the graph of non-separating multicurves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Ursula Hamenstaedt","submitted_at":"2013-04-16T01:59:20Z","abstract_excerpt":"A non-separating multicurve of a surface S of genus g with m punctures is a multicurve c so that S-c is connected. For k>0 define the graph of non-separting k-multicurves to be the graph whose vertices are non-separating multicurves with k components and where two such multicurves are connected by an edge if they can be realized disjointly. We show that if k is smaller than g/2+1 then this graph is hyperbolic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4307","kind":"arxiv","version":2},"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":"1304.4307","created_at":"2026-05-18T03:11:57.574859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.4307v2","created_at":"2026-05-18T03:11:57.574859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4307","created_at":"2026-05-18T03:11:57.574859+00:00"},{"alias_kind":"pith_short_12","alias_value":"5U6LCASQOJDK","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5U6LCASQOJDK27JL","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5U6LCASQ","created_at":"2026-05-18T12:27:34.582898+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/5U6LCASQOJDK27JLGDQC2K7UD4","json":"https://pith.science/pith/5U6LCASQOJDK27JLGDQC2K7UD4.json","graph_json":"https://pith.science/api/pith-number/5U6LCASQOJDK27JLGDQC2K7UD4/graph.json","events_json":"https://pith.science/api/pith-number/5U6LCASQOJDK27JLGDQC2K7UD4/events.json","paper":"https://pith.science/paper/5U6LCASQ"},"agent_actions":{"view_html":"https://pith.science/pith/5U6LCASQOJDK27JLGDQC2K7UD4","download_json":"https://pith.science/pith/5U6LCASQOJDK27JLGDQC2K7UD4.json","view_paper":"https://pith.science/paper/5U6LCASQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.4307&json=true","fetch_graph":"https://pith.science/api/pith-number/5U6LCASQOJDK27JLGDQC2K7UD4/graph.json","fetch_events":"https://pith.science/api/pith-number/5U6LCASQOJDK27JLGDQC2K7UD4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5U6LCASQOJDK27JLGDQC2K7UD4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5U6LCASQOJDK27JLGDQC2K7UD4/action/storage_attestation","attest_author":"https://pith.science/pith/5U6LCASQOJDK27JLGDQC2K7UD4/action/author_attestation","sign_citation":"https://pith.science/pith/5U6LCASQOJDK27JLGDQC2K7UD4/action/citation_signature","submit_replication":"https://pith.science/pith/5U6LCASQOJDK27JLGDQC2K7UD4/action/replication_record"}},"created_at":"2026-05-18T03:11:57.574859+00:00","updated_at":"2026-05-18T03:11:57.574859+00:00"}