{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:K4X757CJUB7SXMOW555JJNVP5F","short_pith_number":"pith:K4X757CJ","canonical_record":{"source":{"id":"1706.02143","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-06-07T12:10:20Z","cross_cats_sorted":[],"title_canon_sha256":"32584f6973eb2d95e2fc1878de61d2aabf79e2636d29c89a8e688fb7d922a23a","abstract_canon_sha256":"5faa3af5a46316a2b7bf737de90674b270ec5f6e5a561338da84073d754df75c"},"schema_version":"1.0"},"canonical_sha256":"572ffefc49a07f2bb1d6ef7a94b6afe947352092f824fdb1a7c284ac27a8d3ec","source":{"kind":"arxiv","id":"1706.02143","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02143","created_at":"2026-05-18T00:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02143v2","created_at":"2026-05-18T00:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02143","created_at":"2026-05-18T00:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"K4X757CJUB7S","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"K4X757CJUB7SXMOW","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"K4X757CJ","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:K4X757CJUB7SXMOW555JJNVP5F","target":"record","payload":{"canonical_record":{"source":{"id":"1706.02143","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-06-07T12:10:20Z","cross_cats_sorted":[],"title_canon_sha256":"32584f6973eb2d95e2fc1878de61d2aabf79e2636d29c89a8e688fb7d922a23a","abstract_canon_sha256":"5faa3af5a46316a2b7bf737de90674b270ec5f6e5a561338da84073d754df75c"},"schema_version":"1.0"},"canonical_sha256":"572ffefc49a07f2bb1d6ef7a94b6afe947352092f824fdb1a7c284ac27a8d3ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:55.450277Z","signature_b64":"49pe1EgA9TRRODtwOytZpEehxP6Bl0HS0/icSqzhj2BZ8yEfck+tr4jpaB+Ni7Tq11go+RqkTljoB9Nd+R2BBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"572ffefc49a07f2bb1d6ef7a94b6afe947352092f824fdb1a7c284ac27a8d3ec","last_reissued_at":"2026-05-18T00:28:55.449882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:55.449882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.02143","source_version":2,"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:28:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7HlSIPpwi5w4OxyB4hqF7IbSONX1AHhI6sPQxRNwcDoTZaxZacNQNnqiBIJt8hN2Zrb2kI+MzJizqXo0uMHeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:17:14.658872Z"},"content_sha256":"23eabbca1379fb156094706dce32a03dfa909187f1273ac72568ae3c402e9f4d","schema_version":"1.0","event_id":"sha256:23eabbca1379fb156094706dce32a03dfa909187f1273ac72568ae3c402e9f4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:K4X757CJUB7SXMOW555JJNVP5F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal 4-colored graphs representing an infinite family of hyperbolic 3-manifolds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"E. Fominykh, M. Mulazzani, P. Cristofori, V. Tarkaev","submitted_at":"2017-06-07T12:10:20Z","abstract_excerpt":"The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored graphs representing it. Exact calculations of graph complexity have been already performed, through tabulations, for closed orientable manifolds (up to graph complexity 32) and for compact orientable 3-manifolds with toric boundary (up to graph complexity 12) and for infinite families of lens spaces. In this paper we extend to graph complexity 14 the computations for orientable manifolds with toric boundary and we give two-sided bounds for the graph complexity of tetrahedral manifolds. As a consequ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02143","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"},"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:28:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"APQ8ckqRZmT6z3bVwgDuO5tTPjinznf1ZIcp34Vz/bFJiwAHaeFKCt32rGGrKeOLWT+Evhz4dCHy7/CrNOdKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:17:14.659540Z"},"content_sha256":"962ea68b3b62ba4b627a0d51dc4c6e8bbfef749afb971c33af3802645ab93ebc","schema_version":"1.0","event_id":"sha256:962ea68b3b62ba4b627a0d51dc4c6e8bbfef749afb971c33af3802645ab93ebc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K4X757CJUB7SXMOW555JJNVP5F/bundle.json","state_url":"https://pith.science/pith/K4X757CJUB7SXMOW555JJNVP5F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K4X757CJUB7SXMOW555JJNVP5F/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-07T20:17:14Z","links":{"resolver":"https://pith.science/pith/K4X757CJUB7SXMOW555JJNVP5F","bundle":"https://pith.science/pith/K4X757CJUB7SXMOW555JJNVP5F/bundle.json","state":"https://pith.science/pith/K4X757CJUB7SXMOW555JJNVP5F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K4X757CJUB7SXMOW555JJNVP5F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:K4X757CJUB7SXMOW555JJNVP5F","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":"5faa3af5a46316a2b7bf737de90674b270ec5f6e5a561338da84073d754df75c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-06-07T12:10:20Z","title_canon_sha256":"32584f6973eb2d95e2fc1878de61d2aabf79e2636d29c89a8e688fb7d922a23a"},"schema_version":"1.0","source":{"id":"1706.02143","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02143","created_at":"2026-05-18T00:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02143v2","created_at":"2026-05-18T00:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02143","created_at":"2026-05-18T00:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"K4X757CJUB7S","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"K4X757CJUB7SXMOW","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"K4X757CJ","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:962ea68b3b62ba4b627a0d51dc4c6e8bbfef749afb971c33af3802645ab93ebc","target":"graph","created_at":"2026-05-18T00:28:55Z","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":"The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored graphs representing it. Exact calculations of graph complexity have been already performed, through tabulations, for closed orientable manifolds (up to graph complexity 32) and for compact orientable 3-manifolds with toric boundary (up to graph complexity 12) and for infinite families of lens spaces. In this paper we extend to graph complexity 14 the computations for orientable manifolds with toric boundary and we give two-sided bounds for the graph complexity of tetrahedral manifolds. As a consequ","authors_text":"E. Fominykh, M. Mulazzani, P. Cristofori, V. Tarkaev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-06-07T12:10:20Z","title":"Minimal 4-colored graphs representing an infinite family of hyperbolic 3-manifolds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02143","kind":"arxiv","version":2},"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:23eabbca1379fb156094706dce32a03dfa909187f1273ac72568ae3c402e9f4d","target":"record","created_at":"2026-05-18T00:28:55Z","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":"5faa3af5a46316a2b7bf737de90674b270ec5f6e5a561338da84073d754df75c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2017-06-07T12:10:20Z","title_canon_sha256":"32584f6973eb2d95e2fc1878de61d2aabf79e2636d29c89a8e688fb7d922a23a"},"schema_version":"1.0","source":{"id":"1706.02143","kind":"arxiv","version":2}},"canonical_sha256":"572ffefc49a07f2bb1d6ef7a94b6afe947352092f824fdb1a7c284ac27a8d3ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"572ffefc49a07f2bb1d6ef7a94b6afe947352092f824fdb1a7c284ac27a8d3ec","first_computed_at":"2026-05-18T00:28:55.449882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:55.449882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"49pe1EgA9TRRODtwOytZpEehxP6Bl0HS0/icSqzhj2BZ8yEfck+tr4jpaB+Ni7Tq11go+RqkTljoB9Nd+R2BBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:55.450277Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02143","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23eabbca1379fb156094706dce32a03dfa909187f1273ac72568ae3c402e9f4d","sha256:962ea68b3b62ba4b627a0d51dc4c6e8bbfef749afb971c33af3802645ab93ebc"],"state_sha256":"0d8cedb0f07562d16ebc8740eef97f5ee4bdab5125dff0c194a116d2982e947a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4UoLgN2csjk9B1uer8apabHZa3dO/he1qE1qpAsk6Ug8LHQ2x5G904Rvbg0R+IyYlyv9oDJmELa8PF8/kvSTDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:17:14.662661Z","bundle_sha256":"97d7e5969689347ed50ba50d2c95c44b7783f2515ace8ca4fa50f7cf3156de09"}}