{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:L574B2GTIWP3XDHBIKTG3JZIWO","short_pith_number":"pith:L574B2GT","schema_version":"1.0","canonical_sha256":"5f7fc0e8d3459fbb8ce142a66da728b39ffbf7b88c0f71992e56ff28192eb65f","source":{"kind":"arxiv","id":"1110.2911","version":2},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1110.2911","created_at":"2026-05-18T03:49:10.402249+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.2911v2","created_at":"2026-05-18T03:49:10.402249+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2911","created_at":"2026-05-18T03:49:10.402249+00:00"},{"alias_kind":"pith_short_12","alias_value":"L574B2GTIWP3","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"L574B2GTIWP3XDHB","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"L574B2GT","created_at":"2026-05-18T12:26:34.985390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L574B2GTIWP3XDHBIKTG3JZIWO","json":"https://pith.science/pith/L574B2GTIWP3XDHBIKTG3JZIWO.json","graph_json":"https://pith.science/api/pith-number/L574B2GTIWP3XDHBIKTG3JZIWO/graph.json","events_json":"https://pith.science/api/pith-number/L574B2GTIWP3XDHBIKTG3JZIWO/events.json","paper":"https://pith.science/paper/L574B2GT"},"agent_actions":{"view_html":"https://pith.science/pith/L574B2GTIWP3XDHBIKTG3JZIWO","download_json":"https://pith.science/pith/L574B2GTIWP3XDHBIKTG3JZIWO.json","view_paper":"https://pith.science/paper/L574B2GT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.2911&json=true","fetch_graph":"https://pith.science/api/pith-number/L574B2GTIWP3XDHBIKTG3JZIWO/graph.json","fetch_events":"https://pith.science/api/pith-number/L574B2GTIWP3XDHBIKTG3JZIWO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L574B2GTIWP3XDHBIKTG3JZIWO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L574B2GTIWP3XDHBIKTG3JZIWO/action/storage_attestation","attest_author":"https://pith.science/pith/L574B2GTIWP3XDHBIKTG3JZIWO/action/author_attestation","sign_citation":"https://pith.science/pith/L574B2GTIWP3XDHBIKTG3JZIWO/action/citation_signature","submit_replication":"https://pith.science/pith/L574B2GTIWP3XDHBIKTG3JZIWO/action/replication_record"}},"created_at":"2026-05-18T03:49:10.402249+00:00","updated_at":"2026-05-18T03:49:10.402249+00:00"}