{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XRYA4H4OOYBUVOK6B32FLNQSGU","short_pith_number":"pith:XRYA4H4O","schema_version":"1.0","canonical_sha256":"bc700e1f8e76034ab95e0ef455b61235352defb32d12de38d303a0f03260b160","source":{"kind":"arxiv","id":"1901.00043","version":1},"attestation_state":"computed","paper":{"title":"On the structure of (claw,bull)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Masood Masjoody, Sebasti\\'an Gonz\\'alez Hermosillo de la Maza, Yifan Jing","submitted_at":"2018-12-31T20:51:27Z","abstract_excerpt":"In this research, we determine the structure of (claw, bull)-free graphs. We show that every connected (claw, bull)-free graph is either an expansion of a path, an expansion of a cycle, or the complement of a triangle-free graph; where an expansion of a graph $G$ is obtained by replacing its vertices with disjoint cliques and adding all edges between cliques corresponding to adjacent vertices of $G$. This result also reveals facts about the structure of triangle-free graphs, which might be of independent interest."},"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":"1901.00043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-31T20:51:27Z","cross_cats_sorted":[],"title_canon_sha256":"85a15e3cc5484bacbc6ca0b98305ede0cb03fb86b344bef66fec6ad3752ce7ee","abstract_canon_sha256":"3a1a3bc349274e23184ddbb739a5782495e0e2e64fe72c3665aeef6be771a0f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:07.024336Z","signature_b64":"Wcf6j5EXhVlScynwWA02A/dTFNjpCWZyqQo8eNKQF/Nz92hB/XlFnGjHX/AFsOlBBpKEs/NiiXwiKvCSu2oFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc700e1f8e76034ab95e0ef455b61235352defb32d12de38d303a0f03260b160","last_reissued_at":"2026-05-17T23:57:07.023968Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:07.023968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the structure of (claw,bull)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Masood Masjoody, Sebasti\\'an Gonz\\'alez Hermosillo de la Maza, Yifan Jing","submitted_at":"2018-12-31T20:51:27Z","abstract_excerpt":"In this research, we determine the structure of (claw, bull)-free graphs. We show that every connected (claw, bull)-free graph is either an expansion of a path, an expansion of a cycle, or the complement of a triangle-free graph; where an expansion of a graph $G$ is obtained by replacing its vertices with disjoint cliques and adding all edges between cliques corresponding to adjacent vertices of $G$. This result also reveals facts about the structure of triangle-free graphs, which might be of independent interest."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00043","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.00043","created_at":"2026-05-17T23:57:07.024024+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.00043v1","created_at":"2026-05-17T23:57:07.024024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00043","created_at":"2026-05-17T23:57:07.024024+00:00"},{"alias_kind":"pith_short_12","alias_value":"XRYA4H4OOYBU","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XRYA4H4OOYBUVOK6","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XRYA4H4O","created_at":"2026-05-18T12:33:01.666342+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/XRYA4H4OOYBUVOK6B32FLNQSGU","json":"https://pith.science/pith/XRYA4H4OOYBUVOK6B32FLNQSGU.json","graph_json":"https://pith.science/api/pith-number/XRYA4H4OOYBUVOK6B32FLNQSGU/graph.json","events_json":"https://pith.science/api/pith-number/XRYA4H4OOYBUVOK6B32FLNQSGU/events.json","paper":"https://pith.science/paper/XRYA4H4O"},"agent_actions":{"view_html":"https://pith.science/pith/XRYA4H4OOYBUVOK6B32FLNQSGU","download_json":"https://pith.science/pith/XRYA4H4OOYBUVOK6B32FLNQSGU.json","view_paper":"https://pith.science/paper/XRYA4H4O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.00043&json=true","fetch_graph":"https://pith.science/api/pith-number/XRYA4H4OOYBUVOK6B32FLNQSGU/graph.json","fetch_events":"https://pith.science/api/pith-number/XRYA4H4OOYBUVOK6B32FLNQSGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XRYA4H4OOYBUVOK6B32FLNQSGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XRYA4H4OOYBUVOK6B32FLNQSGU/action/storage_attestation","attest_author":"https://pith.science/pith/XRYA4H4OOYBUVOK6B32FLNQSGU/action/author_attestation","sign_citation":"https://pith.science/pith/XRYA4H4OOYBUVOK6B32FLNQSGU/action/citation_signature","submit_replication":"https://pith.science/pith/XRYA4H4OOYBUVOK6B32FLNQSGU/action/replication_record"}},"created_at":"2026-05-17T23:57:07.024024+00:00","updated_at":"2026-05-17T23:57:07.024024+00:00"}