{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KJZZON5MXJYLKTTOC6CK6UJMLL","short_pith_number":"pith:KJZZON5M","schema_version":"1.0","canonical_sha256":"52739737acba70b54e6e1784af512c5ac32badf9df2af99062f92596191480a6","source":{"kind":"arxiv","id":"1602.08784","version":1},"attestation_state":"computed","paper":{"title":"Counting results for sparse pseudorandom hypergraphs II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anusch Taraz, Guilherme O. Mota, Mathias Schacht, Yoshiharu Kohayakawa","submitted_at":"2016-02-28T23:23:13Z","abstract_excerpt":"We present a variant of a universality result of R\\\"odl [On universality of graphs with uniformly distributed edges, Discrete Math. 59 (1986), no. 1-2, 125-134] for sparse, $3$-uniform hypergraphs contained in strongly jumbled hypergraphs. One of the ingredients of our proof is a counting lemma for fixed hypergraphs in sparse ``pseudorandom'' uniform hypergraphs, which is proved in the companion paper [Counting results for sparse pseudorandom hypergraphs I]."},"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.08784","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-28T23:23:13Z","cross_cats_sorted":[],"title_canon_sha256":"2d13453b9822215cc22d9963059b0c1354a1b8c2fbe2a838f7ba825dab90f6b8","abstract_canon_sha256":"bf68af7886a253e7a60d4f59a0be8738a1013452813fab9fe8a01f389e1cc074"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:45.473282Z","signature_b64":"tlBQK67EZcfAzliQ/4ckROqtTMOLEcjowWWM/47YEJE38UccSdY36BSurYROXdect3A0f2NedRAvUZc3K1xtCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52739737acba70b54e6e1784af512c5ac32badf9df2af99062f92596191480a6","last_reissued_at":"2026-05-18T00:31:45.472630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:45.472630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting results for sparse pseudorandom hypergraphs II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anusch Taraz, Guilherme O. Mota, Mathias Schacht, Yoshiharu Kohayakawa","submitted_at":"2016-02-28T23:23:13Z","abstract_excerpt":"We present a variant of a universality result of R\\\"odl [On universality of graphs with uniformly distributed edges, Discrete Math. 59 (1986), no. 1-2, 125-134] for sparse, $3$-uniform hypergraphs contained in strongly jumbled hypergraphs. One of the ingredients of our proof is a counting lemma for fixed hypergraphs in sparse ``pseudorandom'' uniform hypergraphs, which is proved in the companion paper [Counting results for sparse pseudorandom hypergraphs I]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08784","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.08784","created_at":"2026-05-18T00:31:45.472738+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.08784v1","created_at":"2026-05-18T00:31:45.472738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08784","created_at":"2026-05-18T00:31:45.472738+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJZZON5MXJYL","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJZZON5MXJYLKTTO","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJZZON5M","created_at":"2026-05-18T12:30:25.849896+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/KJZZON5MXJYLKTTOC6CK6UJMLL","json":"https://pith.science/pith/KJZZON5MXJYLKTTOC6CK6UJMLL.json","graph_json":"https://pith.science/api/pith-number/KJZZON5MXJYLKTTOC6CK6UJMLL/graph.json","events_json":"https://pith.science/api/pith-number/KJZZON5MXJYLKTTOC6CK6UJMLL/events.json","paper":"https://pith.science/paper/KJZZON5M"},"agent_actions":{"view_html":"https://pith.science/pith/KJZZON5MXJYLKTTOC6CK6UJMLL","download_json":"https://pith.science/pith/KJZZON5MXJYLKTTOC6CK6UJMLL.json","view_paper":"https://pith.science/paper/KJZZON5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.08784&json=true","fetch_graph":"https://pith.science/api/pith-number/KJZZON5MXJYLKTTOC6CK6UJMLL/graph.json","fetch_events":"https://pith.science/api/pith-number/KJZZON5MXJYLKTTOC6CK6UJMLL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJZZON5MXJYLKTTOC6CK6UJMLL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJZZON5MXJYLKTTOC6CK6UJMLL/action/storage_attestation","attest_author":"https://pith.science/pith/KJZZON5MXJYLKTTOC6CK6UJMLL/action/author_attestation","sign_citation":"https://pith.science/pith/KJZZON5MXJYLKTTOC6CK6UJMLL/action/citation_signature","submit_replication":"https://pith.science/pith/KJZZON5MXJYLKTTOC6CK6UJMLL/action/replication_record"}},"created_at":"2026-05-18T00:31:45.472738+00:00","updated_at":"2026-05-18T00:31:45.472738+00:00"}