{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YBICV4YYFWSFVG353JGX6U3HUL","short_pith_number":"pith:YBICV4YY","schema_version":"1.0","canonical_sha256":"c0502af3182da45a9b7dda4d7f5367a2c9d14fbc3a2fd51f63a1ce2163bd3ef3","source":{"kind":"arxiv","id":"1403.2810","version":1},"attestation_state":"computed","paper":{"title":"Equitable vertex arboricity of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Xin Zhang","submitted_at":"2014-03-12T04:48:06Z","abstract_excerpt":"Let $G_1$ be a planar graph such that all cycles of length at most 4 are independent and let $G_2$ be a planar graph without 3-cycles and adjacent 4-cycles. It is proved that the set of vertices of $G_1$ and $G_2$ can be equitably partitioned into $t$ subsets for every $t\\geq 3$ so that each subset induces a forest. These results partially confirm a conjecture of Wu, Zhang and Li."},"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":"1403.2810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-12T04:48:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"afa152511019eae4d42a49f139919bb061d5ab39051ef003c8b6aa9e55e5cbea","abstract_canon_sha256":"5e0bd3173c27c97b129cf89f4126f166ca9d36e728a18da0e07d93f3ded824d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:33.994580Z","signature_b64":"98ctpUlNcxNCoIzQAE/fzupSH1AM70eJ8oJt6W7alYZ8v47b+QVTz9DQfMFf+e+sJGl8nnBj/V3hsAPZbh/pDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0502af3182da45a9b7dda4d7f5367a2c9d14fbc3a2fd51f63a1ce2163bd3ef3","last_reissued_at":"2026-05-18T02:56:33.993794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:33.993794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equitable vertex arboricity of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Xin Zhang","submitted_at":"2014-03-12T04:48:06Z","abstract_excerpt":"Let $G_1$ be a planar graph such that all cycles of length at most 4 are independent and let $G_2$ be a planar graph without 3-cycles and adjacent 4-cycles. It is proved that the set of vertices of $G_1$ and $G_2$ can be equitably partitioned into $t$ subsets for every $t\\geq 3$ so that each subset induces a forest. These results partially confirm a conjecture of Wu, Zhang and Li."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2810","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":"1403.2810","created_at":"2026-05-18T02:56:33.993932+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.2810v1","created_at":"2026-05-18T02:56:33.993932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2810","created_at":"2026-05-18T02:56:33.993932+00:00"},{"alias_kind":"pith_short_12","alias_value":"YBICV4YYFWSF","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YBICV4YYFWSFVG35","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YBICV4YY","created_at":"2026-05-18T12:28:57.508820+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/YBICV4YYFWSFVG353JGX6U3HUL","json":"https://pith.science/pith/YBICV4YYFWSFVG353JGX6U3HUL.json","graph_json":"https://pith.science/api/pith-number/YBICV4YYFWSFVG353JGX6U3HUL/graph.json","events_json":"https://pith.science/api/pith-number/YBICV4YYFWSFVG353JGX6U3HUL/events.json","paper":"https://pith.science/paper/YBICV4YY"},"agent_actions":{"view_html":"https://pith.science/pith/YBICV4YYFWSFVG353JGX6U3HUL","download_json":"https://pith.science/pith/YBICV4YYFWSFVG353JGX6U3HUL.json","view_paper":"https://pith.science/paper/YBICV4YY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.2810&json=true","fetch_graph":"https://pith.science/api/pith-number/YBICV4YYFWSFVG353JGX6U3HUL/graph.json","fetch_events":"https://pith.science/api/pith-number/YBICV4YYFWSFVG353JGX6U3HUL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YBICV4YYFWSFVG353JGX6U3HUL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YBICV4YYFWSFVG353JGX6U3HUL/action/storage_attestation","attest_author":"https://pith.science/pith/YBICV4YYFWSFVG353JGX6U3HUL/action/author_attestation","sign_citation":"https://pith.science/pith/YBICV4YYFWSFVG353JGX6U3HUL/action/citation_signature","submit_replication":"https://pith.science/pith/YBICV4YYFWSFVG353JGX6U3HUL/action/replication_record"}},"created_at":"2026-05-18T02:56:33.993932+00:00","updated_at":"2026-05-18T02:56:33.993932+00:00"}