{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:E4XDXRHDPXZBISPYRIGZHUPISZ","short_pith_number":"pith:E4XDXRHD","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"},"canonical_sha256":"272e3bc4e37df21449f88a0d93d1e89650c85814c40622eac22740341c8ed68e","source":{"kind":"arxiv","id":"1511.07784","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07784","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07784v1","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07784","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"E4XDXRHDPXZB","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E4XDXRHDPXZBISPY","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E4XDXRHD","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:E4XDXRHDPXZBISPYRIGZHUPISZ","target":"record","payload":{"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"},"canonical_sha256":"272e3bc4e37df21449f88a0d93d1e89650c85814c40622eac22740341c8ed68e","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"},"source_kind":"arxiv","source_id":"1511.07784","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OvkXX48Tf4tfUd0bIBKBjz1d9oHxz0JoU7jlfbdGd91QjRCY8gqxF0X7oHMN2edeYPT2UZJCUCj6+SFoy2FZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T23:49:09.093562Z"},"content_sha256":"a1fb20cadbcf5deb8f32b0478e0e83ebb45b8f43a9892cb8408aec9aa1f707c4","schema_version":"1.0","event_id":"sha256:a1fb20cadbcf5deb8f32b0478e0e83ebb45b8f43a9892cb8408aec9aa1f707c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:E4XDXRHDPXZBISPYRIGZHUPISZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WHL9HJG0mH9Qa/sPA3buduwF7zC0NlVKViAyiVPAbZI4PZMYRrXoOKB8lsRD69mj0c0P/my41Wh8D7fyzoY9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T23:49:09.094237Z"},"content_sha256":"c54a4beb09e30b50acedbd8e9ff79c7003e235d28ad73446f1fb7f0f7be71b2f","schema_version":"1.0","event_id":"sha256:c54a4beb09e30b50acedbd8e9ff79c7003e235d28ad73446f1fb7f0f7be71b2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E4XDXRHDPXZBISPYRIGZHUPISZ/bundle.json","state_url":"https://pith.science/pith/E4XDXRHDPXZBISPYRIGZHUPISZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E4XDXRHDPXZBISPYRIGZHUPISZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-18T23:49:09Z","links":{"resolver":"https://pith.science/pith/E4XDXRHDPXZBISPYRIGZHUPISZ","bundle":"https://pith.science/pith/E4XDXRHDPXZBISPYRIGZHUPISZ/bundle.json","state":"https://pith.science/pith/E4XDXRHDPXZBISPYRIGZHUPISZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E4XDXRHDPXZBISPYRIGZHUPISZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:E4XDXRHDPXZBISPYRIGZHUPISZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ecddbb5a441667fc3f923178a917ccf14bebdacf38cff39c62fea637cfae3953","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-24T16:20:27Z","title_canon_sha256":"f8a64ab59a323a5564abbc6ef3709e7494ea0f39b55069e9724a33aaf9b1f34c"},"schema_version":"1.0","source":{"id":"1511.07784","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07784","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07784v1","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07784","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"E4XDXRHDPXZB","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E4XDXRHDPXZBISPY","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E4XDXRHD","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:c54a4beb09e30b50acedbd8e9ff79c7003e235d28ad73446f1fb7f0f7be71b2f","target":"graph","created_at":"2026-05-18T01:26:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Raphael Yuster","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-24T16:20:27Z","title":"On the maximum number of spanning copies of an orientation in a tournament"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07784","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a1fb20cadbcf5deb8f32b0478e0e83ebb45b8f43a9892cb8408aec9aa1f707c4","target":"record","created_at":"2026-05-18T01:26:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ecddbb5a441667fc3f923178a917ccf14bebdacf38cff39c62fea637cfae3953","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-24T16:20:27Z","title_canon_sha256":"f8a64ab59a323a5564abbc6ef3709e7494ea0f39b55069e9724a33aaf9b1f34c"},"schema_version":"1.0","source":{"id":"1511.07784","kind":"arxiv","version":1}},"canonical_sha256":"272e3bc4e37df21449f88a0d93d1e89650c85814c40622eac22740341c8ed68e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"272e3bc4e37df21449f88a0d93d1e89650c85814c40622eac22740341c8ed68e","first_computed_at":"2026-05-18T01:26:03.627240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:03.627240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mc0Yg3Jakp0De8/8cwdN/0YxznQT8FLPM4ToPW/ZgnQ/1PpoyPjsn8Qby17HnMOIIR9PTLnFHKrShssNUAo8Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:03.628060Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07784","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1fb20cadbcf5deb8f32b0478e0e83ebb45b8f43a9892cb8408aec9aa1f707c4","sha256:c54a4beb09e30b50acedbd8e9ff79c7003e235d28ad73446f1fb7f0f7be71b2f"],"state_sha256":"a6feea954955067f641cdfb2de4f133be52b33572e319a4d0b02ef01b7ce6712"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4H5+mNG3Q5RwJFyIm1byDquw9PTF93E+0/cEQFq6qz2kf9MkjqUJKKghrexCPRquOQiq9GvjmMflJzXej/zeAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T23:49:09.096387Z","bundle_sha256":"a908e7960100baf76c5c475f7f74cbd531262741c17fc99c6643bc8f3d8a9137"}}