{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NBZAA7MB3X46FQVK5GEKXCNWL7","short_pith_number":"pith:NBZAA7MB","schema_version":"1.0","canonical_sha256":"6872007d81ddf9e2c2aae988ab89b65fd27ed089e58d59fedd3d84adddfe1ccc","source":{"kind":"arxiv","id":"1510.04843","version":1},"attestation_state":"computed","paper":{"title":"Chv\\'{a}tal-type results for degree sequence Ramsey numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Reiniger, Christopher Cox, Michael Ferrara, Ryan M. Martin","submitted_at":"2015-10-16T11:32:11Z","abstract_excerpt":"A sequence of nonnegative integers $\\pi =(d_1,d_2,...,d_n)$ is graphic if there is a (simple) graph $G$ of order $n$ having degree sequence $\\pi$. In this case, $G$ is said to realize or be a realization of $\\pi$. Given a graph $H$, a graphic sequence $\\pi$ is potentially $H$-graphic if there is some realization of $\\pi$ that contains $H$ as a subgraph.\n  In this paper, we consider a degree sequence analogue to classical graph Ramsey numbers. For graphs $H_1$ and $H_2$, the potential-Ramsey number $r_{pot}(H_1,H_2)$ is the minimum integer $N$ such that for any $N$-term graphic sequence $\\pi$, "},"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":"1510.04843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-16T11:32:11Z","cross_cats_sorted":[],"title_canon_sha256":"26e215ec7293723fd1d1b3f3188b72452865e7d3d8bcb7f03c09d5e1729478c7","abstract_canon_sha256":"f828c0d43da52e2937d95db123c392a28576e6d8f92f577ffc5ff7cb970b80dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:00.475766Z","signature_b64":"uVJZcnD7BUp5rj2k+4c4b7rpG2jfeBVcnuMkew2CJkSgbIBKNlPpUXTRYt9oKUPU8na4ys5bMiVHz5BvgW8JCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6872007d81ddf9e2c2aae988ab89b65fd27ed089e58d59fedd3d84adddfe1ccc","last_reissued_at":"2026-05-18T01:30:00.475193Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:00.475193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chv\\'{a}tal-type results for degree sequence Ramsey numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Reiniger, Christopher Cox, Michael Ferrara, Ryan M. Martin","submitted_at":"2015-10-16T11:32:11Z","abstract_excerpt":"A sequence of nonnegative integers $\\pi =(d_1,d_2,...,d_n)$ is graphic if there is a (simple) graph $G$ of order $n$ having degree sequence $\\pi$. In this case, $G$ is said to realize or be a realization of $\\pi$. Given a graph $H$, a graphic sequence $\\pi$ is potentially $H$-graphic if there is some realization of $\\pi$ that contains $H$ as a subgraph.\n  In this paper, we consider a degree sequence analogue to classical graph Ramsey numbers. For graphs $H_1$ and $H_2$, the potential-Ramsey number $r_{pot}(H_1,H_2)$ is the minimum integer $N$ such that for any $N$-term graphic sequence $\\pi$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04843","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.04843","created_at":"2026-05-18T01:30:00.475274+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.04843v1","created_at":"2026-05-18T01:30:00.475274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04843","created_at":"2026-05-18T01:30:00.475274+00:00"},{"alias_kind":"pith_short_12","alias_value":"NBZAA7MB3X46","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NBZAA7MB3X46FQVK","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NBZAA7MB","created_at":"2026-05-18T12:29:32.376354+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/NBZAA7MB3X46FQVK5GEKXCNWL7","json":"https://pith.science/pith/NBZAA7MB3X46FQVK5GEKXCNWL7.json","graph_json":"https://pith.science/api/pith-number/NBZAA7MB3X46FQVK5GEKXCNWL7/graph.json","events_json":"https://pith.science/api/pith-number/NBZAA7MB3X46FQVK5GEKXCNWL7/events.json","paper":"https://pith.science/paper/NBZAA7MB"},"agent_actions":{"view_html":"https://pith.science/pith/NBZAA7MB3X46FQVK5GEKXCNWL7","download_json":"https://pith.science/pith/NBZAA7MB3X46FQVK5GEKXCNWL7.json","view_paper":"https://pith.science/paper/NBZAA7MB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.04843&json=true","fetch_graph":"https://pith.science/api/pith-number/NBZAA7MB3X46FQVK5GEKXCNWL7/graph.json","fetch_events":"https://pith.science/api/pith-number/NBZAA7MB3X46FQVK5GEKXCNWL7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NBZAA7MB3X46FQVK5GEKXCNWL7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NBZAA7MB3X46FQVK5GEKXCNWL7/action/storage_attestation","attest_author":"https://pith.science/pith/NBZAA7MB3X46FQVK5GEKXCNWL7/action/author_attestation","sign_citation":"https://pith.science/pith/NBZAA7MB3X46FQVK5GEKXCNWL7/action/citation_signature","submit_replication":"https://pith.science/pith/NBZAA7MB3X46FQVK5GEKXCNWL7/action/replication_record"}},"created_at":"2026-05-18T01:30:00.475274+00:00","updated_at":"2026-05-18T01:30:00.475274+00:00"}