{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:I7OAEBQRDWYFZHC5ZUENLD5GC5","short_pith_number":"pith:I7OAEBQR","canonical_record":{"source":{"id":"1310.7964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-29T20:56:02Z","cross_cats_sorted":[],"title_canon_sha256":"753beffb44e799af4f5799c646db6470b4c8f3bde665e40ec8d0827f9b24dd66","abstract_canon_sha256":"67ac62b7b07e3276eb498990cad4f9ee1ba766f939c1ac7c9437a2a47cf983db"},"schema_version":"1.0"},"canonical_sha256":"47dc0206111db05c9c5dcd08d58fa6175870cce001116e434873c4e629ea5f8d","source":{"kind":"arxiv","id":"1310.7964","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7964","created_at":"2026-05-18T03:08:26Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7964v1","created_at":"2026-05-18T03:08:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7964","created_at":"2026-05-18T03:08:26Z"},{"alias_kind":"pith_short_12","alias_value":"I7OAEBQRDWYF","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I7OAEBQRDWYFZHC5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I7OAEBQR","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:I7OAEBQRDWYFZHC5ZUENLD5GC5","target":"record","payload":{"canonical_record":{"source":{"id":"1310.7964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-29T20:56:02Z","cross_cats_sorted":[],"title_canon_sha256":"753beffb44e799af4f5799c646db6470b4c8f3bde665e40ec8d0827f9b24dd66","abstract_canon_sha256":"67ac62b7b07e3276eb498990cad4f9ee1ba766f939c1ac7c9437a2a47cf983db"},"schema_version":"1.0"},"canonical_sha256":"47dc0206111db05c9c5dcd08d58fa6175870cce001116e434873c4e629ea5f8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:26.414808Z","signature_b64":"ir5YIoSJAkQy8BmT5Rj754lYRxKGlus38LgtWENdjwkFtAleesA03/PH6uL3ViXE7l7s4K4Wn2zXHmMHg0+mCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47dc0206111db05c9c5dcd08d58fa6175870cce001116e434873c4e629ea5f8d","last_reissued_at":"2026-05-18T03:08:26.414105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:26.414105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.7964","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-18T03:08:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E52zn9bO2Xc/gch2UgSXxyxQexLjANqGYZAoVvDhFkg+EVHYmHv02+/GvbT2colidog+H/Y1Xv1TL48iohI4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:59:30.026224Z"},"content_sha256":"7c1d0402bbf275edbbf68e6d18dca78dcf03f2e0b50128994644a506c06dcf68","schema_version":"1.0","event_id":"sha256:7c1d0402bbf275edbbf68e6d18dca78dcf03f2e0b50128994644a506c06dcf68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:I7OAEBQRDWYFZHC5ZUENLD5GC5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximability of the upper chromatic number of hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csilla Bujt\\'as, Zsolt Tuza","submitted_at":"2013-10-29T20:56:02Z","abstract_excerpt":"A C-coloring of a hypergraph ${\\cal H}=(X,{\\cal E})$ is a vertex coloring $\\varphi: X\\to {\\mathbb{N}}$ such that each edge $E\\in{\\cal E}$ has at least two vertices with a common color. The related parameter $\\overline{\\chi}({\\cal H})$, called the upper chromatic number of ${\\cal H}$, is the maximum number of colors can be used in a C-coloring of ${\\cal H}$. A hypertree is a hypergraph which has a host tree $T$ such that each edge $E\\in {\\cal E}$ induces a connected subgraph in $T$. Notations $n$ and $m$ stand for the number of vertices and edges, respectively, in a generic input hypergraph.\n  "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7964","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-18T03:08:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fz0h4NcN1tWqM/aeTgIt7C0np5uoxjoNcGVnXt8yFqiyDFOAbGqsIBiUJM9EyGIrHbq3qoJS77ozOmXfrhelCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:59:30.026883Z"},"content_sha256":"d18ce54c68be80635b3eca63705432c485e43c6f879944824b5c5e4288051dad","schema_version":"1.0","event_id":"sha256:d18ce54c68be80635b3eca63705432c485e43c6f879944824b5c5e4288051dad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7OAEBQRDWYFZHC5ZUENLD5GC5/bundle.json","state_url":"https://pith.science/pith/I7OAEBQRDWYFZHC5ZUENLD5GC5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7OAEBQRDWYFZHC5ZUENLD5GC5/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-30T15:59:30Z","links":{"resolver":"https://pith.science/pith/I7OAEBQRDWYFZHC5ZUENLD5GC5","bundle":"https://pith.science/pith/I7OAEBQRDWYFZHC5ZUENLD5GC5/bundle.json","state":"https://pith.science/pith/I7OAEBQRDWYFZHC5ZUENLD5GC5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7OAEBQRDWYFZHC5ZUENLD5GC5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:I7OAEBQRDWYFZHC5ZUENLD5GC5","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":"67ac62b7b07e3276eb498990cad4f9ee1ba766f939c1ac7c9437a2a47cf983db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-29T20:56:02Z","title_canon_sha256":"753beffb44e799af4f5799c646db6470b4c8f3bde665e40ec8d0827f9b24dd66"},"schema_version":"1.0","source":{"id":"1310.7964","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7964","created_at":"2026-05-18T03:08:26Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7964v1","created_at":"2026-05-18T03:08:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7964","created_at":"2026-05-18T03:08:26Z"},{"alias_kind":"pith_short_12","alias_value":"I7OAEBQRDWYF","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I7OAEBQRDWYFZHC5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I7OAEBQR","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:d18ce54c68be80635b3eca63705432c485e43c6f879944824b5c5e4288051dad","target":"graph","created_at":"2026-05-18T03:08:26Z","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":"A C-coloring of a hypergraph ${\\cal H}=(X,{\\cal E})$ is a vertex coloring $\\varphi: X\\to {\\mathbb{N}}$ such that each edge $E\\in{\\cal E}$ has at least two vertices with a common color. The related parameter $\\overline{\\chi}({\\cal H})$, called the upper chromatic number of ${\\cal H}$, is the maximum number of colors can be used in a C-coloring of ${\\cal H}$. A hypertree is a hypergraph which has a host tree $T$ such that each edge $E\\in {\\cal E}$ induces a connected subgraph in $T$. Notations $n$ and $m$ stand for the number of vertices and edges, respectively, in a generic input hypergraph.\n  ","authors_text":"Csilla Bujt\\'as, Zsolt Tuza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-29T20:56:02Z","title":"Approximability of the upper chromatic number of hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7964","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:7c1d0402bbf275edbbf68e6d18dca78dcf03f2e0b50128994644a506c06dcf68","target":"record","created_at":"2026-05-18T03:08:26Z","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":"67ac62b7b07e3276eb498990cad4f9ee1ba766f939c1ac7c9437a2a47cf983db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-29T20:56:02Z","title_canon_sha256":"753beffb44e799af4f5799c646db6470b4c8f3bde665e40ec8d0827f9b24dd66"},"schema_version":"1.0","source":{"id":"1310.7964","kind":"arxiv","version":1}},"canonical_sha256":"47dc0206111db05c9c5dcd08d58fa6175870cce001116e434873c4e629ea5f8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47dc0206111db05c9c5dcd08d58fa6175870cce001116e434873c4e629ea5f8d","first_computed_at":"2026-05-18T03:08:26.414105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:26.414105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ir5YIoSJAkQy8BmT5Rj754lYRxKGlus38LgtWENdjwkFtAleesA03/PH6uL3ViXE7l7s4K4Wn2zXHmMHg0+mCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:26.414808Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.7964","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c1d0402bbf275edbbf68e6d18dca78dcf03f2e0b50128994644a506c06dcf68","sha256:d18ce54c68be80635b3eca63705432c485e43c6f879944824b5c5e4288051dad"],"state_sha256":"0ca2dea4cc0dcf19c71f5c6e45839d1bcd51d4874c23f71337790513fc18fea1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sa0M63jJ9301xsl2o6EWLCVePFbKhf8JNSm6o93IHXcCUjVtN8Ad2xEQA0AVe+1/a0Ne02Twz+afvWBaN1ZLCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:59:30.029404Z","bundle_sha256":"7badd587095425fef4a7636a72155856110b6d04398dc372c183ae6df9711c9f"}}