{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:G55IC5OKPWUHYQEMFDYML4KMA7","short_pith_number":"pith:G55IC5OK","schema_version":"1.0","canonical_sha256":"377a8175ca7da87c408c28f0c5f14c07e39e78c3932f7b2889c1c473d640320b","source":{"kind":"arxiv","id":"1712.04879","version":1},"attestation_state":"computed","paper":{"title":"Distance magic labelings of product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"I Wayan Palton Anuwiksa, Rinovia Simanjuntak","submitted_at":"2017-12-13T17:46:43Z","abstract_excerpt":"A graph $G$ is said to be distance magic if there exists a bijection $f:V\\rightarrow \\{1,2, \\ldots , v\\}$ and a constant {\\sf k} such that for any vertex $x$, $\\sum_{y\\in N(x)} f(y) ={\\sf k}$, where $N_(x)$ is the set of all neighbours of $x$. \n  In this paper we shall study distance magic labelings of graphs obtained from four graph products: cartesian, strong, lexicographic, and cronecker. We shall utilise magic rectangle sets and magic column rectangles to construct the labelings."},"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":"1712.04879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-13T17:46:43Z","cross_cats_sorted":[],"title_canon_sha256":"1d108f9f07a0218a0299c71ea73a25c86a3dbd89b3417428238656f75118b30b","abstract_canon_sha256":"b442d97ba8b204f2e589a72ba4dbf982096ff7e3e37fe6e2e4e3cbdcccf17f04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:03.231626Z","signature_b64":"MsCux42s27fYkYNadJX6amT0zY/tTDKz/iOlkmAw8Ao7BbYhAV4p9axVEeG9PefBd4XnIkskxQwEPQtikpjIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"377a8175ca7da87c408c28f0c5f14c07e39e78c3932f7b2889c1c473d640320b","last_reissued_at":"2026-05-18T00:28:03.231114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:03.231114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance magic labelings of product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"I Wayan Palton Anuwiksa, Rinovia Simanjuntak","submitted_at":"2017-12-13T17:46:43Z","abstract_excerpt":"A graph $G$ is said to be distance magic if there exists a bijection $f:V\\rightarrow \\{1,2, \\ldots , v\\}$ and a constant {\\sf k} such that for any vertex $x$, $\\sum_{y\\in N(x)} f(y) ={\\sf k}$, where $N_(x)$ is the set of all neighbours of $x$. \n  In this paper we shall study distance magic labelings of graphs obtained from four graph products: cartesian, strong, lexicographic, and cronecker. We shall utilise magic rectangle sets and magic column rectangles to construct the labelings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04879","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":"1712.04879","created_at":"2026-05-18T00:28:03.231186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.04879v1","created_at":"2026-05-18T00:28:03.231186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04879","created_at":"2026-05-18T00:28:03.231186+00:00"},{"alias_kind":"pith_short_12","alias_value":"G55IC5OKPWUH","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"G55IC5OKPWUHYQEM","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"G55IC5OK","created_at":"2026-05-18T12:31:15.632608+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/G55IC5OKPWUHYQEMFDYML4KMA7","json":"https://pith.science/pith/G55IC5OKPWUHYQEMFDYML4KMA7.json","graph_json":"https://pith.science/api/pith-number/G55IC5OKPWUHYQEMFDYML4KMA7/graph.json","events_json":"https://pith.science/api/pith-number/G55IC5OKPWUHYQEMFDYML4KMA7/events.json","paper":"https://pith.science/paper/G55IC5OK"},"agent_actions":{"view_html":"https://pith.science/pith/G55IC5OKPWUHYQEMFDYML4KMA7","download_json":"https://pith.science/pith/G55IC5OKPWUHYQEMFDYML4KMA7.json","view_paper":"https://pith.science/paper/G55IC5OK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.04879&json=true","fetch_graph":"https://pith.science/api/pith-number/G55IC5OKPWUHYQEMFDYML4KMA7/graph.json","fetch_events":"https://pith.science/api/pith-number/G55IC5OKPWUHYQEMFDYML4KMA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G55IC5OKPWUHYQEMFDYML4KMA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G55IC5OKPWUHYQEMFDYML4KMA7/action/storage_attestation","attest_author":"https://pith.science/pith/G55IC5OKPWUHYQEMFDYML4KMA7/action/author_attestation","sign_citation":"https://pith.science/pith/G55IC5OKPWUHYQEMFDYML4KMA7/action/citation_signature","submit_replication":"https://pith.science/pith/G55IC5OKPWUHYQEMFDYML4KMA7/action/replication_record"}},"created_at":"2026-05-18T00:28:03.231186+00:00","updated_at":"2026-05-18T00:28:03.231186+00:00"}