{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GI7I6G4DMKF5H2MB6IJCJHJKEQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5ee0d02151bebb8b804b6123bb6b502a53dcc43a75d4aabe2bb3f00d34a7293a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2015-10-03T12:25:03Z","title_canon_sha256":"544e6938f95a20d79c83977d3ed46435f7bf4915cb605de9f8df3dae8106f35d"},"schema_version":"1.0","source":{"id":"1510.00811","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00811","created_at":"2026-05-18T01:31:05Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00811v1","created_at":"2026-05-18T01:31:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00811","created_at":"2026-05-18T01:31:05Z"},{"alias_kind":"pith_short_12","alias_value":"GI7I6G4DMKF5","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GI7I6G4DMKF5H2MB","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GI7I6G4D","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:87f828ecca587fc2c674b379219cbf4a55a8600e36cf9ac70e406e876650989d","target":"graph","created_at":"2026-05-18T01:31:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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. ","authors_text":"Boyuan Liu, Xinmin Hou, Yu Qiu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2015-10-03T12:25:03Z","title":"Decomposition of Graphs into $(k,r)$-Fans and Single Edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00811","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fa5b8de2874bee45b865948842bef2e565ee8ea593c0ca3aff5527295a4786e1","target":"record","created_at":"2026-05-18T01:31:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5ee0d02151bebb8b804b6123bb6b502a53dcc43a75d4aabe2bb3f00d34a7293a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2015-10-03T12:25:03Z","title_canon_sha256":"544e6938f95a20d79c83977d3ed46435f7bf4915cb605de9f8df3dae8106f35d"},"schema_version":"1.0","source":{"id":"1510.00811","kind":"arxiv","version":1}},"canonical_sha256":"323e8f1b83628bd3e981f212249d2a24038f600ed191946c71902fc159a3f018","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"323e8f1b83628bd3e981f212249d2a24038f600ed191946c71902fc159a3f018","first_computed_at":"2026-05-18T01:31:05.593229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:05.593229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R36k/jEyuGn55z+6rKU0V+8Uw26wgbu9SZPcVw8weAhOITcrD2YqFvPKbUiK1W80ZVTh91UftNPXOcdOfGJpDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:05.593959Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.00811","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa5b8de2874bee45b865948842bef2e565ee8ea593c0ca3aff5527295a4786e1","sha256:87f828ecca587fc2c674b379219cbf4a55a8600e36cf9ac70e406e876650989d"],"state_sha256":"4559dcc3ac1f9d6208e8572f0a1654c8ffe19524f007420c4dce5736f4636243"}