{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2O5YZEWKKFJFJJ7GU33VJLTERH","short_pith_number":"pith:2O5YZEWK","schema_version":"1.0","canonical_sha256":"d3bb8c92ca515254a7e6a6f754ae6489eb0569fd2fcc53a05bb9c2b865ee02f3","source":{"kind":"arxiv","id":"1604.02105","version":2},"attestation_state":"computed","paper":{"title":"All trees are six-cordial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elliot Krop, Keith Driscoll, Michelle Nguyen","submitted_at":"2016-04-07T18:44:11Z","abstract_excerpt":"For any integer $k>0$, a tree $T$ is $k$-cordial if there exists a labeling of the vertices of $T$ by $\\mathbb{Z}_k$, inducing a labeling on the edges with edge-weights found by summing the labels on vertices incident to a given edge modulo $k$ so that each label appears on at most one more vertex than any other and each edge-weight appears on at most one more edge than any other.\n  We prove that all trees are six-cordial by an adjustment of the test proposed by Hovey (1991) to show all trees are $k$-cordial."},"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":"1604.02105","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-07T18:44:11Z","cross_cats_sorted":[],"title_canon_sha256":"1087525490ab769bb27c602e2c709c0688ec8b2207ea83914fa7efab3b085d2a","abstract_canon_sha256":"81998cac5e4ad73fedc1ccbb08622e4b77a2e50222128698fd84428e25d9ffb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:20.189114Z","signature_b64":"YuQDWx/R/5tZ0D+PVYBcQFEwDG/TeJHCrvnuoKOQSGdYEOw8vNEiZ7e1ZggcAQAGL+isbWv0YV/rrTecCHicAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3bb8c92ca515254a7e6a6f754ae6489eb0569fd2fcc53a05bb9c2b865ee02f3","last_reissued_at":"2026-05-18T00:45:20.188381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:20.188381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"All trees are six-cordial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elliot Krop, Keith Driscoll, Michelle Nguyen","submitted_at":"2016-04-07T18:44:11Z","abstract_excerpt":"For any integer $k>0$, a tree $T$ is $k$-cordial if there exists a labeling of the vertices of $T$ by $\\mathbb{Z}_k$, inducing a labeling on the edges with edge-weights found by summing the labels on vertices incident to a given edge modulo $k$ so that each label appears on at most one more vertex than any other and each edge-weight appears on at most one more edge than any other.\n  We prove that all trees are six-cordial by an adjustment of the test proposed by Hovey (1991) to show all trees are $k$-cordial."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02105","kind":"arxiv","version":2},"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":"1604.02105","created_at":"2026-05-18T00:45:20.188502+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02105v2","created_at":"2026-05-18T00:45:20.188502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02105","created_at":"2026-05-18T00:45:20.188502+00:00"},{"alias_kind":"pith_short_12","alias_value":"2O5YZEWKKFJF","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2O5YZEWKKFJFJJ7G","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2O5YZEWK","created_at":"2026-05-18T12:29:55.572404+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/2O5YZEWKKFJFJJ7GU33VJLTERH","json":"https://pith.science/pith/2O5YZEWKKFJFJJ7GU33VJLTERH.json","graph_json":"https://pith.science/api/pith-number/2O5YZEWKKFJFJJ7GU33VJLTERH/graph.json","events_json":"https://pith.science/api/pith-number/2O5YZEWKKFJFJJ7GU33VJLTERH/events.json","paper":"https://pith.science/paper/2O5YZEWK"},"agent_actions":{"view_html":"https://pith.science/pith/2O5YZEWKKFJFJJ7GU33VJLTERH","download_json":"https://pith.science/pith/2O5YZEWKKFJFJJ7GU33VJLTERH.json","view_paper":"https://pith.science/paper/2O5YZEWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02105&json=true","fetch_graph":"https://pith.science/api/pith-number/2O5YZEWKKFJFJJ7GU33VJLTERH/graph.json","fetch_events":"https://pith.science/api/pith-number/2O5YZEWKKFJFJJ7GU33VJLTERH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2O5YZEWKKFJFJJ7GU33VJLTERH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2O5YZEWKKFJFJJ7GU33VJLTERH/action/storage_attestation","attest_author":"https://pith.science/pith/2O5YZEWKKFJFJJ7GU33VJLTERH/action/author_attestation","sign_citation":"https://pith.science/pith/2O5YZEWKKFJFJJ7GU33VJLTERH/action/citation_signature","submit_replication":"https://pith.science/pith/2O5YZEWKKFJFJJ7GU33VJLTERH/action/replication_record"}},"created_at":"2026-05-18T00:45:20.188502+00:00","updated_at":"2026-05-18T00:45:20.188502+00:00"}