{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GU522QAWLXLL3GNTDCTZTIY4OJ","short_pith_number":"pith:GU522QAW","schema_version":"1.0","canonical_sha256":"353bad40165dd6bd99b318a799a31c726a4ca969b7b99a22bb758e0e3ee99da4","source":{"kind":"arxiv","id":"1606.02081","version":1},"attestation_state":"computed","paper":{"title":"Eplett's theorem for self-converse generalised tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Erik Th\\\"ornblad","submitted_at":"2016-06-07T10:15:51Z","abstract_excerpt":"The converse of a tournament is obtained by reversing all arcs. If a tournament is isomorphic to its converse, it is called self--converse. Eplett provided a necessary and sufficient condition for a sequence of integers to be realisable as the score sequence of a self--converse tournament. In this paper we extend this result to generalised tournaments."},"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":"1606.02081","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-07T10:15:51Z","cross_cats_sorted":[],"title_canon_sha256":"a31cfebd0cef4205183d649f0bfdd2582cf21223953c623dbc0645a35bfb86d6","abstract_canon_sha256":"d9db41f59a89d184ace477362e4d85cf31a94fa440fa59ba0424c01fb4095c2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:44.652499Z","signature_b64":"hZnZHRs22lqXH1cxgBQTyXKIBx+CUG1ZmK4PPMk7lZVUhJBc+Vp575Ld7akt/r0iN1LhGVCWle1jjBWeFPT5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"353bad40165dd6bd99b318a799a31c726a4ca969b7b99a22bb758e0e3ee99da4","last_reissued_at":"2026-05-18T01:12:44.652158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:44.652158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Eplett's theorem for self-converse generalised tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Erik Th\\\"ornblad","submitted_at":"2016-06-07T10:15:51Z","abstract_excerpt":"The converse of a tournament is obtained by reversing all arcs. If a tournament is isomorphic to its converse, it is called self--converse. Eplett provided a necessary and sufficient condition for a sequence of integers to be realisable as the score sequence of a self--converse tournament. In this paper we extend this result to generalised tournaments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02081","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":"1606.02081","created_at":"2026-05-18T01:12:44.652209+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.02081v1","created_at":"2026-05-18T01:12:44.652209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02081","created_at":"2026-05-18T01:12:44.652209+00:00"},{"alias_kind":"pith_short_12","alias_value":"GU522QAWLXLL","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GU522QAWLXLL3GNT","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GU522QAW","created_at":"2026-05-18T12:30:19.053100+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/GU522QAWLXLL3GNTDCTZTIY4OJ","json":"https://pith.science/pith/GU522QAWLXLL3GNTDCTZTIY4OJ.json","graph_json":"https://pith.science/api/pith-number/GU522QAWLXLL3GNTDCTZTIY4OJ/graph.json","events_json":"https://pith.science/api/pith-number/GU522QAWLXLL3GNTDCTZTIY4OJ/events.json","paper":"https://pith.science/paper/GU522QAW"},"agent_actions":{"view_html":"https://pith.science/pith/GU522QAWLXLL3GNTDCTZTIY4OJ","download_json":"https://pith.science/pith/GU522QAWLXLL3GNTDCTZTIY4OJ.json","view_paper":"https://pith.science/paper/GU522QAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.02081&json=true","fetch_graph":"https://pith.science/api/pith-number/GU522QAWLXLL3GNTDCTZTIY4OJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GU522QAWLXLL3GNTDCTZTIY4OJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GU522QAWLXLL3GNTDCTZTIY4OJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GU522QAWLXLL3GNTDCTZTIY4OJ/action/storage_attestation","attest_author":"https://pith.science/pith/GU522QAWLXLL3GNTDCTZTIY4OJ/action/author_attestation","sign_citation":"https://pith.science/pith/GU522QAWLXLL3GNTDCTZTIY4OJ/action/citation_signature","submit_replication":"https://pith.science/pith/GU522QAWLXLL3GNTDCTZTIY4OJ/action/replication_record"}},"created_at":"2026-05-18T01:12:44.652209+00:00","updated_at":"2026-05-18T01:12:44.652209+00:00"}