{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3CUTVRWS3CQVB2GXAZLKR7B36X","short_pith_number":"pith:3CUTVRWS","schema_version":"1.0","canonical_sha256":"d8a93ac6d2d8a150e8d70656a8fc3bf5c7a22be6db64a47ffc4ab08b5d0c1e60","source":{"kind":"arxiv","id":"1802.10392","version":1},"attestation_state":"computed","paper":{"title":"Non-magic Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Ellis, David A. Nash, Jonathan Needleman, Michael Raney","submitted_at":"2018-02-28T12:55:53Z","abstract_excerpt":"This article studies a generalization of magic squares to $k$-uniform hypergraphs. In traditional magic squares the entries come from the natural numbers. A magic labeling of the vertices in a graph or hypergraph has since been generalized to allow for labels coming from any abelian group. We demonstrate an algorithm for determining whether a given hypergraph has a magic labeling over some abelian group. A slight adjustment of this algorithm also allows one to determine whether a given hypergraph can be magically labeled over $\\mathbb{Z}$. As a demonstration, we use these algorithms to determi"},"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":"1802.10392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-28T12:55:53Z","cross_cats_sorted":[],"title_canon_sha256":"8eb9dca3d154bab4729e7cf6015a536aa20c532a460d02c772f59eae4c5d9346","abstract_canon_sha256":"1de027343d7349a1f26623d80f3747240da9d2f5a48a4028038f1d71289f9dea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:17.256895Z","signature_b64":"YqPGeVKfsp3MGZhRXgUzyidOfXdPKSGhYEIsYwt0KGl7dpkPIlXUMwR3ei5VgkHPjZvj5bPuuDmrR3j5KEIfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8a93ac6d2d8a150e8d70656a8fc3bf5c7a22be6db64a47ffc4ab08b5d0c1e60","last_reissued_at":"2026-05-18T00:22:17.256162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:17.256162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-magic Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Ellis, David A. Nash, Jonathan Needleman, Michael Raney","submitted_at":"2018-02-28T12:55:53Z","abstract_excerpt":"This article studies a generalization of magic squares to $k$-uniform hypergraphs. In traditional magic squares the entries come from the natural numbers. A magic labeling of the vertices in a graph or hypergraph has since been generalized to allow for labels coming from any abelian group. We demonstrate an algorithm for determining whether a given hypergraph has a magic labeling over some abelian group. A slight adjustment of this algorithm also allows one to determine whether a given hypergraph can be magically labeled over $\\mathbb{Z}$. As a demonstration, we use these algorithms to determi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10392","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":"1802.10392","created_at":"2026-05-18T00:22:17.256291+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.10392v1","created_at":"2026-05-18T00:22:17.256291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10392","created_at":"2026-05-18T00:22:17.256291+00:00"},{"alias_kind":"pith_short_12","alias_value":"3CUTVRWS3CQV","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3CUTVRWS3CQVB2GX","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3CUTVRWS","created_at":"2026-05-18T12:32:02.567920+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/3CUTVRWS3CQVB2GXAZLKR7B36X","json":"https://pith.science/pith/3CUTVRWS3CQVB2GXAZLKR7B36X.json","graph_json":"https://pith.science/api/pith-number/3CUTVRWS3CQVB2GXAZLKR7B36X/graph.json","events_json":"https://pith.science/api/pith-number/3CUTVRWS3CQVB2GXAZLKR7B36X/events.json","paper":"https://pith.science/paper/3CUTVRWS"},"agent_actions":{"view_html":"https://pith.science/pith/3CUTVRWS3CQVB2GXAZLKR7B36X","download_json":"https://pith.science/pith/3CUTVRWS3CQVB2GXAZLKR7B36X.json","view_paper":"https://pith.science/paper/3CUTVRWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.10392&json=true","fetch_graph":"https://pith.science/api/pith-number/3CUTVRWS3CQVB2GXAZLKR7B36X/graph.json","fetch_events":"https://pith.science/api/pith-number/3CUTVRWS3CQVB2GXAZLKR7B36X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3CUTVRWS3CQVB2GXAZLKR7B36X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3CUTVRWS3CQVB2GXAZLKR7B36X/action/storage_attestation","attest_author":"https://pith.science/pith/3CUTVRWS3CQVB2GXAZLKR7B36X/action/author_attestation","sign_citation":"https://pith.science/pith/3CUTVRWS3CQVB2GXAZLKR7B36X/action/citation_signature","submit_replication":"https://pith.science/pith/3CUTVRWS3CQVB2GXAZLKR7B36X/action/replication_record"}},"created_at":"2026-05-18T00:22:17.256291+00:00","updated_at":"2026-05-18T00:22:17.256291+00:00"}