{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:ETZHDICDAZKCKAKQCD6KPGPTXO","short_pith_number":"pith:ETZHDICD","schema_version":"1.0","canonical_sha256":"24f271a043065425015010fca799f3bba2c1b0ae460fec5383ff8d142bfc8d7e","source":{"kind":"arxiv","id":"0910.2344","version":1},"attestation_state":"computed","paper":{"title":"A note on $k$-cordial $p$-uniform hypertrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Agnieszka Goerlich, Sylwia Cichacz","submitted_at":"2009-10-13T09:27:27Z","abstract_excerpt":"Hovey introduced a $k$-cordial labeling of graphs as a generalization both of harmonious and cordial labelings. He proved that all tress are $k$-cordial for $k \\in \\{1,...,5\\}$ and he conjectured that all trees are $k$-cordial for all $k$. \\indent We consider a corresponding problem for hypergraphs, namely, we show that $p$-uniform hypertrees are $k$-cordial for certain values of $k$."},"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":"0910.2344","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-10-13T09:27:27Z","cross_cats_sorted":[],"title_canon_sha256":"815691d628a2057590ff544c808dd1f79abcb3f2bb32fa2ed395a8307f709477","abstract_canon_sha256":"b0a3fa4663ec1e1bfb7c2f3e9dc881e6f4b1da6ef3e5d5a2a89ee53cc7250f7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:38.477728Z","signature_b64":"mtIpaHVBlp8pN0cJoWZmp4QbsL/Foxm9Gm4QZJAKJ3ZcNdGOlKlLvQXFjYRBMTM+wKKwdWOUb4ig5IV7Gw7JAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24f271a043065425015010fca799f3bba2c1b0ae460fec5383ff8d142bfc8d7e","last_reissued_at":"2026-05-18T03:58:38.477192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:38.477192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on $k$-cordial $p$-uniform hypertrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Agnieszka Goerlich, Sylwia Cichacz","submitted_at":"2009-10-13T09:27:27Z","abstract_excerpt":"Hovey introduced a $k$-cordial labeling of graphs as a generalization both of harmonious and cordial labelings. He proved that all tress are $k$-cordial for $k \\in \\{1,...,5\\}$ and he conjectured that all trees are $k$-cordial for all $k$. \\indent We consider a corresponding problem for hypergraphs, namely, we show that $p$-uniform hypertrees are $k$-cordial for certain values of $k$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.2344","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":"0910.2344","created_at":"2026-05-18T03:58:38.477259+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.2344v1","created_at":"2026-05-18T03:58:38.477259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.2344","created_at":"2026-05-18T03:58:38.477259+00:00"},{"alias_kind":"pith_short_12","alias_value":"ETZHDICDAZKC","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"ETZHDICDAZKCKAKQ","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"ETZHDICD","created_at":"2026-05-18T12:25:59.703012+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/ETZHDICDAZKCKAKQCD6KPGPTXO","json":"https://pith.science/pith/ETZHDICDAZKCKAKQCD6KPGPTXO.json","graph_json":"https://pith.science/api/pith-number/ETZHDICDAZKCKAKQCD6KPGPTXO/graph.json","events_json":"https://pith.science/api/pith-number/ETZHDICDAZKCKAKQCD6KPGPTXO/events.json","paper":"https://pith.science/paper/ETZHDICD"},"agent_actions":{"view_html":"https://pith.science/pith/ETZHDICDAZKCKAKQCD6KPGPTXO","download_json":"https://pith.science/pith/ETZHDICDAZKCKAKQCD6KPGPTXO.json","view_paper":"https://pith.science/paper/ETZHDICD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.2344&json=true","fetch_graph":"https://pith.science/api/pith-number/ETZHDICDAZKCKAKQCD6KPGPTXO/graph.json","fetch_events":"https://pith.science/api/pith-number/ETZHDICDAZKCKAKQCD6KPGPTXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ETZHDICDAZKCKAKQCD6KPGPTXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ETZHDICDAZKCKAKQCD6KPGPTXO/action/storage_attestation","attest_author":"https://pith.science/pith/ETZHDICDAZKCKAKQCD6KPGPTXO/action/author_attestation","sign_citation":"https://pith.science/pith/ETZHDICDAZKCKAKQCD6KPGPTXO/action/citation_signature","submit_replication":"https://pith.science/pith/ETZHDICDAZKCKAKQCD6KPGPTXO/action/replication_record"}},"created_at":"2026-05-18T03:58:38.477259+00:00","updated_at":"2026-05-18T03:58:38.477259+00:00"}