{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:E4XDXRHDPXZBISPYRIGZHUPISZ","short_pith_number":"pith:E4XDXRHD","schema_version":"1.0","canonical_sha256":"272e3bc4e37df21449f88a0d93d1e89650c85814c40622eac22740341c8ed68e","source":{"kind":"arxiv","id":"1511.07784","version":1},"attestation_state":"computed","paper":{"title":"On the maximum number of spanning copies of an orientation in a tournament","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Raphael Yuster","submitted_at":"2015-11-24T16:20:27Z","abstract_excerpt":"For an orientation $H$ with $n$ vertices, let $T(H)$ denote the maximum possible number of labeled copies of $H$ in an $n$-vertex tournament. It is easily seen that $T(H) \\ge n!/2^{e(H)}$ as the latter is the expected number of such copies in a random tournament. For $n$ odd, let $R(H)$ denote the maximum possible number of labeled copies of $H$ in an $n$-vertex regular tournament. Adler et al. proved that, in fact, for $H=C_n$ the directed Hamilton cycle, $T(C_n) \\ge (e-o(1))n!/2^{n}$ and it was observed by Alon that already $R(C_n) \\ge (e-o(1))n!/2^{n}$. Similar results hold for the directed"},"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":"1511.07784","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-24T16:20:27Z","cross_cats_sorted":[],"title_canon_sha256":"f8a64ab59a323a5564abbc6ef3709e7494ea0f39b55069e9724a33aaf9b1f34c","abstract_canon_sha256":"ecddbb5a441667fc3f923178a917ccf14bebdacf38cff39c62fea637cfae3953"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:03.628060Z","signature_b64":"Mc0Yg3Jakp0De8/8cwdN/0YxznQT8FLPM4ToPW/ZgnQ/1PpoyPjsn8Qby17HnMOIIR9PTLnFHKrShssNUAo8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"272e3bc4e37df21449f88a0d93d1e89650c85814c40622eac22740341c8ed68e","last_reissued_at":"2026-05-18T01:26:03.627240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:03.627240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximum number of spanning copies of an orientation in a tournament","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Raphael Yuster","submitted_at":"2015-11-24T16:20:27Z","abstract_excerpt":"For an orientation $H$ with $n$ vertices, let $T(H)$ denote the maximum possible number of labeled copies of $H$ in an $n$-vertex tournament. It is easily seen that $T(H) \\ge n!/2^{e(H)}$ as the latter is the expected number of such copies in a random tournament. For $n$ odd, let $R(H)$ denote the maximum possible number of labeled copies of $H$ in an $n$-vertex regular tournament. Adler et al. proved that, in fact, for $H=C_n$ the directed Hamilton cycle, $T(C_n) \\ge (e-o(1))n!/2^{n}$ and it was observed by Alon that already $R(C_n) \\ge (e-o(1))n!/2^{n}$. Similar results hold for the directed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07784","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":"1511.07784","created_at":"2026-05-18T01:26:03.627460+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07784v1","created_at":"2026-05-18T01:26:03.627460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07784","created_at":"2026-05-18T01:26:03.627460+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4XDXRHDPXZB","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4XDXRHDPXZBISPY","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4XDXRHD","created_at":"2026-05-18T12:29:17.054201+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/E4XDXRHDPXZBISPYRIGZHUPISZ","json":"https://pith.science/pith/E4XDXRHDPXZBISPYRIGZHUPISZ.json","graph_json":"https://pith.science/api/pith-number/E4XDXRHDPXZBISPYRIGZHUPISZ/graph.json","events_json":"https://pith.science/api/pith-number/E4XDXRHDPXZBISPYRIGZHUPISZ/events.json","paper":"https://pith.science/paper/E4XDXRHD"},"agent_actions":{"view_html":"https://pith.science/pith/E4XDXRHDPXZBISPYRIGZHUPISZ","download_json":"https://pith.science/pith/E4XDXRHDPXZBISPYRIGZHUPISZ.json","view_paper":"https://pith.science/paper/E4XDXRHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07784&json=true","fetch_graph":"https://pith.science/api/pith-number/E4XDXRHDPXZBISPYRIGZHUPISZ/graph.json","fetch_events":"https://pith.science/api/pith-number/E4XDXRHDPXZBISPYRIGZHUPISZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4XDXRHDPXZBISPYRIGZHUPISZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4XDXRHDPXZBISPYRIGZHUPISZ/action/storage_attestation","attest_author":"https://pith.science/pith/E4XDXRHDPXZBISPYRIGZHUPISZ/action/author_attestation","sign_citation":"https://pith.science/pith/E4XDXRHDPXZBISPYRIGZHUPISZ/action/citation_signature","submit_replication":"https://pith.science/pith/E4XDXRHDPXZBISPYRIGZHUPISZ/action/replication_record"}},"created_at":"2026-05-18T01:26:03.627460+00:00","updated_at":"2026-05-18T01:26:03.627460+00:00"}