{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:J6LPODZYI2LZF7JAVLLVR54CBC","short_pith_number":"pith:J6LPODZY","schema_version":"1.0","canonical_sha256":"4f96f70f38469792fd20aad758f782089b83a9841cfb9d37a7d575555e6154bb","source":{"kind":"arxiv","id":"1602.02299","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.02299","created_at":"2026-05-17T23:52:19.266420+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02299v2","created_at":"2026-05-17T23:52:19.266420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02299","created_at":"2026-05-17T23:52:19.266420+00:00"},{"alias_kind":"pith_short_12","alias_value":"J6LPODZYI2LZ","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"J6LPODZYI2LZF7JA","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"J6LPODZY","created_at":"2026-05-18T12:30:22.444734+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/J6LPODZYI2LZF7JAVLLVR54CBC","json":"https://pith.science/pith/J6LPODZYI2LZF7JAVLLVR54CBC.json","graph_json":"https://pith.science/api/pith-number/J6LPODZYI2LZF7JAVLLVR54CBC/graph.json","events_json":"https://pith.science/api/pith-number/J6LPODZYI2LZF7JAVLLVR54CBC/events.json","paper":"https://pith.science/paper/J6LPODZY"},"agent_actions":{"view_html":"https://pith.science/pith/J6LPODZYI2LZF7JAVLLVR54CBC","download_json":"https://pith.science/pith/J6LPODZYI2LZF7JAVLLVR54CBC.json","view_paper":"https://pith.science/paper/J6LPODZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02299&json=true","fetch_graph":"https://pith.science/api/pith-number/J6LPODZYI2LZF7JAVLLVR54CBC/graph.json","fetch_events":"https://pith.science/api/pith-number/J6LPODZYI2LZF7JAVLLVR54CBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J6LPODZYI2LZF7JAVLLVR54CBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J6LPODZYI2LZF7JAVLLVR54CBC/action/storage_attestation","attest_author":"https://pith.science/pith/J6LPODZYI2LZF7JAVLLVR54CBC/action/author_attestation","sign_citation":"https://pith.science/pith/J6LPODZYI2LZF7JAVLLVR54CBC/action/citation_signature","submit_replication":"https://pith.science/pith/J6LPODZYI2LZF7JAVLLVR54CBC/action/replication_record"}},"created_at":"2026-05-17T23:52:19.266420+00:00","updated_at":"2026-05-17T23:52:19.266420+00:00"}