{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YPVZ5ESMO5WXSKK3722CCMCI7X","short_pith_number":"pith:YPVZ5ESM","canonical_record":{"source":{"id":"1611.01901","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T06:16:11Z","cross_cats_sorted":[],"title_canon_sha256":"78fa8ca75cf7c1a1d371ba2e553b23c6497d508ed92a34a068e98efd1d448566","abstract_canon_sha256":"17556ed7dd0a78c9291e038b7f48f61f97869b6f867c7bf8ce2d1adcaad515a4"},"schema_version":"1.0"},"canonical_sha256":"c3eb9e924c776d79295bfeb4213048fdd4b56fb0fa69c2fd877b4a8ccdd986d4","source":{"kind":"arxiv","id":"1611.01901","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01901","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01901v2","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01901","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"pith_short_12","alias_value":"YPVZ5ESMO5WX","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YPVZ5ESMO5WXSKK3","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YPVZ5ESM","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YPVZ5ESMO5WXSKK3722CCMCI7X","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01901","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T06:16:11Z","cross_cats_sorted":[],"title_canon_sha256":"78fa8ca75cf7c1a1d371ba2e553b23c6497d508ed92a34a068e98efd1d448566","abstract_canon_sha256":"17556ed7dd0a78c9291e038b7f48f61f97869b6f867c7bf8ce2d1adcaad515a4"},"schema_version":"1.0"},"canonical_sha256":"c3eb9e924c776d79295bfeb4213048fdd4b56fb0fa69c2fd877b4a8ccdd986d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:41.457915Z","signature_b64":"U4V4c5H+6GFc87NYFjoyzWv9I1TigpyPY/c/Z7pFzVYL9gezF957i+sv6Abyv4FfLFBqyf1KpUmMgBBHQzRyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3eb9e924c776d79295bfeb4213048fdd4b56fb0fa69c2fd877b4a8ccdd986d4","last_reissued_at":"2026-05-18T00:59:41.457329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:41.457329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01901","source_version":2,"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:59:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5wIMm3a1sCpq29yBuvDbzXbBCKdaqI8dcfeq5mLasQ/7TDpN8cJ9eG/t942Nfo+NpVW2+z4UrzPre8z1dEapCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:54:15.361475Z"},"content_sha256":"db9128d8d9be8bbc501172ef7fb814c5e4cdd07cae5a193883a09b53b47454f8","schema_version":"1.0","event_id":"sha256:db9128d8d9be8bbc501172ef7fb814c5e4cdd07cae5a193883a09b53b47454f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YPVZ5ESMO5WXSKK3722CCMCI7X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On $(1,2)$-step competition graphs of bipartite tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jihoon Choi, So Jung Lee, Soogang Eoh, Suh-Ryung Kim","submitted_at":"2016-11-07T06:16:11Z","abstract_excerpt":"In this paper, we study $(1,2)$-step competition graphs of bipartite tournaments. A bipartite tournament means an orientation of a complete bipartite graph. We show that the $(1,2)$-step competition graph of a bipartite tournament has at most one non-trivial component or consists of exactly two complete components of size at least three and, especially in the former, the diameter of the nontrivial component is at most three if it exists. Based on this result, we show that, among the connected non-complete graphs which are triangle-free or the cycles of which are edge-disjoint, $K_{1,4}$ is the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01901","kind":"arxiv","version":2},"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:59:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UZJHaZEectBbqt18Dty+7NS9ClOWWh1YH6aHYbFdlblKcCv1pvj3HC96G8Xi3HbOodSjjoc5elfNPYd9l/XaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:54:15.361821Z"},"content_sha256":"d4a35ff1f575cb90050314afaf339b1319adc58492c0a82d2253359458742e2a","schema_version":"1.0","event_id":"sha256:d4a35ff1f575cb90050314afaf339b1319adc58492c0a82d2253359458742e2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YPVZ5ESMO5WXSKK3722CCMCI7X/bundle.json","state_url":"https://pith.science/pith/YPVZ5ESMO5WXSKK3722CCMCI7X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YPVZ5ESMO5WXSKK3722CCMCI7X/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-01T06:54:15Z","links":{"resolver":"https://pith.science/pith/YPVZ5ESMO5WXSKK3722CCMCI7X","bundle":"https://pith.science/pith/YPVZ5ESMO5WXSKK3722CCMCI7X/bundle.json","state":"https://pith.science/pith/YPVZ5ESMO5WXSKK3722CCMCI7X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YPVZ5ESMO5WXSKK3722CCMCI7X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YPVZ5ESMO5WXSKK3722CCMCI7X","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":"17556ed7dd0a78c9291e038b7f48f61f97869b6f867c7bf8ce2d1adcaad515a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T06:16:11Z","title_canon_sha256":"78fa8ca75cf7c1a1d371ba2e553b23c6497d508ed92a34a068e98efd1d448566"},"schema_version":"1.0","source":{"id":"1611.01901","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01901","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01901v2","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01901","created_at":"2026-05-18T00:59:41Z"},{"alias_kind":"pith_short_12","alias_value":"YPVZ5ESMO5WX","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YPVZ5ESMO5WXSKK3","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YPVZ5ESM","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:d4a35ff1f575cb90050314afaf339b1319adc58492c0a82d2253359458742e2a","target":"graph","created_at":"2026-05-18T00:59:41Z","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":"In this paper, we study $(1,2)$-step competition graphs of bipartite tournaments. A bipartite tournament means an orientation of a complete bipartite graph. We show that the $(1,2)$-step competition graph of a bipartite tournament has at most one non-trivial component or consists of exactly two complete components of size at least three and, especially in the former, the diameter of the nontrivial component is at most three if it exists. Based on this result, we show that, among the connected non-complete graphs which are triangle-free or the cycles of which are edge-disjoint, $K_{1,4}$ is the","authors_text":"Jihoon Choi, So Jung Lee, Soogang Eoh, Suh-Ryung Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T06:16:11Z","title":"On $(1,2)$-step competition graphs of bipartite tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01901","kind":"arxiv","version":2},"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:db9128d8d9be8bbc501172ef7fb814c5e4cdd07cae5a193883a09b53b47454f8","target":"record","created_at":"2026-05-18T00:59:41Z","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":"17556ed7dd0a78c9291e038b7f48f61f97869b6f867c7bf8ce2d1adcaad515a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T06:16:11Z","title_canon_sha256":"78fa8ca75cf7c1a1d371ba2e553b23c6497d508ed92a34a068e98efd1d448566"},"schema_version":"1.0","source":{"id":"1611.01901","kind":"arxiv","version":2}},"canonical_sha256":"c3eb9e924c776d79295bfeb4213048fdd4b56fb0fa69c2fd877b4a8ccdd986d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3eb9e924c776d79295bfeb4213048fdd4b56fb0fa69c2fd877b4a8ccdd986d4","first_computed_at":"2026-05-18T00:59:41.457329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:41.457329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U4V4c5H+6GFc87NYFjoyzWv9I1TigpyPY/c/Z7pFzVYL9gezF957i+sv6Abyv4FfLFBqyf1KpUmMgBBHQzRyAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:41.457915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01901","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db9128d8d9be8bbc501172ef7fb814c5e4cdd07cae5a193883a09b53b47454f8","sha256:d4a35ff1f575cb90050314afaf339b1319adc58492c0a82d2253359458742e2a"],"state_sha256":"a474e15df900adffda9331f92407d0d5de485fcba0392c29673f78e4f6ac6cec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S8jZB9/GTOm6LN7pG4Rodmp7YwFbNML4kSjXdXYTkAkQq9g9JI5mbuo5i1k0+mjZiwx2FU8GGSuNqo+vt1csCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:54:15.363801Z","bundle_sha256":"872cca20ca1a0935abbca70f6ac78287b035c57d1e1d57cb87546fe6d3df4075"}}