{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UBZATLOY36ABZQMEA6HIWAYIAU","short_pith_number":"pith:UBZATLOY","schema_version":"1.0","canonical_sha256":"a07209add8df801cc184078e8b030805290c2a65584db4395ca5f573b7835551","source":{"kind":"arxiv","id":"2502.00135","version":1},"attestation_state":"computed","paper":{"title":"Rainbow Erd\\H{o}s-S\\'os Conjectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dylan King, Nicholas Crawford, Sam Spiro","submitted_at":"2025-01-31T19:40:12Z","abstract_excerpt":"An edge colored graph is said to contain rainbow-$F$ if $F$ is a subgraph and every edge receives a different color. In 2007, Keevash, Mubayi, Sudakov, and Verstra\\\"ete introduced the \\emph{rainbow extremal number} $\\mathrm{ex}^*(n,F)$, a variant on the classical Tur\\'an problem, asking for the maximum number of edges in a $n$-vertex properly edge-colored graph which does not contain a rainbow-$F$. In the following years many authors have studied the asymptotic behavior of $\\mathrm{ex}^*(n,F)$ when $F$ is bipartite. In the particular case that $F$ is a tree $T$, the infamous Erd\\\"os-S\\'os conj"},"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":"2502.00135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-31T19:40:12Z","cross_cats_sorted":[],"title_canon_sha256":"a08209a3f43f536582d45c9d0288e3e0f37c8927e502e31dad8dde273b4ba885","abstract_canon_sha256":"8de5fc64467daa1cd1f6951565452b587b0ab2ed67acf9c4b66b6aa649e558a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:03.420845Z","signature_b64":"8ZyoOLkRpoDh6wMSdHJNGeDge8ZM8aSRO6EskDukWbDG6VqkCSmJDcRvyokrgq9PpjxWUDTeJodHLVZ5/S+GAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a07209add8df801cc184078e8b030805290c2a65584db4395ca5f573b7835551","last_reissued_at":"2026-07-05T10:08:03.420460Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:03.420460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rainbow Erd\\H{o}s-S\\'os Conjectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dylan King, Nicholas Crawford, Sam Spiro","submitted_at":"2025-01-31T19:40:12Z","abstract_excerpt":"An edge colored graph is said to contain rainbow-$F$ if $F$ is a subgraph and every edge receives a different color. In 2007, Keevash, Mubayi, Sudakov, and Verstra\\\"ete introduced the \\emph{rainbow extremal number} $\\mathrm{ex}^*(n,F)$, a variant on the classical Tur\\'an problem, asking for the maximum number of edges in a $n$-vertex properly edge-colored graph which does not contain a rainbow-$F$. In the following years many authors have studied the asymptotic behavior of $\\mathrm{ex}^*(n,F)$ when $F$ is bipartite. In the particular case that $F$ is a tree $T$, the infamous Erd\\\"os-S\\'os conj"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00135","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/2502.00135/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":"2502.00135","created_at":"2026-07-05T10:08:03.420515+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.00135v1","created_at":"2026-07-05T10:08:03.420515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00135","created_at":"2026-07-05T10:08:03.420515+00:00"},{"alias_kind":"pith_short_12","alias_value":"UBZATLOY36AB","created_at":"2026-07-05T10:08:03.420515+00:00"},{"alias_kind":"pith_short_16","alias_value":"UBZATLOY36ABZQME","created_at":"2026-07-05T10:08:03.420515+00:00"},{"alias_kind":"pith_short_8","alias_value":"UBZATLOY","created_at":"2026-07-05T10:08:03.420515+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/UBZATLOY36ABZQMEA6HIWAYIAU","json":"https://pith.science/pith/UBZATLOY36ABZQMEA6HIWAYIAU.json","graph_json":"https://pith.science/api/pith-number/UBZATLOY36ABZQMEA6HIWAYIAU/graph.json","events_json":"https://pith.science/api/pith-number/UBZATLOY36ABZQMEA6HIWAYIAU/events.json","paper":"https://pith.science/paper/UBZATLOY"},"agent_actions":{"view_html":"https://pith.science/pith/UBZATLOY36ABZQMEA6HIWAYIAU","download_json":"https://pith.science/pith/UBZATLOY36ABZQMEA6HIWAYIAU.json","view_paper":"https://pith.science/paper/UBZATLOY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.00135&json=true","fetch_graph":"https://pith.science/api/pith-number/UBZATLOY36ABZQMEA6HIWAYIAU/graph.json","fetch_events":"https://pith.science/api/pith-number/UBZATLOY36ABZQMEA6HIWAYIAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UBZATLOY36ABZQMEA6HIWAYIAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UBZATLOY36ABZQMEA6HIWAYIAU/action/storage_attestation","attest_author":"https://pith.science/pith/UBZATLOY36ABZQMEA6HIWAYIAU/action/author_attestation","sign_citation":"https://pith.science/pith/UBZATLOY36ABZQMEA6HIWAYIAU/action/citation_signature","submit_replication":"https://pith.science/pith/UBZATLOY36ABZQMEA6HIWAYIAU/action/replication_record"}},"created_at":"2026-07-05T10:08:03.420515+00:00","updated_at":"2026-07-05T10:08:03.420515+00:00"}