{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OE5FPNIQRX3LUFEE2E3VXER4XJ","short_pith_number":"pith:OE5FPNIQ","canonical_record":{"source":{"id":"1709.07509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-21T20:27:10Z","cross_cats_sorted":[],"title_canon_sha256":"549992447139784d8cc602d09e2ceac42a7611eedfd17377f4b41187cc3eaa03","abstract_canon_sha256":"c6cea5d5934f1475f4538696862aa43837193fe9c7ad66d9876d2949ae2c63c0"},"schema_version":"1.0"},"canonical_sha256":"713a57b5108df6ba1484d1375b923cba73f5ce2e119d4d0b4baf9db45b3a0450","source":{"kind":"arxiv","id":"1709.07509","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07509","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07509v1","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07509","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"pith_short_12","alias_value":"OE5FPNIQRX3L","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OE5FPNIQRX3LUFEE","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OE5FPNIQ","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OE5FPNIQRX3LUFEE2E3VXER4XJ","target":"record","payload":{"canonical_record":{"source":{"id":"1709.07509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-21T20:27:10Z","cross_cats_sorted":[],"title_canon_sha256":"549992447139784d8cc602d09e2ceac42a7611eedfd17377f4b41187cc3eaa03","abstract_canon_sha256":"c6cea5d5934f1475f4538696862aa43837193fe9c7ad66d9876d2949ae2c63c0"},"schema_version":"1.0"},"canonical_sha256":"713a57b5108df6ba1484d1375b923cba73f5ce2e119d4d0b4baf9db45b3a0450","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:32.979434Z","signature_b64":"CKb2ypr+myry+AqhjERESXaTtPUHWIZSvRJYCoSzpiEpOiNrTIEUO3zyYkIKx+2F9iHViqrDEvqHsQjfjEImBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"713a57b5108df6ba1484d1375b923cba73f5ce2e119d4d0b4baf9db45b3a0450","last_reissued_at":"2026-05-18T00:34:32.979059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:32.979059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.07509","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-18T00:34:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c7TvT8oiU545JNXuiqz3s934Lhvp/kr5nsJNzQj2WLuCYz3agqu9M8GkGhGoqD8R8Y2DBwb4HbM81pAUBePMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:05:31.492831Z"},"content_sha256":"dad8ef419d43bad11dc4f1a76d37f59e0264e2410a2ae78b7549edc2659140ea","schema_version":"1.0","event_id":"sha256:dad8ef419d43bad11dc4f1a76d37f59e0264e2410a2ae78b7549edc2659140ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OE5FPNIQRX3LUFEE2E3VXER4XJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum oriented forcing number for complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ryan Pepper, Yair Caro","submitted_at":"2017-09-21T20:27:10Z","abstract_excerpt":"The maximum oriented $k$-forcing number of a simple graph $G$, written $\\MOF_k(G)$, is the maximum directed $k$-forcing number among all orientations of $G$. This invariant was recently introduced by Caro, Davila and Pepper in [CaroDavilaPepper], and in the current paper we study the special case where $G$ is the complete graph with order $n$, denoted $K_n$. While $\\MOF_k(G)$ is an invariant for the underlying simple graph $G$, $\\MOF_k(K_n)$ can also be interpreted as an interesting property for tournaments. Our main results further focus on the case when $k=1$. These include a lower bound on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07509","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-18T00:34:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ixrSW5hWhaY4z5SO838h9FrjQHt8a2lNs2WVhzCzbeQsnT6168VmEz6nlM2i10e+5g+OwNRVHxN8xqQN6kMLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:05:31.493470Z"},"content_sha256":"f51d4daba40a904e8198e8f0d9c321a43bdda85980b9710a74ddc257e1a399a2","schema_version":"1.0","event_id":"sha256:f51d4daba40a904e8198e8f0d9c321a43bdda85980b9710a74ddc257e1a399a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OE5FPNIQRX3LUFEE2E3VXER4XJ/bundle.json","state_url":"https://pith.science/pith/OE5FPNIQRX3LUFEE2E3VXER4XJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OE5FPNIQRX3LUFEE2E3VXER4XJ/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-06-09T07:05:31Z","links":{"resolver":"https://pith.science/pith/OE5FPNIQRX3LUFEE2E3VXER4XJ","bundle":"https://pith.science/pith/OE5FPNIQRX3LUFEE2E3VXER4XJ/bundle.json","state":"https://pith.science/pith/OE5FPNIQRX3LUFEE2E3VXER4XJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OE5FPNIQRX3LUFEE2E3VXER4XJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OE5FPNIQRX3LUFEE2E3VXER4XJ","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":"c6cea5d5934f1475f4538696862aa43837193fe9c7ad66d9876d2949ae2c63c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-21T20:27:10Z","title_canon_sha256":"549992447139784d8cc602d09e2ceac42a7611eedfd17377f4b41187cc3eaa03"},"schema_version":"1.0","source":{"id":"1709.07509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07509","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07509v1","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07509","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"pith_short_12","alias_value":"OE5FPNIQRX3L","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OE5FPNIQRX3LUFEE","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OE5FPNIQ","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:f51d4daba40a904e8198e8f0d9c321a43bdda85980b9710a74ddc257e1a399a2","target":"graph","created_at":"2026-05-18T00:34:32Z","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":"The maximum oriented $k$-forcing number of a simple graph $G$, written $\\MOF_k(G)$, is the maximum directed $k$-forcing number among all orientations of $G$. This invariant was recently introduced by Caro, Davila and Pepper in [CaroDavilaPepper], and in the current paper we study the special case where $G$ is the complete graph with order $n$, denoted $K_n$. While $\\MOF_k(G)$ is an invariant for the underlying simple graph $G$, $\\MOF_k(K_n)$ can also be interpreted as an interesting property for tournaments. Our main results further focus on the case when $k=1$. These include a lower bound on ","authors_text":"Ryan Pepper, Yair Caro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-21T20:27:10Z","title":"Maximum oriented forcing number for complete graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07509","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:dad8ef419d43bad11dc4f1a76d37f59e0264e2410a2ae78b7549edc2659140ea","target":"record","created_at":"2026-05-18T00:34:32Z","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":"c6cea5d5934f1475f4538696862aa43837193fe9c7ad66d9876d2949ae2c63c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-21T20:27:10Z","title_canon_sha256":"549992447139784d8cc602d09e2ceac42a7611eedfd17377f4b41187cc3eaa03"},"schema_version":"1.0","source":{"id":"1709.07509","kind":"arxiv","version":1}},"canonical_sha256":"713a57b5108df6ba1484d1375b923cba73f5ce2e119d4d0b4baf9db45b3a0450","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"713a57b5108df6ba1484d1375b923cba73f5ce2e119d4d0b4baf9db45b3a0450","first_computed_at":"2026-05-18T00:34:32.979059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:32.979059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CKb2ypr+myry+AqhjERESXaTtPUHWIZSvRJYCoSzpiEpOiNrTIEUO3zyYkIKx+2F9iHViqrDEvqHsQjfjEImBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:32.979434Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.07509","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dad8ef419d43bad11dc4f1a76d37f59e0264e2410a2ae78b7549edc2659140ea","sha256:f51d4daba40a904e8198e8f0d9c321a43bdda85980b9710a74ddc257e1a399a2"],"state_sha256":"e81e10a75f3e0c1c02f1378f3cf199b7c5a4c77c244569029f0ff5916040c309"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zd6KQ2UhN9OUrZjPjwoaQswwtsDYKPWa4IoHYiwDHGF/Wph+m7lUNSm8H6q4qGUCcUVzZtWB2g1xeTnfw82NAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:05:31.496991Z","bundle_sha256":"b3f6d557e04e961901f65e6ba4ecf26d131eb7433b85cd614ecd16c1107c03cd"}}