{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:CGZHKUZDL5W2ITUBYROOLN7MLC","short_pith_number":"pith:CGZHKUZD","schema_version":"1.0","canonical_sha256":"11b27553235f6da44e81c45ce5b7ec589c4627678a30829264fea5258411c59f","source":{"kind":"arxiv","id":"0804.4790","version":1},"attestation_state":"computed","paper":{"title":"Hyperbolic graphs of small complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Bruno Martelli, Carlo Petronio, Craig Hodgson, Damian Heard","submitted_at":"2008-04-30T11:09:22Z","abstract_excerpt":"In this paper we enumerate and classify the ``simplest'' pairs (M,G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M.\n  To enumerate the pairs we use a variation of Matveev's definition of complexity for 3-manifolds, and we consider only (0,1,2)-irreducible pairs, namely pairs (M,G) such that any 2-sphere in M intersecting G transversely in at most 2 points bounds a ball in M either disjoint from G or intersecting G in an unknotted arc. To classify the pairs our main tools are geometric invariants defined using hyperbolic geometry. In most cases, the graph 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":"0804.4790","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2008-04-30T11:09:22Z","cross_cats_sorted":[],"title_canon_sha256":"12759a6d7d75fafb4143bf24fc3052c54429f29882f3dc5d3baec07ee85f4887","abstract_canon_sha256":"80ff220e8f1a8eb8a3cb9d300d819ed206703b3f397f8e583da6f9bd12d75de0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:11:15.785656Z","signature_b64":"AHrgHwffdOGKYYctvdhsqc7VjitfituFC/0JYQVfdqmlwOa6M48h5N8MUmSdtXUYyzXiUIIUUi1XFIJZnrmXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11b27553235f6da44e81c45ce5b7ec589c4627678a30829264fea5258411c59f","last_reissued_at":"2026-07-04T15:11:15.785287Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:11:15.785287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hyperbolic graphs of small complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Bruno Martelli, Carlo Petronio, Craig Hodgson, Damian Heard","submitted_at":"2008-04-30T11:09:22Z","abstract_excerpt":"In this paper we enumerate and classify the ``simplest'' pairs (M,G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M.\n  To enumerate the pairs we use a variation of Matveev's definition of complexity for 3-manifolds, and we consider only (0,1,2)-irreducible pairs, namely pairs (M,G) such that any 2-sphere in M intersecting G transversely in at most 2 points bounds a ball in M either disjoint from G or intersecting G in an unknotted arc. To classify the pairs our main tools are geometric invariants defined using hyperbolic geometry. In most cases, the graph co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.4790","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0804.4790/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"0804.4790","created_at":"2026-07-04T15:11:15.785360+00:00"},{"alias_kind":"arxiv_version","alias_value":"0804.4790v1","created_at":"2026-07-04T15:11:15.785360+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.4790","created_at":"2026-07-04T15:11:15.785360+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGZHKUZDL5W2","created_at":"2026-07-04T15:11:15.785360+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGZHKUZDL5W2ITUB","created_at":"2026-07-04T15:11:15.785360+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGZHKUZD","created_at":"2026-07-04T15:11:15.785360+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.12696","citing_title":"Triangulating quantum gravity in AdS$_3$","ref_index":87,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CGZHKUZDL5W2ITUBYROOLN7MLC","json":"https://pith.science/pith/CGZHKUZDL5W2ITUBYROOLN7MLC.json","graph_json":"https://pith.science/api/pith-number/CGZHKUZDL5W2ITUBYROOLN7MLC/graph.json","events_json":"https://pith.science/api/pith-number/CGZHKUZDL5W2ITUBYROOLN7MLC/events.json","paper":"https://pith.science/paper/CGZHKUZD"},"agent_actions":{"view_html":"https://pith.science/pith/CGZHKUZDL5W2ITUBYROOLN7MLC","download_json":"https://pith.science/pith/CGZHKUZDL5W2ITUBYROOLN7MLC.json","view_paper":"https://pith.science/paper/CGZHKUZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0804.4790&json=true","fetch_graph":"https://pith.science/api/pith-number/CGZHKUZDL5W2ITUBYROOLN7MLC/graph.json","fetch_events":"https://pith.science/api/pith-number/CGZHKUZDL5W2ITUBYROOLN7MLC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGZHKUZDL5W2ITUBYROOLN7MLC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGZHKUZDL5W2ITUBYROOLN7MLC/action/storage_attestation","attest_author":"https://pith.science/pith/CGZHKUZDL5W2ITUBYROOLN7MLC/action/author_attestation","sign_citation":"https://pith.science/pith/CGZHKUZDL5W2ITUBYROOLN7MLC/action/citation_signature","submit_replication":"https://pith.science/pith/CGZHKUZDL5W2ITUBYROOLN7MLC/action/replication_record"}},"created_at":"2026-07-04T15:11:15.785360+00:00","updated_at":"2026-07-04T15:11:15.785360+00:00"}