{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WNB3TC3HBGU5RDAKJI2ONSPNEU","short_pith_number":"pith:WNB3TC3H","schema_version":"1.0","canonical_sha256":"b343b98b6709a9d88c0a4a34e6c9ed251e8fc37ea73753c1459baf47daec4591","source":{"kind":"arxiv","id":"1312.7633","version":1},"attestation_state":"computed","paper":{"title":"Magic labelings of distance at most 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alfan Sukmana Praja, Ira Apni Purwasih, Mohammad Navie Jauhari, Mona Elviyenti, Rinovia Simanjuntak","submitted_at":"2013-12-30T05:32:02Z","abstract_excerpt":"For an arbitrary set of distances $D\\subseteq \\{0,1, \\ldots, d\\}$, a graph $G$ is said to be $D$-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_D(x)} f(y) ={\\sf k}$, where $N_D(x) = \\{y \\in V| d(x,y) \\in D\\}$.\n  In this paper we study some necessary or sufficient conditions for the existence of $D$-distance magic graphs, some of which are generalization of conditions for the existence of $\\{1\\}$-distance magic graphs. More specifically, we study $D$-distance magic labelings for cycles and $D$-di"},"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":"1312.7633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-30T05:32:02Z","cross_cats_sorted":[],"title_canon_sha256":"4263d3e00a432c6e2c17eb3cd3a183cd40351debb5f2b16fd61aa17915acc90f","abstract_canon_sha256":"865636dfb7b4a24d6a9d18a021f608d2cc4a1f56194fe832c572b018b287d3b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:34.155412Z","signature_b64":"vb0AeA6TjwIghLueZOMVBj6xK3Is/vbncBMuYbdY/CkIgsJsyucSaeqV9U3S9kJ5ut2ncwFhJmazaUuM739YAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b343b98b6709a9d88c0a4a34e6c9ed251e8fc37ea73753c1459baf47daec4591","last_reissued_at":"2026-05-18T03:03:34.154829Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:34.154829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Magic labelings of distance at most 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alfan Sukmana Praja, Ira Apni Purwasih, Mohammad Navie Jauhari, Mona Elviyenti, Rinovia Simanjuntak","submitted_at":"2013-12-30T05:32:02Z","abstract_excerpt":"For an arbitrary set of distances $D\\subseteq \\{0,1, \\ldots, d\\}$, a graph $G$ is said to be $D$-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_D(x)} f(y) ={\\sf k}$, where $N_D(x) = \\{y \\in V| d(x,y) \\in D\\}$.\n  In this paper we study some necessary or sufficient conditions for the existence of $D$-distance magic graphs, some of which are generalization of conditions for the existence of $\\{1\\}$-distance magic graphs. More specifically, we study $D$-distance magic labelings for cycles and $D$-di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7633","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":"1312.7633","created_at":"2026-05-18T03:03:34.154935+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.7633v1","created_at":"2026-05-18T03:03:34.154935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7633","created_at":"2026-05-18T03:03:34.154935+00:00"},{"alias_kind":"pith_short_12","alias_value":"WNB3TC3HBGU5","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WNB3TC3HBGU5RDAK","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WNB3TC3H","created_at":"2026-05-18T12:28:04.890932+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/WNB3TC3HBGU5RDAKJI2ONSPNEU","json":"https://pith.science/pith/WNB3TC3HBGU5RDAKJI2ONSPNEU.json","graph_json":"https://pith.science/api/pith-number/WNB3TC3HBGU5RDAKJI2ONSPNEU/graph.json","events_json":"https://pith.science/api/pith-number/WNB3TC3HBGU5RDAKJI2ONSPNEU/events.json","paper":"https://pith.science/paper/WNB3TC3H"},"agent_actions":{"view_html":"https://pith.science/pith/WNB3TC3HBGU5RDAKJI2ONSPNEU","download_json":"https://pith.science/pith/WNB3TC3HBGU5RDAKJI2ONSPNEU.json","view_paper":"https://pith.science/paper/WNB3TC3H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.7633&json=true","fetch_graph":"https://pith.science/api/pith-number/WNB3TC3HBGU5RDAKJI2ONSPNEU/graph.json","fetch_events":"https://pith.science/api/pith-number/WNB3TC3HBGU5RDAKJI2ONSPNEU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WNB3TC3HBGU5RDAKJI2ONSPNEU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WNB3TC3HBGU5RDAKJI2ONSPNEU/action/storage_attestation","attest_author":"https://pith.science/pith/WNB3TC3HBGU5RDAKJI2ONSPNEU/action/author_attestation","sign_citation":"https://pith.science/pith/WNB3TC3HBGU5RDAKJI2ONSPNEU/action/citation_signature","submit_replication":"https://pith.science/pith/WNB3TC3HBGU5RDAKJI2ONSPNEU/action/replication_record"}},"created_at":"2026-05-18T03:03:34.154935+00:00","updated_at":"2026-05-18T03:03:34.154935+00:00"}