{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:D7YDT5VAFFPDLDF5LBNQ2I6JHU","short_pith_number":"pith:D7YDT5VA","canonical_record":{"source":{"id":"1712.03247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-08T19:04:15Z","cross_cats_sorted":[],"title_canon_sha256":"6f2db9138fa74fa494ac48696d785e9112fac5479600279ab06ebf9e7ca7a17f","abstract_canon_sha256":"d1b55cab0b5fd5d38b8c844ec8ab653d0d48605080a8054531507fa99d8468ce"},"schema_version":"1.0"},"canonical_sha256":"1ff039f6a0295e358cbd585b0d23c93d08a77bd7ad5526bedf871c48f701d72f","source":{"kind":"arxiv","id":"1712.03247","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03247","created_at":"2026-05-18T00:28:21Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03247v1","created_at":"2026-05-18T00:28:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03247","created_at":"2026-05-18T00:28:21Z"},{"alias_kind":"pith_short_12","alias_value":"D7YDT5VAFFPD","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D7YDT5VAFFPDLDF5","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D7YDT5VA","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:D7YDT5VAFFPDLDF5LBNQ2I6JHU","target":"record","payload":{"canonical_record":{"source":{"id":"1712.03247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-08T19:04:15Z","cross_cats_sorted":[],"title_canon_sha256":"6f2db9138fa74fa494ac48696d785e9112fac5479600279ab06ebf9e7ca7a17f","abstract_canon_sha256":"d1b55cab0b5fd5d38b8c844ec8ab653d0d48605080a8054531507fa99d8468ce"},"schema_version":"1.0"},"canonical_sha256":"1ff039f6a0295e358cbd585b0d23c93d08a77bd7ad5526bedf871c48f701d72f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:21.893908Z","signature_b64":"dzLk7Hew7pyn7QKyXJ9ZlgEHuoy35ag6u5cxeDZzD8cEiZ747Ay5N2isSGUk/kqcL53F3dq5IgwuybYAxlBqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ff039f6a0295e358cbd585b0d23c93d08a77bd7ad5526bedf871c48f701d72f","last_reissued_at":"2026-05-18T00:28:21.893243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:21.893243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.03247","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-18T00:28:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nEmTeBGcDTjQNL/JhyIx5ryf3zcoevLJsaHz4wRWejJ4UVgLhgabdsMkUXLcRAPtqaf9LSIXholCnPqzjjdKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:44:22.601821Z"},"content_sha256":"8c50406b2a3e067f1320ba279b448ed3545e0f2989f0e2bdb6a34620e107d421","schema_version":"1.0","event_id":"sha256:8c50406b2a3e067f1320ba279b448ed3545e0f2989f0e2bdb6a34620e107d421"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:D7YDT5VAFFPDLDF5LBNQ2I6JHU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the size-Ramsey number of tight paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Linyuan Lu, Zhiyu Wang","submitted_at":"2017-12-08T19:04:15Z","abstract_excerpt":"For any $r\\geq 2$ and $k\\geq 3$, the $r$-color size-Ramsey number $\\hat R(\\mathcal{G},r)$ of a $k$-uniform hypergraph $\\mathcal{G}$ is the smallest integer $m$ such that there exists a $k$-uniform hypergraph $\\mathcal{H}$ on $m$ edges such that any coloring of the edges of $\\mathcal{H}$ with $r$ colors yields a monochromatic copy of $\\mathcal{G}$. Let $\\mathcal{P}_{n,k-1}^{(k)}$ denote the $k$-uniform tight path on $n$ vertices. Dudek, Fleur, Mubayi and R\\H{o}dl showed that the size-Ramsey number of tight paths $\\hat R(\\mathcal{P}_{n,k-1}^{(k)}, 2) = O(n^{k-1-\\alpha} (\\log n)^{1+\\alpha})$ wher"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03247","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-18T00:28:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nKxYwFIMMsE6eJLDuRe2zrE2bEyBkXl6+htkYYqmZFpdI2r5XDLJvJ25T89QIXyW2pGeWdvRTDyhdNcQxQiBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:44:22.602194Z"},"content_sha256":"2281e2284f390944550c2cf714c898d5f2436dd24d3705c05f00d1ff0e611359","schema_version":"1.0","event_id":"sha256:2281e2284f390944550c2cf714c898d5f2436dd24d3705c05f00d1ff0e611359"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D7YDT5VAFFPDLDF5LBNQ2I6JHU/bundle.json","state_url":"https://pith.science/pith/D7YDT5VAFFPDLDF5LBNQ2I6JHU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D7YDT5VAFFPDLDF5LBNQ2I6JHU/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-04T21:44:22Z","links":{"resolver":"https://pith.science/pith/D7YDT5VAFFPDLDF5LBNQ2I6JHU","bundle":"https://pith.science/pith/D7YDT5VAFFPDLDF5LBNQ2I6JHU/bundle.json","state":"https://pith.science/pith/D7YDT5VAFFPDLDF5LBNQ2I6JHU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D7YDT5VAFFPDLDF5LBNQ2I6JHU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:D7YDT5VAFFPDLDF5LBNQ2I6JHU","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":"d1b55cab0b5fd5d38b8c844ec8ab653d0d48605080a8054531507fa99d8468ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-08T19:04:15Z","title_canon_sha256":"6f2db9138fa74fa494ac48696d785e9112fac5479600279ab06ebf9e7ca7a17f"},"schema_version":"1.0","source":{"id":"1712.03247","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03247","created_at":"2026-05-18T00:28:21Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03247v1","created_at":"2026-05-18T00:28:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03247","created_at":"2026-05-18T00:28:21Z"},{"alias_kind":"pith_short_12","alias_value":"D7YDT5VAFFPD","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D7YDT5VAFFPDLDF5","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D7YDT5VA","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:2281e2284f390944550c2cf714c898d5f2436dd24d3705c05f00d1ff0e611359","target":"graph","created_at":"2026-05-18T00:28:21Z","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 any $r\\geq 2$ and $k\\geq 3$, the $r$-color size-Ramsey number $\\hat R(\\mathcal{G},r)$ of a $k$-uniform hypergraph $\\mathcal{G}$ is the smallest integer $m$ such that there exists a $k$-uniform hypergraph $\\mathcal{H}$ on $m$ edges such that any coloring of the edges of $\\mathcal{H}$ with $r$ colors yields a monochromatic copy of $\\mathcal{G}$. Let $\\mathcal{P}_{n,k-1}^{(k)}$ denote the $k$-uniform tight path on $n$ vertices. Dudek, Fleur, Mubayi and R\\H{o}dl showed that the size-Ramsey number of tight paths $\\hat R(\\mathcal{P}_{n,k-1}^{(k)}, 2) = O(n^{k-1-\\alpha} (\\log n)^{1+\\alpha})$ wher","authors_text":"Linyuan Lu, Zhiyu Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-08T19:04:15Z","title":"On the size-Ramsey number of tight paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03247","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:8c50406b2a3e067f1320ba279b448ed3545e0f2989f0e2bdb6a34620e107d421","target":"record","created_at":"2026-05-18T00:28:21Z","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":"d1b55cab0b5fd5d38b8c844ec8ab653d0d48605080a8054531507fa99d8468ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-08T19:04:15Z","title_canon_sha256":"6f2db9138fa74fa494ac48696d785e9112fac5479600279ab06ebf9e7ca7a17f"},"schema_version":"1.0","source":{"id":"1712.03247","kind":"arxiv","version":1}},"canonical_sha256":"1ff039f6a0295e358cbd585b0d23c93d08a77bd7ad5526bedf871c48f701d72f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ff039f6a0295e358cbd585b0d23c93d08a77bd7ad5526bedf871c48f701d72f","first_computed_at":"2026-05-18T00:28:21.893243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:21.893243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dzLk7Hew7pyn7QKyXJ9ZlgEHuoy35ag6u5cxeDZzD8cEiZ747Ay5N2isSGUk/kqcL53F3dq5IgwuybYAxlBqDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:21.893908Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.03247","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c50406b2a3e067f1320ba279b448ed3545e0f2989f0e2bdb6a34620e107d421","sha256:2281e2284f390944550c2cf714c898d5f2436dd24d3705c05f00d1ff0e611359"],"state_sha256":"9a1e8cc5241abfc0a2acf9bb478822a4470141281fefb3c399b46b3b941515c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aVc1I7tDeJCSGNbJ5Car48tYCuf+A6UrY9MrKZR7XrLJa+tjo0gbJjV6pvaxsHSkigD00YkiM8rQpWiMKX79Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:44:22.607552Z","bundle_sha256":"202492dda635781b5a4457544916dcdb4427307acead0b54a2fc36aae6dc3ee7"}}