{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GI7I6G4DMKF5H2MB6IJCJHJKEQ","short_pith_number":"pith:GI7I6G4D","schema_version":"1.0","canonical_sha256":"323e8f1b83628bd3e981f212249d2a24038f600ed191946c71902fc159a3f018","source":{"kind":"arxiv","id":"1510.00811","version":1},"attestation_state":"computed","paper":{"title":"Decomposition of Graphs into $(k,r)$-Fans and Single Edges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boyuan Liu, Xinmin Hou, Yu Qiu","submitted_at":"2015-10-03T12:25:03Z","abstract_excerpt":"Let $\\phi(n,H)$ be the largest integer such that, for all graphs $G$ on $n$ vertices, the edge set $E(G)$ can be partitioned into at most $\\phi(n, H)$ parts, of which every part either is a single edge or forms a graph isomorphic to $H$. Pikhurko and Sousa conjectured that $\\phi(n,H)=\\ex(n,H)$ for $\\chi(H)\\geqs3$ and all sufficiently large $n$, where $\\ex(n,H)$ denotes the maximum number of edges of graphs on $n$ vertices that does not contain $H$ as a subgraph. A $(k,r)$-fan is a graph on $(r-1)k+1$ vertices consisting of $k$ cliques of order $r$ which intersect in exactly one common vertex. "},"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":"1510.00811","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2015-10-03T12:25:03Z","cross_cats_sorted":[],"title_canon_sha256":"544e6938f95a20d79c83977d3ed46435f7bf4915cb605de9f8df3dae8106f35d","abstract_canon_sha256":"5ee0d02151bebb8b804b6123bb6b502a53dcc43a75d4aabe2bb3f00d34a7293a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:05.593959Z","signature_b64":"R36k/jEyuGn55z+6rKU0V+8Uw26wgbu9SZPcVw8weAhOITcrD2YqFvPKbUiK1W80ZVTh91UftNPXOcdOfGJpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"323e8f1b83628bd3e981f212249d2a24038f600ed191946c71902fc159a3f018","last_reissued_at":"2026-05-18T01:31:05.593229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:05.593229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposition of Graphs into $(k,r)$-Fans and Single Edges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boyuan Liu, Xinmin Hou, Yu Qiu","submitted_at":"2015-10-03T12:25:03Z","abstract_excerpt":"Let $\\phi(n,H)$ be the largest integer such that, for all graphs $G$ on $n$ vertices, the edge set $E(G)$ can be partitioned into at most $\\phi(n, H)$ parts, of which every part either is a single edge or forms a graph isomorphic to $H$. Pikhurko and Sousa conjectured that $\\phi(n,H)=\\ex(n,H)$ for $\\chi(H)\\geqs3$ and all sufficiently large $n$, where $\\ex(n,H)$ denotes the maximum number of edges of graphs on $n$ vertices that does not contain $H$ as a subgraph. A $(k,r)$-fan is a graph on $(r-1)k+1$ vertices consisting of $k$ cliques of order $r$ which intersect in exactly one common vertex. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00811","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":"1510.00811","created_at":"2026-05-18T01:31:05.593361+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.00811v1","created_at":"2026-05-18T01:31:05.593361+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00811","created_at":"2026-05-18T01:31:05.593361+00:00"},{"alias_kind":"pith_short_12","alias_value":"GI7I6G4DMKF5","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GI7I6G4DMKF5H2MB","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GI7I6G4D","created_at":"2026-05-18T12:29:22.688609+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/GI7I6G4DMKF5H2MB6IJCJHJKEQ","json":"https://pith.science/pith/GI7I6G4DMKF5H2MB6IJCJHJKEQ.json","graph_json":"https://pith.science/api/pith-number/GI7I6G4DMKF5H2MB6IJCJHJKEQ/graph.json","events_json":"https://pith.science/api/pith-number/GI7I6G4DMKF5H2MB6IJCJHJKEQ/events.json","paper":"https://pith.science/paper/GI7I6G4D"},"agent_actions":{"view_html":"https://pith.science/pith/GI7I6G4DMKF5H2MB6IJCJHJKEQ","download_json":"https://pith.science/pith/GI7I6G4DMKF5H2MB6IJCJHJKEQ.json","view_paper":"https://pith.science/paper/GI7I6G4D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.00811&json=true","fetch_graph":"https://pith.science/api/pith-number/GI7I6G4DMKF5H2MB6IJCJHJKEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/GI7I6G4DMKF5H2MB6IJCJHJKEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GI7I6G4DMKF5H2MB6IJCJHJKEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GI7I6G4DMKF5H2MB6IJCJHJKEQ/action/storage_attestation","attest_author":"https://pith.science/pith/GI7I6G4DMKF5H2MB6IJCJHJKEQ/action/author_attestation","sign_citation":"https://pith.science/pith/GI7I6G4DMKF5H2MB6IJCJHJKEQ/action/citation_signature","submit_replication":"https://pith.science/pith/GI7I6G4DMKF5H2MB6IJCJHJKEQ/action/replication_record"}},"created_at":"2026-05-18T01:31:05.593361+00:00","updated_at":"2026-05-18T01:31:05.593361+00:00"}