{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GAAYIF3GJIHMDNEDI2H4R5R3QI","short_pith_number":"pith:GAAYIF3G","schema_version":"1.0","canonical_sha256":"30018417664a0ec1b483468fc8f63b8211230cfa4c3d7971ae1e16bc0fded0d9","source":{"kind":"arxiv","id":"1803.09416","version":1},"attestation_state":"computed","paper":{"title":"Induced nets and Hamiltonicity of claw-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun Fujisawa, Shuya Chiba","submitted_at":"2018-03-26T05:28:19Z","abstract_excerpt":"The connected graph of degree sequence 3,3,3,1,1,1 is called a net, and the vertices of degree 1 in a net is called its endvertices. Broersma conjectured in 1993 that a 2-connected graph G with no induced K_{1,3} is hamiltonian if every endvertex of each induced net of G has degree at least (|V(G)|-2)/3. In this paper we prove this conjecture in the affirmative."},"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":"1803.09416","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-26T05:28:19Z","cross_cats_sorted":[],"title_canon_sha256":"6e18fea740ab1df53b4a5ebcbb1324245f510e809f87b7954333f1eab3f773c6","abstract_canon_sha256":"5d7b1b79a92b0850f793b62ac21df22c9f78cff5217a1e7fcb98778f4e967e87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:11.669367Z","signature_b64":"ZproIrCzbDnkrOvbIth+N52jERGNGC1jXFl7G5n++/IuLdTc9VXNpFERaBFiQx1G5cuBc8ss8rMA5Ir3ZnF6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30018417664a0ec1b483468fc8f63b8211230cfa4c3d7971ae1e16bc0fded0d9","last_reissued_at":"2026-05-18T00:20:11.668752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:11.668752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced nets and Hamiltonicity of claw-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun Fujisawa, Shuya Chiba","submitted_at":"2018-03-26T05:28:19Z","abstract_excerpt":"The connected graph of degree sequence 3,3,3,1,1,1 is called a net, and the vertices of degree 1 in a net is called its endvertices. Broersma conjectured in 1993 that a 2-connected graph G with no induced K_{1,3} is hamiltonian if every endvertex of each induced net of G has degree at least (|V(G)|-2)/3. In this paper we prove this conjecture in the affirmative."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09416","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":"1803.09416","created_at":"2026-05-18T00:20:11.668838+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.09416v1","created_at":"2026-05-18T00:20:11.668838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09416","created_at":"2026-05-18T00:20:11.668838+00:00"},{"alias_kind":"pith_short_12","alias_value":"GAAYIF3GJIHM","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GAAYIF3GJIHMDNED","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GAAYIF3G","created_at":"2026-05-18T12:32:25.280505+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/GAAYIF3GJIHMDNEDI2H4R5R3QI","json":"https://pith.science/pith/GAAYIF3GJIHMDNEDI2H4R5R3QI.json","graph_json":"https://pith.science/api/pith-number/GAAYIF3GJIHMDNEDI2H4R5R3QI/graph.json","events_json":"https://pith.science/api/pith-number/GAAYIF3GJIHMDNEDI2H4R5R3QI/events.json","paper":"https://pith.science/paper/GAAYIF3G"},"agent_actions":{"view_html":"https://pith.science/pith/GAAYIF3GJIHMDNEDI2H4R5R3QI","download_json":"https://pith.science/pith/GAAYIF3GJIHMDNEDI2H4R5R3QI.json","view_paper":"https://pith.science/paper/GAAYIF3G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.09416&json=true","fetch_graph":"https://pith.science/api/pith-number/GAAYIF3GJIHMDNEDI2H4R5R3QI/graph.json","fetch_events":"https://pith.science/api/pith-number/GAAYIF3GJIHMDNEDI2H4R5R3QI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GAAYIF3GJIHMDNEDI2H4R5R3QI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GAAYIF3GJIHMDNEDI2H4R5R3QI/action/storage_attestation","attest_author":"https://pith.science/pith/GAAYIF3GJIHMDNEDI2H4R5R3QI/action/author_attestation","sign_citation":"https://pith.science/pith/GAAYIF3GJIHMDNEDI2H4R5R3QI/action/citation_signature","submit_replication":"https://pith.science/pith/GAAYIF3GJIHMDNEDI2H4R5R3QI/action/replication_record"}},"created_at":"2026-05-18T00:20:11.668838+00:00","updated_at":"2026-05-18T00:20:11.668838+00:00"}