{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:L574B2GTIWP3XDHBIKTG3JZIWO","short_pith_number":"pith:L574B2GT","canonical_record":{"source":{"id":"1110.2911","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-13T12:17:37Z","cross_cats_sorted":[],"title_canon_sha256":"66c8725f059ea2519c7dac32720f78692b7512b895d7a8eafebd0e71121ed672","abstract_canon_sha256":"35303b904bc5dae4e0db3246974cf61e87ae17930a6a5e5d3d34d57224d42ce8"},"schema_version":"1.0"},"canonical_sha256":"5f7fc0e8d3459fbb8ce142a66da728b39ffbf7b88c0f71992e56ff28192eb65f","source":{"kind":"arxiv","id":"1110.2911","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2911","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2911v2","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2911","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"pith_short_12","alias_value":"L574B2GTIWP3","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"L574B2GTIWP3XDHB","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"L574B2GT","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:L574B2GTIWP3XDHBIKTG3JZIWO","target":"record","payload":{"canonical_record":{"source":{"id":"1110.2911","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-13T12:17:37Z","cross_cats_sorted":[],"title_canon_sha256":"66c8725f059ea2519c7dac32720f78692b7512b895d7a8eafebd0e71121ed672","abstract_canon_sha256":"35303b904bc5dae4e0db3246974cf61e87ae17930a6a5e5d3d34d57224d42ce8"},"schema_version":"1.0"},"canonical_sha256":"5f7fc0e8d3459fbb8ce142a66da728b39ffbf7b88c0f71992e56ff28192eb65f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:10.402626Z","signature_b64":"cXgnP/8Tgnhc5C36YZguW8UXOsOi48VOWvwV7Cdz3kZ92Nuy+pzRsvhiCWR7Vzw/6P7QM4qWxj/OAMtZFLurBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f7fc0e8d3459fbb8ce142a66da728b39ffbf7b88c0f71992e56ff28192eb65f","last_reissued_at":"2026-05-18T03:49:10.402176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:10.402176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.2911","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-18T03:49:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5/BUeLyjFP98IlkZuHx658E7W3f0WK8A+WlXGRnfGdQpi+2P6EK6zyo7iHnqDZDnr/Q+alFxdfp2lWAGxYAJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T19:50:57.201877Z"},"content_sha256":"371526103e80834f3dd189f600a1a7ef21434cc812a38d9704a357c3c01b20c9","schema_version":"1.0","event_id":"sha256:371526103e80834f3dd189f600a1a7ef21434cc812a38d9704a357c3c01b20c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:L574B2GTIWP3XDHBIKTG3JZIWO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The competition number of a generalized line graph is at most two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Yoshio Sano","submitted_at":"2011-10-13T12:17:37Z","abstract_excerpt":"In 1982, Opsut showed that the competition number of a line graph is at most two and gave a necessary and sufficient condition for the competition number of a line graph being one. In this note, we generalize this result to the competition numbers of generalized line graphs, that is, we show that the competition number of a generalized line graph is at most two, and give necessary conditions and sufficient conditions for the competition number of a generalized line graph being one."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2911","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-18T03:49:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"09MSXEGGsjPIlG1fDKnLcjEosSmPA8T891BQU47zOtO/WKr3ppPOp9bgaz8KJuMDvYOeqlV1zRqJjTfyXWrhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T19:50:57.202214Z"},"content_sha256":"710474d2de5a9d8ca2a7c8f358acd1137eb9993c6dbaf60a7906552b4a265b95","schema_version":"1.0","event_id":"sha256:710474d2de5a9d8ca2a7c8f358acd1137eb9993c6dbaf60a7906552b4a265b95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L574B2GTIWP3XDHBIKTG3JZIWO/bundle.json","state_url":"https://pith.science/pith/L574B2GTIWP3XDHBIKTG3JZIWO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L574B2GTIWP3XDHBIKTG3JZIWO/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-03T19:50:57Z","links":{"resolver":"https://pith.science/pith/L574B2GTIWP3XDHBIKTG3JZIWO","bundle":"https://pith.science/pith/L574B2GTIWP3XDHBIKTG3JZIWO/bundle.json","state":"https://pith.science/pith/L574B2GTIWP3XDHBIKTG3JZIWO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L574B2GTIWP3XDHBIKTG3JZIWO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:L574B2GTIWP3XDHBIKTG3JZIWO","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":"35303b904bc5dae4e0db3246974cf61e87ae17930a6a5e5d3d34d57224d42ce8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-13T12:17:37Z","title_canon_sha256":"66c8725f059ea2519c7dac32720f78692b7512b895d7a8eafebd0e71121ed672"},"schema_version":"1.0","source":{"id":"1110.2911","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2911","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2911v2","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2911","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"pith_short_12","alias_value":"L574B2GTIWP3","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"L574B2GTIWP3XDHB","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"L574B2GT","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:710474d2de5a9d8ca2a7c8f358acd1137eb9993c6dbaf60a7906552b4a265b95","target":"graph","created_at":"2026-05-18T03:49:10Z","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 1982, Opsut showed that the competition number of a line graph is at most two and gave a necessary and sufficient condition for the competition number of a line graph being one. In this note, we generalize this result to the competition numbers of generalized line graphs, that is, we show that the competition number of a generalized line graph is at most two, and give necessary conditions and sufficient conditions for the competition number of a generalized line graph being one.","authors_text":"Boram Park, Yoshio Sano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-13T12:17:37Z","title":"The competition number of a generalized line graph is at most two"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2911","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:371526103e80834f3dd189f600a1a7ef21434cc812a38d9704a357c3c01b20c9","target":"record","created_at":"2026-05-18T03:49:10Z","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":"35303b904bc5dae4e0db3246974cf61e87ae17930a6a5e5d3d34d57224d42ce8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-13T12:17:37Z","title_canon_sha256":"66c8725f059ea2519c7dac32720f78692b7512b895d7a8eafebd0e71121ed672"},"schema_version":"1.0","source":{"id":"1110.2911","kind":"arxiv","version":2}},"canonical_sha256":"5f7fc0e8d3459fbb8ce142a66da728b39ffbf7b88c0f71992e56ff28192eb65f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f7fc0e8d3459fbb8ce142a66da728b39ffbf7b88c0f71992e56ff28192eb65f","first_computed_at":"2026-05-18T03:49:10.402176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:10.402176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cXgnP/8Tgnhc5C36YZguW8UXOsOi48VOWvwV7Cdz3kZ92Nuy+pzRsvhiCWR7Vzw/6P7QM4qWxj/OAMtZFLurBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:10.402626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.2911","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:371526103e80834f3dd189f600a1a7ef21434cc812a38d9704a357c3c01b20c9","sha256:710474d2de5a9d8ca2a7c8f358acd1137eb9993c6dbaf60a7906552b4a265b95"],"state_sha256":"060745125fd54632768bf925cb6e992fd052d255bdbc3a6fa023e390f8350447"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OfvOWZQs6vX/iufpFONv42zcyB0v81gmlBrq7HCSEVKoKl3agXb/bedRegZD+ME/IXeQHVsNOxfhF+g0l/F2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T19:50:57.204049Z","bundle_sha256":"6b309cb9dd3769504b90e626947ca68924079a0f349a3855f9e95316c891d114"}}