{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GAUCO2MB32BDMMNEQ6X5TEXP3A","short_pith_number":"pith:GAUCO2MB","schema_version":"1.0","canonical_sha256":"3028276981de823631a487afd992efd826f11ed0e1809be1a56ebfc0d9fab759","source":{"kind":"arxiv","id":"1503.01891","version":3},"attestation_state":"computed","paper":{"title":"Graphs of Systoles on hyperbolic surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Bidyut Sanki, Siddhartha Gadgil","submitted_at":"2015-03-06T09:43:55Z","abstract_excerpt":"Given a hyperbolic surface, the set of all closed geodesics whose length is minimal form a graph on the surface, in fact a so-called fat graph, which we call the systolic graph. We study which fat graphs are systolic graphs for some surface (we call these admissible).\n  There is a natural necessary condition on such graphs, which we call combinatorial admissibility. Our first main result is that this condition is also sufficient.\n  It follows that a sub-graph of an admissible graph is admissible. Our second major result is that there are infinitely many minimal non-admissible fat graphs (in co"},"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":"1503.01891","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2015-03-06T09:43:55Z","cross_cats_sorted":[],"title_canon_sha256":"71d1a67d94a184754a51e12b43064d7a41dbc8317dcb66bb12cb144ef7a7dc83","abstract_canon_sha256":"5004dadfe231e3f0d7abdfd95d5a2557382ae42e752bc205401093f1624575de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:08.498981Z","signature_b64":"JUi9WHKSmUd+7ceXT83SLFuTdVmFCphsW3aqVK9AuxGNM+55C3gZHkRquqdydBv8PaAhe9JnBRfam1Uuu2L+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3028276981de823631a487afd992efd826f11ed0e1809be1a56ebfc0d9fab759","last_reissued_at":"2026-05-18T00:46:08.498547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:08.498547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs of Systoles on hyperbolic surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Bidyut Sanki, Siddhartha Gadgil","submitted_at":"2015-03-06T09:43:55Z","abstract_excerpt":"Given a hyperbolic surface, the set of all closed geodesics whose length is minimal form a graph on the surface, in fact a so-called fat graph, which we call the systolic graph. We study which fat graphs are systolic graphs for some surface (we call these admissible).\n  There is a natural necessary condition on such graphs, which we call combinatorial admissibility. Our first main result is that this condition is also sufficient.\n  It follows that a sub-graph of an admissible graph is admissible. Our second major result is that there are infinitely many minimal non-admissible fat graphs (in co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01891","kind":"arxiv","version":3},"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":"1503.01891","created_at":"2026-05-18T00:46:08.498622+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01891v3","created_at":"2026-05-18T00:46:08.498622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01891","created_at":"2026-05-18T00:46:08.498622+00:00"},{"alias_kind":"pith_short_12","alias_value":"GAUCO2MB32BD","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GAUCO2MB32BDMMNE","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GAUCO2MB","created_at":"2026-05-18T12:29:22.688609+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/GAUCO2MB32BDMMNEQ6X5TEXP3A","json":"https://pith.science/pith/GAUCO2MB32BDMMNEQ6X5TEXP3A.json","graph_json":"https://pith.science/api/pith-number/GAUCO2MB32BDMMNEQ6X5TEXP3A/graph.json","events_json":"https://pith.science/api/pith-number/GAUCO2MB32BDMMNEQ6X5TEXP3A/events.json","paper":"https://pith.science/paper/GAUCO2MB"},"agent_actions":{"view_html":"https://pith.science/pith/GAUCO2MB32BDMMNEQ6X5TEXP3A","download_json":"https://pith.science/pith/GAUCO2MB32BDMMNEQ6X5TEXP3A.json","view_paper":"https://pith.science/paper/GAUCO2MB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01891&json=true","fetch_graph":"https://pith.science/api/pith-number/GAUCO2MB32BDMMNEQ6X5TEXP3A/graph.json","fetch_events":"https://pith.science/api/pith-number/GAUCO2MB32BDMMNEQ6X5TEXP3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GAUCO2MB32BDMMNEQ6X5TEXP3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GAUCO2MB32BDMMNEQ6X5TEXP3A/action/storage_attestation","attest_author":"https://pith.science/pith/GAUCO2MB32BDMMNEQ6X5TEXP3A/action/author_attestation","sign_citation":"https://pith.science/pith/GAUCO2MB32BDMMNEQ6X5TEXP3A/action/citation_signature","submit_replication":"https://pith.science/pith/GAUCO2MB32BDMMNEQ6X5TEXP3A/action/replication_record"}},"created_at":"2026-05-18T00:46:08.498622+00:00","updated_at":"2026-05-18T00:46:08.498622+00:00"}