{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3YDWY6VMOUGJPW4M5Z3Q54XL2W","short_pith_number":"pith:3YDWY6VM","canonical_record":{"source":{"id":"1807.10062","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-26T10:56:50Z","cross_cats_sorted":[],"title_canon_sha256":"c8f3e4dcf67cda75cb519ae8976baccb6c2c93f93717eae9932849f4916bda97","abstract_canon_sha256":"ceee0ac4331d5e0b6f970b3f2784e586e0d5bb5df06a613605f5bb606477b94f"},"schema_version":"1.0"},"canonical_sha256":"de076c7aac750c97db8cee770ef2ebd5bd274835f08686e6417fa284e20078c4","source":{"kind":"arxiv","id":"1807.10062","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10062","created_at":"2026-05-18T00:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10062v2","created_at":"2026-05-18T00:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10062","created_at":"2026-05-18T00:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"3YDWY6VMOUGJ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3YDWY6VMOUGJPW4M","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3YDWY6VM","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3YDWY6VMOUGJPW4M5Z3Q54XL2W","target":"record","payload":{"canonical_record":{"source":{"id":"1807.10062","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-26T10:56:50Z","cross_cats_sorted":[],"title_canon_sha256":"c8f3e4dcf67cda75cb519ae8976baccb6c2c93f93717eae9932849f4916bda97","abstract_canon_sha256":"ceee0ac4331d5e0b6f970b3f2784e586e0d5bb5df06a613605f5bb606477b94f"},"schema_version":"1.0"},"canonical_sha256":"de076c7aac750c97db8cee770ef2ebd5bd274835f08686e6417fa284e20078c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:55.796672Z","signature_b64":"FRisZhzvMoujQS25xO/kjIEsxB5uXmvvAMuBvPfg2/vtrBMPJSdYoDML0DDJrwObtotYMqJwH0OLbBWtzDAADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de076c7aac750c97db8cee770ef2ebd5bd274835f08686e6417fa284e20078c4","last_reissued_at":"2026-05-18T00:05:55.795969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:55.795969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.10062","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:05:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RHdxEQ9wEqAdDSnQFOJILv3qqFCEhJtysIZ/AO8l9UPP5w31Irf3aGxG7FBW6gvDFBWkrad73ouIa3UQbxuSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:18:43.101147Z"},"content_sha256":"99690eda71670ef9bf36bf016e95abd15d16a02262558e8c0dff22b20eac13eb","schema_version":"1.0","event_id":"sha256:99690eda71670ef9bf36bf016e95abd15d16a02262558e8c0dff22b20eac13eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3YDWY6VMOUGJPW4M5Z3Q54XL2W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on Ramsey numbers for Berge-G hyper graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andras Gyarfas, Maria Axenovich","submitted_at":"2018-07-26T10:56:50Z","abstract_excerpt":"For a graph G=(V,E), a hypergraph H is called Berge-G if there is a bijection f from E(G) to E(H) such that for each e in E(G), e is a subset of f(e). The set of all Berge-G hypergraphs is denoted B(G). For integers k>1, r>1, and a graph G, let the Ramsey number R_r(B(G), k) be the smallest integer n such that no matter how the edges of a complete r-uniform n-vertex hypergraph are colored with k colors, there is a copy of a monochromatic Berge-G subhypergraph. Furthermore, let R(B(G),k) be the smallest integer n such that no matter how all subsets an n-element set are colored with k colors, th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10062","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:05:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DqTLINV5SfTOtAhTeO5YHM63wdG5kHTirnESK8p9A4zcYsbaKCkngYnc9kmS4pZppITiv8mwkpQkpBMOtqUHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:18:43.101520Z"},"content_sha256":"6f3003fbe61bb0a27ef7b5540ceb9e653724b684b3dfd2477d3edd3847566688","schema_version":"1.0","event_id":"sha256:6f3003fbe61bb0a27ef7b5540ceb9e653724b684b3dfd2477d3edd3847566688"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YDWY6VMOUGJPW4M5Z3Q54XL2W/bundle.json","state_url":"https://pith.science/pith/3YDWY6VMOUGJPW4M5Z3Q54XL2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YDWY6VMOUGJPW4M5Z3Q54XL2W/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-03T23:18:43Z","links":{"resolver":"https://pith.science/pith/3YDWY6VMOUGJPW4M5Z3Q54XL2W","bundle":"https://pith.science/pith/3YDWY6VMOUGJPW4M5Z3Q54XL2W/bundle.json","state":"https://pith.science/pith/3YDWY6VMOUGJPW4M5Z3Q54XL2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YDWY6VMOUGJPW4M5Z3Q54XL2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3YDWY6VMOUGJPW4M5Z3Q54XL2W","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":"ceee0ac4331d5e0b6f970b3f2784e586e0d5bb5df06a613605f5bb606477b94f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-26T10:56:50Z","title_canon_sha256":"c8f3e4dcf67cda75cb519ae8976baccb6c2c93f93717eae9932849f4916bda97"},"schema_version":"1.0","source":{"id":"1807.10062","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10062","created_at":"2026-05-18T00:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10062v2","created_at":"2026-05-18T00:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10062","created_at":"2026-05-18T00:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"3YDWY6VMOUGJ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3YDWY6VMOUGJPW4M","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3YDWY6VM","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:6f3003fbe61bb0a27ef7b5540ceb9e653724b684b3dfd2477d3edd3847566688","target":"graph","created_at":"2026-05-18T00:05: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":"For a graph G=(V,E), a hypergraph H is called Berge-G if there is a bijection f from E(G) to E(H) such that for each e in E(G), e is a subset of f(e). The set of all Berge-G hypergraphs is denoted B(G). For integers k>1, r>1, and a graph G, let the Ramsey number R_r(B(G), k) be the smallest integer n such that no matter how the edges of a complete r-uniform n-vertex hypergraph are colored with k colors, there is a copy of a monochromatic Berge-G subhypergraph. Furthermore, let R(B(G),k) be the smallest integer n such that no matter how all subsets an n-element set are colored with k colors, th","authors_text":"Andras Gyarfas, Maria Axenovich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-26T10:56:50Z","title":"A note on Ramsey numbers for Berge-G hyper graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10062","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:99690eda71670ef9bf36bf016e95abd15d16a02262558e8c0dff22b20eac13eb","target":"record","created_at":"2026-05-18T00:05: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":"ceee0ac4331d5e0b6f970b3f2784e586e0d5bb5df06a613605f5bb606477b94f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-26T10:56:50Z","title_canon_sha256":"c8f3e4dcf67cda75cb519ae8976baccb6c2c93f93717eae9932849f4916bda97"},"schema_version":"1.0","source":{"id":"1807.10062","kind":"arxiv","version":2}},"canonical_sha256":"de076c7aac750c97db8cee770ef2ebd5bd274835f08686e6417fa284e20078c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de076c7aac750c97db8cee770ef2ebd5bd274835f08686e6417fa284e20078c4","first_computed_at":"2026-05-18T00:05:55.795969Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:55.795969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FRisZhzvMoujQS25xO/kjIEsxB5uXmvvAMuBvPfg2/vtrBMPJSdYoDML0DDJrwObtotYMqJwH0OLbBWtzDAADQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:55.796672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.10062","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99690eda71670ef9bf36bf016e95abd15d16a02262558e8c0dff22b20eac13eb","sha256:6f3003fbe61bb0a27ef7b5540ceb9e653724b684b3dfd2477d3edd3847566688"],"state_sha256":"091d5bcfaf18e098ed33aaa42b620fdd7433942cc7ca4a3ec54d15cd32dcfe59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/QVS81xaZ4Bo7DXhGHESpi89iVVQnicEO9cmFrZRQGyepJn+Iqs3V9qrwWDtPqzqKU0DnN9EpPCGADtxkqhHDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T23:18:43.103483Z","bundle_sha256":"d237b251ca5f85e2b68140a3a355a08e61d049ea42b23a0581a443ffd889c143"}}