{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:J7ZCBF5HC2NKBIS5KCZGSEHX4N","short_pith_number":"pith:J7ZCBF5H","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"},"canonical_sha256":"4ff22097a7169aa0a25d50b26910f7e347b5b55d1448cfe5b25190f2c8e884ea","source":{"kind":"arxiv","id":"1710.05347","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05347","created_at":"2026-05-18T00:32:49Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05347v1","created_at":"2026-05-18T00:32:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05347","created_at":"2026-05-18T00:32:49Z"},{"alias_kind":"pith_short_12","alias_value":"J7ZCBF5HC2NK","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J7ZCBF5HC2NKBIS5","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J7ZCBF5H","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:J7ZCBF5HC2NKBIS5KCZGSEHX4N","target":"record","payload":{"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"},"canonical_sha256":"4ff22097a7169aa0a25d50b26910f7e347b5b55d1448cfe5b25190f2c8e884ea","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"},"source_kind":"arxiv","source_id":"1710.05347","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:32:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yaeizUB7V6lX7LdbIwJi8/b8DSu6oSYEm7oPRtHLSbgkZPuI6ghQvDQxNRAwwqylQ1a5qriBkTv8RpSGBlqFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T21:35:30.008361Z"},"content_sha256":"e2f0422ea73a2af4137e4362ba67ca332bb7378b854521c3b2ac0e6987a4e4d5","schema_version":"1.0","event_id":"sha256:e2f0422ea73a2af4137e4362ba67ca332bb7378b854521c3b2ac0e6987a4e4d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:J7ZCBF5HC2NKBIS5KCZGSEHX4N","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:32:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ujpRjNEkDTM8pROVtzSSFX51WXAI0t/5o8u4T+yOJPaG/gGX9j+Ftk39xWH5k1zZhsDEJP6+AxjWgY4RedcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T21:35:30.008707Z"},"content_sha256":"f59c23a5ebcf1f0ca526bd72117f0c2b81e5cf9aba87124cbd7221f77b4dcdb6","schema_version":"1.0","event_id":"sha256:f59c23a5ebcf1f0ca526bd72117f0c2b81e5cf9aba87124cbd7221f77b4dcdb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J7ZCBF5HC2NKBIS5KCZGSEHX4N/bundle.json","state_url":"https://pith.science/pith/J7ZCBF5HC2NKBIS5KCZGSEHX4N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J7ZCBF5HC2NKBIS5KCZGSEHX4N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-19T21:35:30Z","links":{"resolver":"https://pith.science/pith/J7ZCBF5HC2NKBIS5KCZGSEHX4N","bundle":"https://pith.science/pith/J7ZCBF5HC2NKBIS5KCZGSEHX4N/bundle.json","state":"https://pith.science/pith/J7ZCBF5HC2NKBIS5KCZGSEHX4N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J7ZCBF5HC2NKBIS5KCZGSEHX4N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:J7ZCBF5HC2NKBIS5KCZGSEHX4N","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":"ada03ae9ea44ea4b88789bd3ed0fc8cd3102d13cdda70d9bd7fea482d5bf1527","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-15T15:30:28Z","title_canon_sha256":"bbd7c00ca6cf29964cefe650a5d0c62ea740eea6b4309cc57677ab698475b354"},"schema_version":"1.0","source":{"id":"1710.05347","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05347","created_at":"2026-05-18T00:32:49Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05347v1","created_at":"2026-05-18T00:32:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05347","created_at":"2026-05-18T00:32:49Z"},{"alias_kind":"pith_short_12","alias_value":"J7ZCBF5HC2NK","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J7ZCBF5HC2NKBIS5","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J7ZCBF5H","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:f59c23a5ebcf1f0ca526bd72117f0c2b81e5cf9aba87124cbd7221f77b4dcdb6","target":"graph","created_at":"2026-05-18T00:32:49Z","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_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","authors_text":"Boyuan Liu, Hongliang Lu, Xinmin Hou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-15T15:30:28Z","title":"$H$-Decomposition of $r$-graphs when $H$ is an $r$-graph with exactly $k$ independent edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05347","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:e2f0422ea73a2af4137e4362ba67ca332bb7378b854521c3b2ac0e6987a4e4d5","target":"record","created_at":"2026-05-18T00:32:49Z","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":"ada03ae9ea44ea4b88789bd3ed0fc8cd3102d13cdda70d9bd7fea482d5bf1527","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-15T15:30:28Z","title_canon_sha256":"bbd7c00ca6cf29964cefe650a5d0c62ea740eea6b4309cc57677ab698475b354"},"schema_version":"1.0","source":{"id":"1710.05347","kind":"arxiv","version":1}},"canonical_sha256":"4ff22097a7169aa0a25d50b26910f7e347b5b55d1448cfe5b25190f2c8e884ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ff22097a7169aa0a25d50b26910f7e347b5b55d1448cfe5b25190f2c8e884ea","first_computed_at":"2026-05-18T00:32:49.874015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:49.874015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s5SNAdyQqL9vITyhj7ohAGAx5nZDDe5ulaHGOumvYyidyzZkys55XTCcJ42vdx3GJ3xKiyCKZGQxXoQHcyc1Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:49.874660Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.05347","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2f0422ea73a2af4137e4362ba67ca332bb7378b854521c3b2ac0e6987a4e4d5","sha256:f59c23a5ebcf1f0ca526bd72117f0c2b81e5cf9aba87124cbd7221f77b4dcdb6"],"state_sha256":"ef4c45fa37646e02420a3cfa51eac6a9ece947ceac993709fdaf91dae81b27eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M6Rm3JYH59qAckpM703Qv/lXBVArtBImpIkEDWwiJnZlK1+5ziHYtjQqGTeppNiWZT4Bo3IMVL2KRVTE6KO0BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-19T21:35:30.010744Z","bundle_sha256":"8629cb90257528b49361e39e5eba24c4b8785235248f677e7cd2610aad7a0ded"}}