{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:245A4I4E5TVU4FLR7AEAHZAH3A","short_pith_number":"pith:245A4I4E","schema_version":"1.0","canonical_sha256":"d73a0e2384eceb4e1571f80803e407d8350afa2361e7b8eb409bf2e483e9f274","source":{"kind":"arxiv","id":"2206.03898","version":1},"attestation_state":"computed","paper":{"title":"Ramsey equivalence for asymmetric pairs of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dennis Clemens, Jonathan Rollin, Pranshu Gupta, Simona Boyadzhiyska","submitted_at":"2022-06-08T13:51:50Z","abstract_excerpt":"A graph $F$ is Ramsey for a pair of graphs $(G,H)$ if any red/blue-coloring of the edges of $F$ yields a copy of $G$ with all edges colored red or a copy of $H$ with all edges colored blue. Two pairs of graphs are called Ramsey equivalent if they have the same collection of Ramsey graphs. The symmetric setting, that is, the case $G=H$, received considerable attention. This led to the open question whether there are connected graphs $G$ and $G'$ such that $(G,G)$ and $(G',G')$ are Ramsey equivalent. We make progress on the asymmetric version of this question and identify several non-trivial fam"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2206.03898","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-06-08T13:51:50Z","cross_cats_sorted":[],"title_canon_sha256":"59bb071fd06866f29c5bd534b70cba6786ccf39ca7e2a7a6d2a5aefcefd25daa","abstract_canon_sha256":"15e56d2d4f56f36bcf35debf3b901a776da6861b978f5443e7da885194a221fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:30:15.022814Z","signature_b64":"4BB+f6vmLWx8J1oRX7baCkdp5rQCoqv1ucGaeqtgaQdZLy+8RHXa1ebwT57ma8Zkcd2lYS06zH9dQBZ2Oe28CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d73a0e2384eceb4e1571f80803e407d8350afa2361e7b8eb409bf2e483e9f274","last_reissued_at":"2026-07-05T04:30:15.022304Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:30:15.022304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ramsey equivalence for asymmetric pairs of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dennis Clemens, Jonathan Rollin, Pranshu Gupta, Simona Boyadzhiyska","submitted_at":"2022-06-08T13:51:50Z","abstract_excerpt":"A graph $F$ is Ramsey for a pair of graphs $(G,H)$ if any red/blue-coloring of the edges of $F$ yields a copy of $G$ with all edges colored red or a copy of $H$ with all edges colored blue. Two pairs of graphs are called Ramsey equivalent if they have the same collection of Ramsey graphs. The symmetric setting, that is, the case $G=H$, received considerable attention. This led to the open question whether there are connected graphs $G$ and $G'$ such that $(G,G)$ and $(G',G')$ are Ramsey equivalent. We make progress on the asymmetric version of this question and identify several non-trivial fam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.03898","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.03898/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2206.03898","created_at":"2026-07-05T04:30:15.022371+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.03898v1","created_at":"2026-07-05T04:30:15.022371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.03898","created_at":"2026-07-05T04:30:15.022371+00:00"},{"alias_kind":"pith_short_12","alias_value":"245A4I4E5TVU","created_at":"2026-07-05T04:30:15.022371+00:00"},{"alias_kind":"pith_short_16","alias_value":"245A4I4E5TVU4FLR","created_at":"2026-07-05T04:30:15.022371+00:00"},{"alias_kind":"pith_short_8","alias_value":"245A4I4E","created_at":"2026-07-05T04:30:15.022371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/245A4I4E5TVU4FLR7AEAHZAH3A","json":"https://pith.science/pith/245A4I4E5TVU4FLR7AEAHZAH3A.json","graph_json":"https://pith.science/api/pith-number/245A4I4E5TVU4FLR7AEAHZAH3A/graph.json","events_json":"https://pith.science/api/pith-number/245A4I4E5TVU4FLR7AEAHZAH3A/events.json","paper":"https://pith.science/paper/245A4I4E"},"agent_actions":{"view_html":"https://pith.science/pith/245A4I4E5TVU4FLR7AEAHZAH3A","download_json":"https://pith.science/pith/245A4I4E5TVU4FLR7AEAHZAH3A.json","view_paper":"https://pith.science/paper/245A4I4E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.03898&json=true","fetch_graph":"https://pith.science/api/pith-number/245A4I4E5TVU4FLR7AEAHZAH3A/graph.json","fetch_events":"https://pith.science/api/pith-number/245A4I4E5TVU4FLR7AEAHZAH3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/245A4I4E5TVU4FLR7AEAHZAH3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/245A4I4E5TVU4FLR7AEAHZAH3A/action/storage_attestation","attest_author":"https://pith.science/pith/245A4I4E5TVU4FLR7AEAHZAH3A/action/author_attestation","sign_citation":"https://pith.science/pith/245A4I4E5TVU4FLR7AEAHZAH3A/action/citation_signature","submit_replication":"https://pith.science/pith/245A4I4E5TVU4FLR7AEAHZAH3A/action/replication_record"}},"created_at":"2026-07-05T04:30:15.022371+00:00","updated_at":"2026-07-05T04:30:15.022371+00:00"}