{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UFXIU5FQVPIYUWOWA2NQJPGSB7","short_pith_number":"pith:UFXIU5FQ","canonical_record":{"source":{"id":"1501.06320","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-26T10:42:13Z","cross_cats_sorted":[],"title_canon_sha256":"a480abeb29fb0f1a3b5d9f1fd53f475cefdba6a30a1a2396f9e34d86756e4a05","abstract_canon_sha256":"28d28a5ec5592924f5049f8e8455e00601e8eb866b07eeeb334017ef1db8691e"},"schema_version":"1.0"},"canonical_sha256":"a16e8a74b0abd18a59d6069b04bcd20fe75b9bfed0da9da79549d3ecb6b47da3","source":{"kind":"arxiv","id":"1501.06320","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06320","created_at":"2026-05-18T02:20:30Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06320v2","created_at":"2026-05-18T02:20:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06320","created_at":"2026-05-18T02:20:30Z"},{"alias_kind":"pith_short_12","alias_value":"UFXIU5FQVPIY","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UFXIU5FQVPIYUWOW","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UFXIU5FQ","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UFXIU5FQVPIYUWOWA2NQJPGSB7","target":"record","payload":{"canonical_record":{"source":{"id":"1501.06320","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-26T10:42:13Z","cross_cats_sorted":[],"title_canon_sha256":"a480abeb29fb0f1a3b5d9f1fd53f475cefdba6a30a1a2396f9e34d86756e4a05","abstract_canon_sha256":"28d28a5ec5592924f5049f8e8455e00601e8eb866b07eeeb334017ef1db8691e"},"schema_version":"1.0"},"canonical_sha256":"a16e8a74b0abd18a59d6069b04bcd20fe75b9bfed0da9da79549d3ecb6b47da3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:30.217898Z","signature_b64":"QEdHz8u6qt6fRcjqXo8JukzqUEHlOOlr+WDPNa4yYD2AGrOb+hGUYSN/WhvxF1vuswSwmEGk/1ek2oRTTVafDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a16e8a74b0abd18a59d6069b04bcd20fe75b9bfed0da9da79549d3ecb6b47da3","last_reissued_at":"2026-05-18T02:20:30.217450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:30.217450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.06320","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-18T02:20:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YxmVuaFdAA4qDqPlz+FD0EUdxupANFRLhb95+l1Bp91/0YRpCHLlrJDNWZnkf+vRcz6kpL+YA1RRPIiX7N9nDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:50:24.552236Z"},"content_sha256":"75096262d4aa298bdca560a8e24b88b5e49a6fc3fed6e9feb92ca379e81c513e","schema_version":"1.0","event_id":"sha256:75096262d4aa298bdca560a8e24b88b5e49a6fc3fed6e9feb92ca379e81c513e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UFXIU5FQVPIYUWOWA2NQJPGSB7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Conditions on Ramsey non-equivalence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jonathan Rollin, Maria Axenovich, Torsten Ueckerdt","submitted_at":"2015-01-26T10:42:13Z","abstract_excerpt":"Given a graph H, a graph G is called a Ramsey graph of H if there is a monochromatic copy of H in every coloring of the edges of G with two colors. Two graphs G, H are called Ramsey equivalent if they have the same set of Ramsey graphs. Fox et al. [J. Combin. Theory Ser. B 109 (2014), 120--133] asked whether there are two non-isomorphic connected graphs that are Ramsey equivalent. They proved that a clique is not Ramsey equivalent to any other connected graph. Results of Nesetril et al. showed that any two graphs with different clique number [Combinatorica 1(2) (1981), 199--202] or different o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06320","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-18T02:20:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8HNxut+72vbipDP4xbNVHabJVElxz2Wwmb/XgEJCnS3KAduPEbIiph8n+YKZwll2SAtS81ZhlYkEi/bkMoiABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:50:24.552593Z"},"content_sha256":"8974945632b6bb7a60c1b258abfc68461249ac8d81507afcbdd5d82b3ee7fc49","schema_version":"1.0","event_id":"sha256:8974945632b6bb7a60c1b258abfc68461249ac8d81507afcbdd5d82b3ee7fc49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFXIU5FQVPIYUWOWA2NQJPGSB7/bundle.json","state_url":"https://pith.science/pith/UFXIU5FQVPIYUWOWA2NQJPGSB7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFXIU5FQVPIYUWOWA2NQJPGSB7/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-04T05:50:24Z","links":{"resolver":"https://pith.science/pith/UFXIU5FQVPIYUWOWA2NQJPGSB7","bundle":"https://pith.science/pith/UFXIU5FQVPIYUWOWA2NQJPGSB7/bundle.json","state":"https://pith.science/pith/UFXIU5FQVPIYUWOWA2NQJPGSB7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFXIU5FQVPIYUWOWA2NQJPGSB7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UFXIU5FQVPIYUWOWA2NQJPGSB7","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":"28d28a5ec5592924f5049f8e8455e00601e8eb866b07eeeb334017ef1db8691e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-26T10:42:13Z","title_canon_sha256":"a480abeb29fb0f1a3b5d9f1fd53f475cefdba6a30a1a2396f9e34d86756e4a05"},"schema_version":"1.0","source":{"id":"1501.06320","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06320","created_at":"2026-05-18T02:20:30Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06320v2","created_at":"2026-05-18T02:20:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06320","created_at":"2026-05-18T02:20:30Z"},{"alias_kind":"pith_short_12","alias_value":"UFXIU5FQVPIY","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UFXIU5FQVPIYUWOW","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UFXIU5FQ","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:8974945632b6bb7a60c1b258abfc68461249ac8d81507afcbdd5d82b3ee7fc49","target":"graph","created_at":"2026-05-18T02:20:30Z","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":"Given a graph H, a graph G is called a Ramsey graph of H if there is a monochromatic copy of H in every coloring of the edges of G with two colors. Two graphs G, H are called Ramsey equivalent if they have the same set of Ramsey graphs. Fox et al. [J. Combin. Theory Ser. B 109 (2014), 120--133] asked whether there are two non-isomorphic connected graphs that are Ramsey equivalent. They proved that a clique is not Ramsey equivalent to any other connected graph. Results of Nesetril et al. showed that any two graphs with different clique number [Combinatorica 1(2) (1981), 199--202] or different o","authors_text":"Jonathan Rollin, Maria Axenovich, Torsten Ueckerdt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-26T10:42:13Z","title":"Conditions on Ramsey non-equivalence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06320","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:75096262d4aa298bdca560a8e24b88b5e49a6fc3fed6e9feb92ca379e81c513e","target":"record","created_at":"2026-05-18T02:20:30Z","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":"28d28a5ec5592924f5049f8e8455e00601e8eb866b07eeeb334017ef1db8691e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-26T10:42:13Z","title_canon_sha256":"a480abeb29fb0f1a3b5d9f1fd53f475cefdba6a30a1a2396f9e34d86756e4a05"},"schema_version":"1.0","source":{"id":"1501.06320","kind":"arxiv","version":2}},"canonical_sha256":"a16e8a74b0abd18a59d6069b04bcd20fe75b9bfed0da9da79549d3ecb6b47da3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a16e8a74b0abd18a59d6069b04bcd20fe75b9bfed0da9da79549d3ecb6b47da3","first_computed_at":"2026-05-18T02:20:30.217450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:30.217450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QEdHz8u6qt6fRcjqXo8JukzqUEHlOOlr+WDPNa4yYD2AGrOb+hGUYSN/WhvxF1vuswSwmEGk/1ek2oRTTVafDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:30.217898Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.06320","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75096262d4aa298bdca560a8e24b88b5e49a6fc3fed6e9feb92ca379e81c513e","sha256:8974945632b6bb7a60c1b258abfc68461249ac8d81507afcbdd5d82b3ee7fc49"],"state_sha256":"a39aa2382732847d928fb927ac66b97f265ad639740ff51c9c12c3c88f990c0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JJ8wMSP6pQswSaICnENt0lJXh70TE+ZRV+qgSFhjRxldAXdu5Fw1x6OYhWlbx7kKIltU3CFnBpRfsEMUShIHBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:50:24.554578Z","bundle_sha256":"5d4b2c7b6132010336a75b9cef0ce5bfb698c38733981d1b8346bfc1a76f4b8a"}}