{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CZTHHRWNSFEDEOR5P4MVJFERQA","short_pith_number":"pith:CZTHHRWN","canonical_record":{"source":{"id":"1901.03308","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-10T18:23:00Z","cross_cats_sorted":[],"title_canon_sha256":"9110f2686d44b78eb5eb2501ed71936adec5d9e9313ce661d527b08ff257a436","abstract_canon_sha256":"999c9e9709ee4edeac4cc4018463bcb7c100aa1576649fdea1d23fb299d696d5"},"schema_version":"1.0"},"canonical_sha256":"166673c6cd9148323a3d7f19549491802ca66a90a60c2c77227635dadae66fa9","source":{"kind":"arxiv","id":"1901.03308","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03308","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03308v1","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03308","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"pith_short_12","alias_value":"CZTHHRWNSFED","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CZTHHRWNSFEDEOR5","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CZTHHRWN","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CZTHHRWNSFEDEOR5P4MVJFERQA","target":"record","payload":{"canonical_record":{"source":{"id":"1901.03308","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-10T18:23:00Z","cross_cats_sorted":[],"title_canon_sha256":"9110f2686d44b78eb5eb2501ed71936adec5d9e9313ce661d527b08ff257a436","abstract_canon_sha256":"999c9e9709ee4edeac4cc4018463bcb7c100aa1576649fdea1d23fb299d696d5"},"schema_version":"1.0"},"canonical_sha256":"166673c6cd9148323a3d7f19549491802ca66a90a60c2c77227635dadae66fa9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:34.770948Z","signature_b64":"zpa51nCvNzNL5qVzi6LRFZUEYkxo8ZelGPWib0HQMm6E4IgGt/2CvDbkZyPv96ez0fP8KOA7jZVdqauCgdO/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"166673c6cd9148323a3d7f19549491802ca66a90a60c2c77227635dadae66fa9","last_reissued_at":"2026-05-17T23:56:34.770497Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:34.770497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.03308","source_version":1,"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-17T23:56:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BKa+ugP5q/EE18fiRy7UjGOm4sru0iumRKhbo3ojZOudeC4I2vGy+FIto/BU7SBPidp4k+TbQBIlQLX6YAeyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:20:39.946083Z"},"content_sha256":"aa63d601f0c1741669cff4068eca0c594a3d0c3020bc8f231b2537e099ef2596","schema_version":"1.0","event_id":"sha256:aa63d601f0c1741669cff4068eca0c594a3d0c3020bc8f231b2537e099ef2596"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CZTHHRWNSFEDEOR5P4MVJFERQA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower bounds for rainbow Tur\\'{a}n numbers of paths and other trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Johnston, Puck Rombach","submitted_at":"2019-01-10T18:23:00Z","abstract_excerpt":"For a fixed graph $F$, we would like to determine the maximum number of edges in a properly edge-colored graph on $n$ vertices which does not contain a rainbow copy of $F$, that is, a copy of $F$ all of whose edges receive a different color. This maximum, denoted by $ex^*(n, F)$, is the rainbow Tur\\'{a}n number of $F$. We show that $ex^*(n,P_k)\\geq \\frac{k}{2}n + O(1)$ where $P_k$ is a path on $k\\geq 3$ edges, generalizing a result by Maamoun and Meyniel and by Johnston, Palmer and Sarkar. We show similar bounds for brooms on $2^s-1$ edges and diameter $\\leq 10$ and a few other caterpillars of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03308","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"},"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-17T23:56:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T+4TDPt5vp13QGTJT4M59HeyfOT/QpcEbkeN6GOg13UFBNcP4B9OorMV1BTbXqNIQBY7gzbWyzeV9p+A1jU2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:20:39.946782Z"},"content_sha256":"6d4b52bcdff80b14f6a9c650c45022aca6ab7de75ba1e644f987d582e5021e57","schema_version":"1.0","event_id":"sha256:6d4b52bcdff80b14f6a9c650c45022aca6ab7de75ba1e644f987d582e5021e57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CZTHHRWNSFEDEOR5P4MVJFERQA/bundle.json","state_url":"https://pith.science/pith/CZTHHRWNSFEDEOR5P4MVJFERQA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CZTHHRWNSFEDEOR5P4MVJFERQA/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-05-27T19:20:39Z","links":{"resolver":"https://pith.science/pith/CZTHHRWNSFEDEOR5P4MVJFERQA","bundle":"https://pith.science/pith/CZTHHRWNSFEDEOR5P4MVJFERQA/bundle.json","state":"https://pith.science/pith/CZTHHRWNSFEDEOR5P4MVJFERQA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CZTHHRWNSFEDEOR5P4MVJFERQA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CZTHHRWNSFEDEOR5P4MVJFERQA","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":"999c9e9709ee4edeac4cc4018463bcb7c100aa1576649fdea1d23fb299d696d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-10T18:23:00Z","title_canon_sha256":"9110f2686d44b78eb5eb2501ed71936adec5d9e9313ce661d527b08ff257a436"},"schema_version":"1.0","source":{"id":"1901.03308","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03308","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03308v1","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03308","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"pith_short_12","alias_value":"CZTHHRWNSFED","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CZTHHRWNSFEDEOR5","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CZTHHRWN","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:6d4b52bcdff80b14f6a9c650c45022aca6ab7de75ba1e644f987d582e5021e57","target":"graph","created_at":"2026-05-17T23:56:34Z","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 fixed graph $F$, we would like to determine the maximum number of edges in a properly edge-colored graph on $n$ vertices which does not contain a rainbow copy of $F$, that is, a copy of $F$ all of whose edges receive a different color. This maximum, denoted by $ex^*(n, F)$, is the rainbow Tur\\'{a}n number of $F$. We show that $ex^*(n,P_k)\\geq \\frac{k}{2}n + O(1)$ where $P_k$ is a path on $k\\geq 3$ edges, generalizing a result by Maamoun and Meyniel and by Johnston, Palmer and Sarkar. We show similar bounds for brooms on $2^s-1$ edges and diameter $\\leq 10$ and a few other caterpillars of","authors_text":"Daniel Johnston, Puck Rombach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-10T18:23:00Z","title":"Lower bounds for rainbow Tur\\'{a}n numbers of paths and other trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03308","kind":"arxiv","version":1},"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:aa63d601f0c1741669cff4068eca0c594a3d0c3020bc8f231b2537e099ef2596","target":"record","created_at":"2026-05-17T23:56:34Z","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":"999c9e9709ee4edeac4cc4018463bcb7c100aa1576649fdea1d23fb299d696d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-10T18:23:00Z","title_canon_sha256":"9110f2686d44b78eb5eb2501ed71936adec5d9e9313ce661d527b08ff257a436"},"schema_version":"1.0","source":{"id":"1901.03308","kind":"arxiv","version":1}},"canonical_sha256":"166673c6cd9148323a3d7f19549491802ca66a90a60c2c77227635dadae66fa9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"166673c6cd9148323a3d7f19549491802ca66a90a60c2c77227635dadae66fa9","first_computed_at":"2026-05-17T23:56:34.770497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:34.770497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zpa51nCvNzNL5qVzi6LRFZUEYkxo8ZelGPWib0HQMm6E4IgGt/2CvDbkZyPv96ez0fP8KOA7jZVdqauCgdO/AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:34.770948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03308","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa63d601f0c1741669cff4068eca0c594a3d0c3020bc8f231b2537e099ef2596","sha256:6d4b52bcdff80b14f6a9c650c45022aca6ab7de75ba1e644f987d582e5021e57"],"state_sha256":"19ceee70267942db69870d02ee2b60cf9a3d5f1fc30a48b7d8a5e8f2b62a5301"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L6N/uWEiKSnKkBQN4KNhX5/c1s/j/9H2iKlWfHYO2MN7tvAORi74izQJyEhDidKH0CV6aX4Xe2Ma8QnK87gMAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:20:39.951233Z","bundle_sha256":"e7a0aa4f560e8e81d4e5d1a8228a132aed37daadb85af7c7bf896841ab69f54b"}}