{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5PV4Q4D743UNEM3K3L2FQK7X2Y","short_pith_number":"pith:5PV4Q4D7","schema_version":"1.0","canonical_sha256":"ebebc8707fe6e8d2336adaf4582bf7d613bfdff06da221f712c875d80cef9c27","source":{"kind":"arxiv","id":"1706.03414","version":1},"attestation_state":"computed","paper":{"title":"Advances on the Conjecture of Erd\\H{o}s-S\\'os for spiders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Camino Balbuena, Jos\\'e R. Portillo, Mucuy-Kak Guevara, Pedro Reyes","submitted_at":"2017-06-11T21:49:13Z","abstract_excerpt":"- A hamiltonian graph $G$ verifying $e(G)>n(k-1)/2$ %with a vertex of degree greater or equal than $k$ contains any $k$-spider.\n  - If $G$ is a graph with average degree $\\bar{d} > k-1$, then every spider of size $k$ is contained in $G$ for $k\\le 10$.\n  - A $2$-connected graph with average degree $\\bar{d} > \\ell_2+\\ell_3+\\ell_4$ contains every spider of $4$ legs $S_{1,\\ell_2,\\ell_3,\\ell_4}$. We claim also that the condition of $2$-connection is not needed, but the proof is very long and it is not included in this document."},"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":"1706.03414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-11T21:49:13Z","cross_cats_sorted":[],"title_canon_sha256":"55c18c6dd11d0a4c8d40a8b251adc501cbe65a37abbf899adb17e32ce612bd89","abstract_canon_sha256":"b18779c562c9b8b78e8c02477bc0890f4c3ffd648a2e2c5384558e9439e465af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:35.748867Z","signature_b64":"TJpJxPMehg7GpBydoh4EWTsaQLqgz5nyfoF4PcNc2cROUCpunTF5AblwM0z0L40Xj5snPX8Gz8gXqJxHnZ9XBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebebc8707fe6e8d2336adaf4582bf7d613bfdff06da221f712c875d80cef9c27","last_reissued_at":"2026-05-18T00:42:35.748155Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:35.748155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Advances on the Conjecture of Erd\\H{o}s-S\\'os for spiders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Camino Balbuena, Jos\\'e R. Portillo, Mucuy-Kak Guevara, Pedro Reyes","submitted_at":"2017-06-11T21:49:13Z","abstract_excerpt":"- A hamiltonian graph $G$ verifying $e(G)>n(k-1)/2$ %with a vertex of degree greater or equal than $k$ contains any $k$-spider.\n  - If $G$ is a graph with average degree $\\bar{d} > k-1$, then every spider of size $k$ is contained in $G$ for $k\\le 10$.\n  - A $2$-connected graph with average degree $\\bar{d} > \\ell_2+\\ell_3+\\ell_4$ contains every spider of $4$ legs $S_{1,\\ell_2,\\ell_3,\\ell_4}$. We claim also that the condition of $2$-connection is not needed, but the proof is very long and it is not included in this document."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03414","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":"1706.03414","created_at":"2026-05-18T00:42:35.748264+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03414v1","created_at":"2026-05-18T00:42:35.748264+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03414","created_at":"2026-05-18T00:42:35.748264+00:00"},{"alias_kind":"pith_short_12","alias_value":"5PV4Q4D743UN","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5PV4Q4D743UNEM3K","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5PV4Q4D7","created_at":"2026-05-18T12:31:00.734936+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/5PV4Q4D743UNEM3K3L2FQK7X2Y","json":"https://pith.science/pith/5PV4Q4D743UNEM3K3L2FQK7X2Y.json","graph_json":"https://pith.science/api/pith-number/5PV4Q4D743UNEM3K3L2FQK7X2Y/graph.json","events_json":"https://pith.science/api/pith-number/5PV4Q4D743UNEM3K3L2FQK7X2Y/events.json","paper":"https://pith.science/paper/5PV4Q4D7"},"agent_actions":{"view_html":"https://pith.science/pith/5PV4Q4D743UNEM3K3L2FQK7X2Y","download_json":"https://pith.science/pith/5PV4Q4D743UNEM3K3L2FQK7X2Y.json","view_paper":"https://pith.science/paper/5PV4Q4D7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03414&json=true","fetch_graph":"https://pith.science/api/pith-number/5PV4Q4D743UNEM3K3L2FQK7X2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/5PV4Q4D743UNEM3K3L2FQK7X2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5PV4Q4D743UNEM3K3L2FQK7X2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5PV4Q4D743UNEM3K3L2FQK7X2Y/action/storage_attestation","attest_author":"https://pith.science/pith/5PV4Q4D743UNEM3K3L2FQK7X2Y/action/author_attestation","sign_citation":"https://pith.science/pith/5PV4Q4D743UNEM3K3L2FQK7X2Y/action/citation_signature","submit_replication":"https://pith.science/pith/5PV4Q4D743UNEM3K3L2FQK7X2Y/action/replication_record"}},"created_at":"2026-05-18T00:42:35.748264+00:00","updated_at":"2026-05-18T00:42:35.748264+00:00"}