{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:J6LPODZYI2LZF7JAVLLVR54CBC","short_pith_number":"pith:J6LPODZY","canonical_record":{"source":{"id":"1602.02299","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-06T19:47:38Z","cross_cats_sorted":[],"title_canon_sha256":"d5dfedd61e49725d96163ccd0322e0643ec243981d0939fd4975a591f0010814","abstract_canon_sha256":"86b2b9aaf4cb60e0ca74fc1b9eea29ab399b931d150cede73935278b0ed67f6a"},"schema_version":"1.0"},"canonical_sha256":"4f96f70f38469792fd20aad758f782089b83a9841cfb9d37a7d575555e6154bb","source":{"kind":"arxiv","id":"1602.02299","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02299","created_at":"2026-05-17T23:52:19Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02299v2","created_at":"2026-05-17T23:52:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02299","created_at":"2026-05-17T23:52:19Z"},{"alias_kind":"pith_short_12","alias_value":"J6LPODZYI2LZ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J6LPODZYI2LZF7JA","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J6LPODZY","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:J6LPODZYI2LZF7JAVLLVR54CBC","target":"record","payload":{"canonical_record":{"source":{"id":"1602.02299","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-06T19:47:38Z","cross_cats_sorted":[],"title_canon_sha256":"d5dfedd61e49725d96163ccd0322e0643ec243981d0939fd4975a591f0010814","abstract_canon_sha256":"86b2b9aaf4cb60e0ca74fc1b9eea29ab399b931d150cede73935278b0ed67f6a"},"schema_version":"1.0"},"canonical_sha256":"4f96f70f38469792fd20aad758f782089b83a9841cfb9d37a7d575555e6154bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:19.266978Z","signature_b64":"PzODxlTpQSzaR959TwOwTlnci9/3uLSF8fsM3MA5iP7VBSFFSbtIAadglkuTzw7QMZ/vH/iRUDmxtNbZYrw9Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f96f70f38469792fd20aad758f782089b83a9841cfb9d37a7d575555e6154bb","last_reissued_at":"2026-05-17T23:52:19.266294Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:19.266294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.02299","source_version":2,"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:52:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YTzmtLaRCsy5SS1opDyE+mnUhBZZizz5zbJfWEIVER5BfSxFxlXR45PnIxDSnUlE51SVYAS3ZWZkHysn5tpgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:21:53.779358Z"},"content_sha256":"0d63a92f63fddae02d1c082a0c33bff48431e42683eea67fc7e0ae18146b8514","schema_version":"1.0","event_id":"sha256:0d63a92f63fddae02d1c082a0c33bff48431e42683eea67fc7e0ae18146b8514"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:J6LPODZYI2LZF7JAVLLVR54CBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some remarks on the extremal function for uniformly two-path dense hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Reiher, Mathias Schacht, Vojt\\v{e}ch R\\\"odl","submitted_at":"2016-02-06T19:47:38Z","abstract_excerpt":"We investigate extremal problems for hypergraphs satisfying the following density condition. A $3$-uniform hypergraph $H=(V, E)$ is $(d, \\eta,P_2)$-dense if for any two subsets of pairs $P$, $Q\\subseteq V\\times V$ the number of pairs $((x,y),(x,z))\\in P\\times Q$ with $\\{x,y,z\\}\\in E$ is at least $d|\\mathcal{K}_{P_2}(P,Q)|-\\eta|V|^3,$ where $\\mathcal{K}_{P_2}(P,Q)$ denotes the set of pairs in $P\\times Q$ of the form $((x,y),(x,z))$. For a given $3$-uniform hypergraph $F$ we are interested in the infimum $d\\geq 0$ such that for sufficiently small $\\eta$ every sufficiently large $(d, \\eta,P_2)$-d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02299","kind":"arxiv","version":2},"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:52:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v6X/oKTC/cityc1eqkv5uuX9/vx9pq5t4tugVVnMyD/w8nozT8Xe0fnqn1Pjqj6hDYK9BdfcGFwzTV26oOOfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:21:53.780027Z"},"content_sha256":"ba22cd9b30f5a0ab93ee86fdf99bd69ad1221eec65198741996a118c391df366","schema_version":"1.0","event_id":"sha256:ba22cd9b30f5a0ab93ee86fdf99bd69ad1221eec65198741996a118c391df366"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J6LPODZYI2LZF7JAVLLVR54CBC/bundle.json","state_url":"https://pith.science/pith/J6LPODZYI2LZF7JAVLLVR54CBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J6LPODZYI2LZF7JAVLLVR54CBC/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-27T09:21:53Z","links":{"resolver":"https://pith.science/pith/J6LPODZYI2LZF7JAVLLVR54CBC","bundle":"https://pith.science/pith/J6LPODZYI2LZF7JAVLLVR54CBC/bundle.json","state":"https://pith.science/pith/J6LPODZYI2LZF7JAVLLVR54CBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J6LPODZYI2LZF7JAVLLVR54CBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:J6LPODZYI2LZF7JAVLLVR54CBC","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":"86b2b9aaf4cb60e0ca74fc1b9eea29ab399b931d150cede73935278b0ed67f6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-06T19:47:38Z","title_canon_sha256":"d5dfedd61e49725d96163ccd0322e0643ec243981d0939fd4975a591f0010814"},"schema_version":"1.0","source":{"id":"1602.02299","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02299","created_at":"2026-05-17T23:52:19Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02299v2","created_at":"2026-05-17T23:52:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02299","created_at":"2026-05-17T23:52:19Z"},{"alias_kind":"pith_short_12","alias_value":"J6LPODZYI2LZ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J6LPODZYI2LZF7JA","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J6LPODZY","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:ba22cd9b30f5a0ab93ee86fdf99bd69ad1221eec65198741996a118c391df366","target":"graph","created_at":"2026-05-17T23:52:19Z","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":"We investigate extremal problems for hypergraphs satisfying the following density condition. A $3$-uniform hypergraph $H=(V, E)$ is $(d, \\eta,P_2)$-dense if for any two subsets of pairs $P$, $Q\\subseteq V\\times V$ the number of pairs $((x,y),(x,z))\\in P\\times Q$ with $\\{x,y,z\\}\\in E$ is at least $d|\\mathcal{K}_{P_2}(P,Q)|-\\eta|V|^3,$ where $\\mathcal{K}_{P_2}(P,Q)$ denotes the set of pairs in $P\\times Q$ of the form $((x,y),(x,z))$. For a given $3$-uniform hypergraph $F$ we are interested in the infimum $d\\geq 0$ such that for sufficiently small $\\eta$ every sufficiently large $(d, \\eta,P_2)$-d","authors_text":"Christian Reiher, Mathias Schacht, Vojt\\v{e}ch R\\\"odl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-06T19:47:38Z","title":"Some remarks on the extremal function for uniformly two-path dense hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02299","kind":"arxiv","version":2},"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:0d63a92f63fddae02d1c082a0c33bff48431e42683eea67fc7e0ae18146b8514","target":"record","created_at":"2026-05-17T23:52:19Z","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":"86b2b9aaf4cb60e0ca74fc1b9eea29ab399b931d150cede73935278b0ed67f6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-06T19:47:38Z","title_canon_sha256":"d5dfedd61e49725d96163ccd0322e0643ec243981d0939fd4975a591f0010814"},"schema_version":"1.0","source":{"id":"1602.02299","kind":"arxiv","version":2}},"canonical_sha256":"4f96f70f38469792fd20aad758f782089b83a9841cfb9d37a7d575555e6154bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f96f70f38469792fd20aad758f782089b83a9841cfb9d37a7d575555e6154bb","first_computed_at":"2026-05-17T23:52:19.266294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:19.266294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PzODxlTpQSzaR959TwOwTlnci9/3uLSF8fsM3MA5iP7VBSFFSbtIAadglkuTzw7QMZ/vH/iRUDmxtNbZYrw9Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:19.266978Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02299","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d63a92f63fddae02d1c082a0c33bff48431e42683eea67fc7e0ae18146b8514","sha256:ba22cd9b30f5a0ab93ee86fdf99bd69ad1221eec65198741996a118c391df366"],"state_sha256":"2df479d9701e3edacad0770edd2b05e9bebcdd7dd920d9e8c2822c141be93117"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qd5biqiIg/tZVgEdTgncKXVLOaS3snFzXPY5IbiibwRT3XWqhFr518kYKy9W3cfoFPsY9Bsn3iUkK+mXpeOMBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:21:53.783671Z","bundle_sha256":"f9c7e9df638e981c51c5faf2e5b601ebbcafa24cdbc2c7748a8e626f01d362e3"}}