{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LTTOQZM4OFDU635FRMUAVIPDWE","short_pith_number":"pith:LTTOQZM4","schema_version":"1.0","canonical_sha256":"5ce6e8659c71474f6fa58b280aa1e3b102aa5c54ed81734fbb9891b359c5f830","source":{"kind":"arxiv","id":"1604.04271","version":1},"attestation_state":"computed","paper":{"title":"Decomposition of tournament limits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Erik Th\\\"ornblad","submitted_at":"2016-04-14T19:37:52Z","abstract_excerpt":"The theory of tournament limits and tournament kernels (often called graphons) is developed by extending common notions for finite tournaments to this setting; in particular we study transitivity and irreducibility of limits and kernels. We prove that each tournament kernel and each tournament limit can be decomposed into a direct sum of irreducible components, with transitive components interlaced. We also show that this decomposition is essentially unique."},"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":"1604.04271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-14T19:37:52Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"2d828dd3f5a7dbf43492f67e7d16683a741ef1d159f982374d4034da323ad50b","abstract_canon_sha256":"c25f2ae7892b854ff482396cbdbb4d3c777849d239dff688ab14908d40c7bef6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:32.599679Z","signature_b64":"5f1uJ6niChIIeqGa2A4Xw3hlb58IA1YPz7je6a3PWS5+tb3tzs7Tigh0DzvRrA5XUs18AYYf4Thr0LqD+Sk9Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ce6e8659c71474f6fa58b280aa1e3b102aa5c54ed81734fbb9891b359c5f830","last_reissued_at":"2026-05-18T00:28:32.599057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:32.599057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposition of tournament limits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Erik Th\\\"ornblad","submitted_at":"2016-04-14T19:37:52Z","abstract_excerpt":"The theory of tournament limits and tournament kernels (often called graphons) is developed by extending common notions for finite tournaments to this setting; in particular we study transitivity and irreducibility of limits and kernels. We prove that each tournament kernel and each tournament limit can be decomposed into a direct sum of irreducible components, with transitive components interlaced. We also show that this decomposition is essentially unique."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04271","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":"1604.04271","created_at":"2026-05-18T00:28:32.599166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04271v1","created_at":"2026-05-18T00:28:32.599166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04271","created_at":"2026-05-18T00:28:32.599166+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTTOQZM4OFDU","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTTOQZM4OFDU635F","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTTOQZM4","created_at":"2026-05-18T12:30:29.479603+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/LTTOQZM4OFDU635FRMUAVIPDWE","json":"https://pith.science/pith/LTTOQZM4OFDU635FRMUAVIPDWE.json","graph_json":"https://pith.science/api/pith-number/LTTOQZM4OFDU635FRMUAVIPDWE/graph.json","events_json":"https://pith.science/api/pith-number/LTTOQZM4OFDU635FRMUAVIPDWE/events.json","paper":"https://pith.science/paper/LTTOQZM4"},"agent_actions":{"view_html":"https://pith.science/pith/LTTOQZM4OFDU635FRMUAVIPDWE","download_json":"https://pith.science/pith/LTTOQZM4OFDU635FRMUAVIPDWE.json","view_paper":"https://pith.science/paper/LTTOQZM4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04271&json=true","fetch_graph":"https://pith.science/api/pith-number/LTTOQZM4OFDU635FRMUAVIPDWE/graph.json","fetch_events":"https://pith.science/api/pith-number/LTTOQZM4OFDU635FRMUAVIPDWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTTOQZM4OFDU635FRMUAVIPDWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTTOQZM4OFDU635FRMUAVIPDWE/action/storage_attestation","attest_author":"https://pith.science/pith/LTTOQZM4OFDU635FRMUAVIPDWE/action/author_attestation","sign_citation":"https://pith.science/pith/LTTOQZM4OFDU635FRMUAVIPDWE/action/citation_signature","submit_replication":"https://pith.science/pith/LTTOQZM4OFDU635FRMUAVIPDWE/action/replication_record"}},"created_at":"2026-05-18T00:28:32.599166+00:00","updated_at":"2026-05-18T00:28:32.599166+00:00"}