{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DOV6MUGFZ5MK3C44JZZMLFCZKV","short_pith_number":"pith:DOV6MUGF","schema_version":"1.0","canonical_sha256":"1babe650c5cf58ad8b9c4e72c594595551539796abddd466cf5e0910fa5a8d85","source":{"kind":"arxiv","id":"1712.04299","version":1},"attestation_state":"computed","paper":{"title":"Borel selector for hypergraphons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Jan Grebik","submitted_at":"2017-12-12T14:15:06Z","abstract_excerpt":"We show that there is a Borel way of choosing a representative of a $k$-uniform hypergraphon. This extends the result of Orbanz and Szegedy where this was shown for graphons."},"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":"1712.04299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-12-12T14:15:06Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"03926fefa6c010faf46f0d0d79c34dc5681506d8c3fc053b45616ef37f582ee6","abstract_canon_sha256":"af67fa1d6fe1459ef39477a4d3f7984894b0e5c899a545bdc5df38cfbec7046f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:08.475691Z","signature_b64":"udUOY2EZ+yZqtAR9TWax/HhGo/2d1y5HruNnxUPtusYz2qw5s1GrwEEThPhCreo5NDnfHWCrWdGpB0LQgOzMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1babe650c5cf58ad8b9c4e72c594595551539796abddd466cf5e0910fa5a8d85","last_reissued_at":"2026-05-18T00:28:08.475083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:08.475083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Borel selector for hypergraphons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Jan Grebik","submitted_at":"2017-12-12T14:15:06Z","abstract_excerpt":"We show that there is a Borel way of choosing a representative of a $k$-uniform hypergraphon. This extends the result of Orbanz and Szegedy where this was shown for graphons."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04299","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":"1712.04299","created_at":"2026-05-18T00:28:08.475171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.04299v1","created_at":"2026-05-18T00:28:08.475171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04299","created_at":"2026-05-18T00:28:08.475171+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOV6MUGFZ5MK","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOV6MUGFZ5MK3C44","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOV6MUGF","created_at":"2026-05-18T12:31:12.930513+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/DOV6MUGFZ5MK3C44JZZMLFCZKV","json":"https://pith.science/pith/DOV6MUGFZ5MK3C44JZZMLFCZKV.json","graph_json":"https://pith.science/api/pith-number/DOV6MUGFZ5MK3C44JZZMLFCZKV/graph.json","events_json":"https://pith.science/api/pith-number/DOV6MUGFZ5MK3C44JZZMLFCZKV/events.json","paper":"https://pith.science/paper/DOV6MUGF"},"agent_actions":{"view_html":"https://pith.science/pith/DOV6MUGFZ5MK3C44JZZMLFCZKV","download_json":"https://pith.science/pith/DOV6MUGFZ5MK3C44JZZMLFCZKV.json","view_paper":"https://pith.science/paper/DOV6MUGF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.04299&json=true","fetch_graph":"https://pith.science/api/pith-number/DOV6MUGFZ5MK3C44JZZMLFCZKV/graph.json","fetch_events":"https://pith.science/api/pith-number/DOV6MUGFZ5MK3C44JZZMLFCZKV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOV6MUGFZ5MK3C44JZZMLFCZKV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOV6MUGFZ5MK3C44JZZMLFCZKV/action/storage_attestation","attest_author":"https://pith.science/pith/DOV6MUGFZ5MK3C44JZZMLFCZKV/action/author_attestation","sign_citation":"https://pith.science/pith/DOV6MUGFZ5MK3C44JZZMLFCZKV/action/citation_signature","submit_replication":"https://pith.science/pith/DOV6MUGFZ5MK3C44JZZMLFCZKV/action/replication_record"}},"created_at":"2026-05-18T00:28:08.475171+00:00","updated_at":"2026-05-18T00:28:08.475171+00:00"}