{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:J7ZCBF5HC2NKBIS5KCZGSEHX4N","short_pith_number":"pith:J7ZCBF5H","schema_version":"1.0","canonical_sha256":"4ff22097a7169aa0a25d50b26910f7e347b5b55d1448cfe5b25190f2c8e884ea","source":{"kind":"arxiv","id":"1710.05347","version":1},"attestation_state":"computed","paper":{"title":"$H$-Decomposition of $r$-graphs when $H$ is an $r$-graph with exactly $k$ independent edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boyuan Liu, Hongliang Lu, Xinmin Hou","submitted_at":"2017-10-15T15:30:28Z","abstract_excerpt":"Let $\\phi_H^r(n)$ be the smallest integer such that, for all $r$-graphs $G$ on $n$ vertices, the edge set $E(G)$ can be partitioned into at most $\\phi_H^r(n)$ parts, of which every part either is a single edge or forms an $r$-graph isomorphic to $H$. The function $\\phi^2_H(n)$ has been well studied in literature, but for the case $r\\ge 3$, the problem that determining the value of $\\phi_H^r(n)$ is widely open. Sousa (2010) gave an asymptotic value of $\\phi_H^r(n)$ when $H$ is an $r$-graph with exactly 2 edges, and determined the exact value of $\\phi_H^r(n)$ in some special cases. In this paper"},"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":"1710.05347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-15T15:30:28Z","cross_cats_sorted":[],"title_canon_sha256":"bbd7c00ca6cf29964cefe650a5d0c62ea740eea6b4309cc57677ab698475b354","abstract_canon_sha256":"ada03ae9ea44ea4b88789bd3ed0fc8cd3102d13cdda70d9bd7fea482d5bf1527"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:49.874660Z","signature_b64":"s5SNAdyQqL9vITyhj7ohAGAx5nZDDe5ulaHGOumvYyidyzZkys55XTCcJ42vdx3GJ3xKiyCKZGQxXoQHcyc1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ff22097a7169aa0a25d50b26910f7e347b5b55d1448cfe5b25190f2c8e884ea","last_reissued_at":"2026-05-18T00:32:49.874015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:49.874015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$H$-Decomposition of $r$-graphs when $H$ is an $r$-graph with exactly $k$ independent edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boyuan Liu, Hongliang Lu, Xinmin Hou","submitted_at":"2017-10-15T15:30:28Z","abstract_excerpt":"Let $\\phi_H^r(n)$ be the smallest integer such that, for all $r$-graphs $G$ on $n$ vertices, the edge set $E(G)$ can be partitioned into at most $\\phi_H^r(n)$ parts, of which every part either is a single edge or forms an $r$-graph isomorphic to $H$. The function $\\phi^2_H(n)$ has been well studied in literature, but for the case $r\\ge 3$, the problem that determining the value of $\\phi_H^r(n)$ is widely open. Sousa (2010) gave an asymptotic value of $\\phi_H^r(n)$ when $H$ is an $r$-graph with exactly 2 edges, and determined the exact value of $\\phi_H^r(n)$ in some special cases. In this paper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05347","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":"1710.05347","created_at":"2026-05-18T00:32:49.874101+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.05347v1","created_at":"2026-05-18T00:32:49.874101+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05347","created_at":"2026-05-18T00:32:49.874101+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7ZCBF5HC2NK","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7ZCBF5HC2NKBIS5","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7ZCBF5H","created_at":"2026-05-18T12:31:21.493067+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/J7ZCBF5HC2NKBIS5KCZGSEHX4N","json":"https://pith.science/pith/J7ZCBF5HC2NKBIS5KCZGSEHX4N.json","graph_json":"https://pith.science/api/pith-number/J7ZCBF5HC2NKBIS5KCZGSEHX4N/graph.json","events_json":"https://pith.science/api/pith-number/J7ZCBF5HC2NKBIS5KCZGSEHX4N/events.json","paper":"https://pith.science/paper/J7ZCBF5H"},"agent_actions":{"view_html":"https://pith.science/pith/J7ZCBF5HC2NKBIS5KCZGSEHX4N","download_json":"https://pith.science/pith/J7ZCBF5HC2NKBIS5KCZGSEHX4N.json","view_paper":"https://pith.science/paper/J7ZCBF5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.05347&json=true","fetch_graph":"https://pith.science/api/pith-number/J7ZCBF5HC2NKBIS5KCZGSEHX4N/graph.json","fetch_events":"https://pith.science/api/pith-number/J7ZCBF5HC2NKBIS5KCZGSEHX4N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7ZCBF5HC2NKBIS5KCZGSEHX4N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7ZCBF5HC2NKBIS5KCZGSEHX4N/action/storage_attestation","attest_author":"https://pith.science/pith/J7ZCBF5HC2NKBIS5KCZGSEHX4N/action/author_attestation","sign_citation":"https://pith.science/pith/J7ZCBF5HC2NKBIS5KCZGSEHX4N/action/citation_signature","submit_replication":"https://pith.science/pith/J7ZCBF5HC2NKBIS5KCZGSEHX4N/action/replication_record"}},"created_at":"2026-05-18T00:32:49.874101+00:00","updated_at":"2026-05-18T00:32:49.874101+00:00"}