{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CWCD4WJLSR7PIDCYHMQBUGSSC3","short_pith_number":"pith:CWCD4WJL","canonical_record":{"source":{"id":"1006.2631","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-14T08:25:46Z","cross_cats_sorted":[],"title_canon_sha256":"53c1de021088e97f75eb1bd57534c6a9bac5c76ea3230c71276e912b6cd0b65a","abstract_canon_sha256":"0307cd88ae11e1be74107ac456a25d542b6f1f959c62884c9c001159c7483a1e"},"schema_version":"1.0"},"canonical_sha256":"15843e592b947ef40c583b201a1a5216c45d6b79d8c3431db4caeca9db77c8a7","source":{"kind":"arxiv","id":"1006.2631","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.2631","created_at":"2026-05-18T04:28:29Z"},{"alias_kind":"arxiv_version","alias_value":"1006.2631v2","created_at":"2026-05-18T04:28:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.2631","created_at":"2026-05-18T04:28:29Z"},{"alias_kind":"pith_short_12","alias_value":"CWCD4WJLSR7P","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CWCD4WJLSR7PIDCY","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CWCD4WJL","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CWCD4WJLSR7PIDCYHMQBUGSSC3","target":"record","payload":{"canonical_record":{"source":{"id":"1006.2631","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-14T08:25:46Z","cross_cats_sorted":[],"title_canon_sha256":"53c1de021088e97f75eb1bd57534c6a9bac5c76ea3230c71276e912b6cd0b65a","abstract_canon_sha256":"0307cd88ae11e1be74107ac456a25d542b6f1f959c62884c9c001159c7483a1e"},"schema_version":"1.0"},"canonical_sha256":"15843e592b947ef40c583b201a1a5216c45d6b79d8c3431db4caeca9db77c8a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:29.850130Z","signature_b64":"rS+yXRk+D2RssQgAI+Ca8RP0GT3hCbO4OdCeufmXdkEptW4tXOpYK8QEUe0ltCxWYZBf/uGUPZ6oR7SyaVXKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15843e592b947ef40c583b201a1a5216c45d6b79d8c3431db4caeca9db77c8a7","last_reissued_at":"2026-05-18T04:28:29.849480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:29.849480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.2631","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-18T04:28:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H04MFKHqnECK9/E5yVxHtMpp1c7Ek/4nH/VCP0i8PE1SsI1v2mXI3nI/Ym3y/B8MYIy/p5wAy0XaGxkKypKzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T20:47:18.816360Z"},"content_sha256":"fd57613656613ce170245e85d09c5f8c65bfd4489de9c19680c491e2eb292f16","schema_version":"1.0","event_id":"sha256:fd57613656613ce170245e85d09c5f8c65bfd4489de9c19680c491e2eb292f16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CWCD4WJLSR7PIDCYHMQBUGSSC3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The competition-common enemy graphs of digraphs satisfying Conditions $C(p)$ and $C'(p)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yoshio Sano","submitted_at":"2010-06-14T08:25:46Z","abstract_excerpt":"S. -R. Kim and F. S. Roberts (2002) introduced the following conditions $C(p)$ and $C'(p)$ for digraphs as generalizations of the condition for digraphs to be semiorders. The condition $C(p)$ (resp. $C'(p)$) is: For any set $S$ of $p$ vertices in $D$, there exists $x \\in S$ such that $N^+_D(x) \\subseteq N^+_D(y)$ (resp. $N^-_D(x) \\subseteq N^-_D(y)$) for all $y \\in S$, where $N^+_D(x)$ (resp. $N^-_D(x)$) is the set of out-neighbors (resp. in-neighbors) of $x$ in $D$. The competition graph of a digraph $D$ is the (simple undirected) graph which has the same vertex set as $D$ and has an edge bet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.2631","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-18T04:28:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wyywQyK1T7TkzCr+IETwXEwkqMe83gCC3dVn7p6TYttoYZhXPK5MRoN/ny54+EyV/wjzrP26iAKbSHQypZBWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T20:47:18.816702Z"},"content_sha256":"cc767afe432fe75a70f2eaae1cc8148c23cd4d376ebc6a9e0ea06a009d385e0b","schema_version":"1.0","event_id":"sha256:cc767afe432fe75a70f2eaae1cc8148c23cd4d376ebc6a9e0ea06a009d385e0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CWCD4WJLSR7PIDCYHMQBUGSSC3/bundle.json","state_url":"https://pith.science/pith/CWCD4WJLSR7PIDCYHMQBUGSSC3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CWCD4WJLSR7PIDCYHMQBUGSSC3/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-07-03T20:47:18Z","links":{"resolver":"https://pith.science/pith/CWCD4WJLSR7PIDCYHMQBUGSSC3","bundle":"https://pith.science/pith/CWCD4WJLSR7PIDCYHMQBUGSSC3/bundle.json","state":"https://pith.science/pith/CWCD4WJLSR7PIDCYHMQBUGSSC3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CWCD4WJLSR7PIDCYHMQBUGSSC3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CWCD4WJLSR7PIDCYHMQBUGSSC3","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":"0307cd88ae11e1be74107ac456a25d542b6f1f959c62884c9c001159c7483a1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-14T08:25:46Z","title_canon_sha256":"53c1de021088e97f75eb1bd57534c6a9bac5c76ea3230c71276e912b6cd0b65a"},"schema_version":"1.0","source":{"id":"1006.2631","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.2631","created_at":"2026-05-18T04:28:29Z"},{"alias_kind":"arxiv_version","alias_value":"1006.2631v2","created_at":"2026-05-18T04:28:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.2631","created_at":"2026-05-18T04:28:29Z"},{"alias_kind":"pith_short_12","alias_value":"CWCD4WJLSR7P","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CWCD4WJLSR7PIDCY","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CWCD4WJL","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:cc767afe432fe75a70f2eaae1cc8148c23cd4d376ebc6a9e0ea06a009d385e0b","target":"graph","created_at":"2026-05-18T04:28:29Z","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":"S. -R. Kim and F. S. Roberts (2002) introduced the following conditions $C(p)$ and $C'(p)$ for digraphs as generalizations of the condition for digraphs to be semiorders. The condition $C(p)$ (resp. $C'(p)$) is: For any set $S$ of $p$ vertices in $D$, there exists $x \\in S$ such that $N^+_D(x) \\subseteq N^+_D(y)$ (resp. $N^-_D(x) \\subseteq N^-_D(y)$) for all $y \\in S$, where $N^+_D(x)$ (resp. $N^-_D(x)$) is the set of out-neighbors (resp. in-neighbors) of $x$ in $D$. The competition graph of a digraph $D$ is the (simple undirected) graph which has the same vertex set as $D$ and has an edge bet","authors_text":"Yoshio Sano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-14T08:25:46Z","title":"The competition-common enemy graphs of digraphs satisfying Conditions $C(p)$ and $C'(p)$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.2631","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:fd57613656613ce170245e85d09c5f8c65bfd4489de9c19680c491e2eb292f16","target":"record","created_at":"2026-05-18T04:28:29Z","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":"0307cd88ae11e1be74107ac456a25d542b6f1f959c62884c9c001159c7483a1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-14T08:25:46Z","title_canon_sha256":"53c1de021088e97f75eb1bd57534c6a9bac5c76ea3230c71276e912b6cd0b65a"},"schema_version":"1.0","source":{"id":"1006.2631","kind":"arxiv","version":2}},"canonical_sha256":"15843e592b947ef40c583b201a1a5216c45d6b79d8c3431db4caeca9db77c8a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15843e592b947ef40c583b201a1a5216c45d6b79d8c3431db4caeca9db77c8a7","first_computed_at":"2026-05-18T04:28:29.849480Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:29.849480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rS+yXRk+D2RssQgAI+Ca8RP0GT3hCbO4OdCeufmXdkEptW4tXOpYK8QEUe0ltCxWYZBf/uGUPZ6oR7SyaVXKCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:29.850130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.2631","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd57613656613ce170245e85d09c5f8c65bfd4489de9c19680c491e2eb292f16","sha256:cc767afe432fe75a70f2eaae1cc8148c23cd4d376ebc6a9e0ea06a009d385e0b"],"state_sha256":"de2348d237cf264428308433b33c966f154a0664a06c5d28d99a6eff0e2ef04b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pd72GlIomyuEsOOWXtYSllZsyhaSUxZkge9MY6pOwVanx+7AatvwduFGLg3al6J9zcbVFCb2YsZqGXLRIzzKAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T20:47:18.818545Z","bundle_sha256":"6096d0b752381355891baeb7d140bb82524d5dea208a1c9bb94cabe37e91fbfd"}}