{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XR6TVOVAIZQ4WZ7AZBUZATNCU7","short_pith_number":"pith:XR6TVOVA","canonical_record":{"source":{"id":"1611.04100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-13T07:59:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9fcab0c0a1624fdfaf7b2cac5b4884ada2dc5b9943773ec8c2f4c5efbd4f1382","abstract_canon_sha256":"b44bcfc53c29ec8b03294b11809636311ee1aca1cb19aa4fa5ef6e6e31ed9d16"},"schema_version":"1.0"},"canonical_sha256":"bc7d3abaa04661cb67e0c869904da2a7edfd0b9e34ff1b2bd922c4f99fdd119e","source":{"kind":"arxiv","id":"1611.04100","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04100","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04100v1","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04100","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"XR6TVOVAIZQ4","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XR6TVOVAIZQ4WZ7A","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XR6TVOVA","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XR6TVOVAIZQ4WZ7AZBUZATNCU7","target":"record","payload":{"canonical_record":{"source":{"id":"1611.04100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-13T07:59:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9fcab0c0a1624fdfaf7b2cac5b4884ada2dc5b9943773ec8c2f4c5efbd4f1382","abstract_canon_sha256":"b44bcfc53c29ec8b03294b11809636311ee1aca1cb19aa4fa5ef6e6e31ed9d16"},"schema_version":"1.0"},"canonical_sha256":"bc7d3abaa04661cb67e0c869904da2a7edfd0b9e34ff1b2bd922c4f99fdd119e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.996909Z","signature_b64":"j/QM9QUqCkg8Dj77bI0XoWJewvbkITsQ39VSAaIqivjTQG5e+FBBfgZnLT7ElPP5prErXSMISdHjQxb8M6dNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc7d3abaa04661cb67e0c869904da2a7edfd0b9e34ff1b2bd922c4f99fdd119e","last_reissued_at":"2026-05-18T00:58:48.996360Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.996360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.04100","source_version":1,"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:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5kXddj1Uq2mA7QFnOJ6G7a+DSuUcY0Ud6uGausHWvgYXAyfWHHJaFlNhtEP7UMfpLrffnLftTgG35yh1sySBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:40:02.634014Z"},"content_sha256":"e2385310ebe4fbc2b98a4d9a733a2c6cf4d1d2fe2f253d0cb71d4353e232ae18","schema_version":"1.0","event_id":"sha256:e2385310ebe4fbc2b98a4d9a733a2c6cf4d1d2fe2f253d0cb71d4353e232ae18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XR6TVOVAIZQ4WZ7AZBUZATNCU7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An FPTAS for Counting Proper Four-Colorings on Cubic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Chihao Zhang, Kuan Yang, Minshen Zhu, Pinyan Lu","submitted_at":"2016-11-13T07:59:00Z","abstract_excerpt":"Graph coloring is arguably the most exhaustively studied problem in the area of approximate counting. It is conjectured that there is a fully polynomial-time (randomized) approximation scheme (FPTAS/FPRAS) for counting the number of proper colorings as long as $q \\geq \\Delta + 1$, where $q$ is the number of colors and $\\Delta$ is the maximum degree of the graph. The bound of $q = \\Delta + 1$ is the uniqueness threshold for Gibbs measure on $\\Delta$-regular infinite trees. However, the conjecture remained open even for any fixed $\\Delta\\geq 3$ (The cases of $\\Delta=1, 2$ are trivial). In this p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04100","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":""},"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:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0KmAGPLVe+rs/mbBzg449v9+Ch0paaXU7foqLNbzeI4jpFt39d6cZx8wkkS03ZqaG9szE20E4tsf0KAGtw8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:40:02.634752Z"},"content_sha256":"b0a5a95fa063635cfaab0666d82089096e2e6ebc217130c15b10a49e179ed6b2","schema_version":"1.0","event_id":"sha256:b0a5a95fa063635cfaab0666d82089096e2e6ebc217130c15b10a49e179ed6b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XR6TVOVAIZQ4WZ7AZBUZATNCU7/bundle.json","state_url":"https://pith.science/pith/XR6TVOVAIZQ4WZ7AZBUZATNCU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XR6TVOVAIZQ4WZ7AZBUZATNCU7/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-05-29T18:40:02Z","links":{"resolver":"https://pith.science/pith/XR6TVOVAIZQ4WZ7AZBUZATNCU7","bundle":"https://pith.science/pith/XR6TVOVAIZQ4WZ7AZBUZATNCU7/bundle.json","state":"https://pith.science/pith/XR6TVOVAIZQ4WZ7AZBUZATNCU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XR6TVOVAIZQ4WZ7AZBUZATNCU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XR6TVOVAIZQ4WZ7AZBUZATNCU7","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":"b44bcfc53c29ec8b03294b11809636311ee1aca1cb19aa4fa5ef6e6e31ed9d16","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-13T07:59:00Z","title_canon_sha256":"9fcab0c0a1624fdfaf7b2cac5b4884ada2dc5b9943773ec8c2f4c5efbd4f1382"},"schema_version":"1.0","source":{"id":"1611.04100","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04100","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04100v1","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04100","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"XR6TVOVAIZQ4","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XR6TVOVAIZQ4WZ7A","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XR6TVOVA","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:b0a5a95fa063635cfaab0666d82089096e2e6ebc217130c15b10a49e179ed6b2","target":"graph","created_at":"2026-05-18T00:58:48Z","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":"Graph coloring is arguably the most exhaustively studied problem in the area of approximate counting. It is conjectured that there is a fully polynomial-time (randomized) approximation scheme (FPTAS/FPRAS) for counting the number of proper colorings as long as $q \\geq \\Delta + 1$, where $q$ is the number of colors and $\\Delta$ is the maximum degree of the graph. The bound of $q = \\Delta + 1$ is the uniqueness threshold for Gibbs measure on $\\Delta$-regular infinite trees. However, the conjecture remained open even for any fixed $\\Delta\\geq 3$ (The cases of $\\Delta=1, 2$ are trivial). In this p","authors_text":"Chihao Zhang, Kuan Yang, Minshen Zhu, Pinyan Lu","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-13T07:59:00Z","title":"An FPTAS for Counting Proper Four-Colorings on Cubic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04100","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:e2385310ebe4fbc2b98a4d9a733a2c6cf4d1d2fe2f253d0cb71d4353e232ae18","target":"record","created_at":"2026-05-18T00:58:48Z","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":"b44bcfc53c29ec8b03294b11809636311ee1aca1cb19aa4fa5ef6e6e31ed9d16","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-13T07:59:00Z","title_canon_sha256":"9fcab0c0a1624fdfaf7b2cac5b4884ada2dc5b9943773ec8c2f4c5efbd4f1382"},"schema_version":"1.0","source":{"id":"1611.04100","kind":"arxiv","version":1}},"canonical_sha256":"bc7d3abaa04661cb67e0c869904da2a7edfd0b9e34ff1b2bd922c4f99fdd119e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc7d3abaa04661cb67e0c869904da2a7edfd0b9e34ff1b2bd922c4f99fdd119e","first_computed_at":"2026-05-18T00:58:48.996360Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:48.996360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j/QM9QUqCkg8Dj77bI0XoWJewvbkITsQ39VSAaIqivjTQG5e+FBBfgZnLT7ElPP5prErXSMISdHjQxb8M6dNDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:48.996909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.04100","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2385310ebe4fbc2b98a4d9a733a2c6cf4d1d2fe2f253d0cb71d4353e232ae18","sha256:b0a5a95fa063635cfaab0666d82089096e2e6ebc217130c15b10a49e179ed6b2"],"state_sha256":"a3e9d92d07897fd4c27fc67b7b4eeeb93793cbc295398c52c13c6b05aebfbe9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6LFMHXTcx6dl0RD+nqcoDwR+qbVF1sXzEb3RjstvzUk9XCoVKnn4sPCods11OILmXbRhIgf6aC2RRusXSp5NDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T18:40:02.638730Z","bundle_sha256":"8b7325cc5be337aae50e470c5d6b04ebe7b10626e6aa0c312e0b1f4c4b2ff036"}}