{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VHJ236QZJVJZKI5W3AW4VGRHA2","short_pith_number":"pith:VHJ236QZ","schema_version":"1.0","canonical_sha256":"a9d3adfa194d539523b6d82dca9a2706a3b5c00ee9df146d91040b73ce90c2e6","source":{"kind":"arxiv","id":"1708.03077","version":1},"attestation_state":"computed","paper":{"title":"A note on the vertex arboricity of signed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Chen Gong, Lifang Wu, Weichan Liu, Xin Zhang","submitted_at":"2017-08-10T05:30:48Z","abstract_excerpt":"A signed tree-coloring of a signed graph $(G,\\sigma)$ is a vertex coloring $c$ so that $G^{c}(i,\\pm)$ is a forest for every $i\\in c(u)$ and $u\\in V(G)$, where $G^{c}(i,\\pm)$ is the subgraph of $(G,\\sigma)$ whose vertex set is the set of vertices colored by $i$ or $-i$ and edge set is the set of positive edges with two end-vertices colored both by $i$ or both by $-i$, along with the set of negative edges with one end-vertex colored by $i$ and the other colored by $-i$. If $c$ is a function from $V(G)$ to $M_n$, where $M_n$ is $\\{\\pm 1,\\pm 2,\\ldots,\\pm k\\}$ if $n=2k$, and $\\{0,\\pm 1,\\pm 2,\\ldots"},"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":"1708.03077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-10T05:30:48Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a38311acf182b0289b9a102fde5a4dca51d419d799961aa811b8c2bbd3110049","abstract_canon_sha256":"95cdedd716bc9ef7b8e3b78c4a6b1e37f8e0a2e02bb7056224626ed335c92125"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:14.858583Z","signature_b64":"CKqot6hJh9WYEq+XWJqqMLq6QnQczrwBjX+VZ9Tupwhh99fUIhonR33Ws0c4bPpKdxQdjs/DbHuGrXlRyThvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9d3adfa194d539523b6d82dca9a2706a3b5c00ee9df146d91040b73ce90c2e6","last_reissued_at":"2026-05-18T00:38:14.857737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:14.857737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on the vertex arboricity of signed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Chen Gong, Lifang Wu, Weichan Liu, Xin Zhang","submitted_at":"2017-08-10T05:30:48Z","abstract_excerpt":"A signed tree-coloring of a signed graph $(G,\\sigma)$ is a vertex coloring $c$ so that $G^{c}(i,\\pm)$ is a forest for every $i\\in c(u)$ and $u\\in V(G)$, where $G^{c}(i,\\pm)$ is the subgraph of $(G,\\sigma)$ whose vertex set is the set of vertices colored by $i$ or $-i$ and edge set is the set of positive edges with two end-vertices colored both by $i$ or both by $-i$, along with the set of negative edges with one end-vertex colored by $i$ and the other colored by $-i$. If $c$ is a function from $V(G)$ to $M_n$, where $M_n$ is $\\{\\pm 1,\\pm 2,\\ldots,\\pm k\\}$ if $n=2k$, and $\\{0,\\pm 1,\\pm 2,\\ldots"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03077","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":"1708.03077","created_at":"2026-05-18T00:38:14.857892+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.03077v1","created_at":"2026-05-18T00:38:14.857892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03077","created_at":"2026-05-18T00:38:14.857892+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHJ236QZJVJZ","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHJ236QZJVJZKI5W","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHJ236QZ","created_at":"2026-05-18T12:31:49.984773+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/VHJ236QZJVJZKI5W3AW4VGRHA2","json":"https://pith.science/pith/VHJ236QZJVJZKI5W3AW4VGRHA2.json","graph_json":"https://pith.science/api/pith-number/VHJ236QZJVJZKI5W3AW4VGRHA2/graph.json","events_json":"https://pith.science/api/pith-number/VHJ236QZJVJZKI5W3AW4VGRHA2/events.json","paper":"https://pith.science/paper/VHJ236QZ"},"agent_actions":{"view_html":"https://pith.science/pith/VHJ236QZJVJZKI5W3AW4VGRHA2","download_json":"https://pith.science/pith/VHJ236QZJVJZKI5W3AW4VGRHA2.json","view_paper":"https://pith.science/paper/VHJ236QZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.03077&json=true","fetch_graph":"https://pith.science/api/pith-number/VHJ236QZJVJZKI5W3AW4VGRHA2/graph.json","fetch_events":"https://pith.science/api/pith-number/VHJ236QZJVJZKI5W3AW4VGRHA2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHJ236QZJVJZKI5W3AW4VGRHA2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHJ236QZJVJZKI5W3AW4VGRHA2/action/storage_attestation","attest_author":"https://pith.science/pith/VHJ236QZJVJZKI5W3AW4VGRHA2/action/author_attestation","sign_citation":"https://pith.science/pith/VHJ236QZJVJZKI5W3AW4VGRHA2/action/citation_signature","submit_replication":"https://pith.science/pith/VHJ236QZJVJZKI5W3AW4VGRHA2/action/replication_record"}},"created_at":"2026-05-18T00:38:14.857892+00:00","updated_at":"2026-05-18T00:38:14.857892+00:00"}