{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NHZUQKA6K2S6N52CQVL4RZJUEQ","short_pith_number":"pith:NHZUQKA6","canonical_record":{"source":{"id":"1210.1836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-05T19:00:37Z","cross_cats_sorted":[],"title_canon_sha256":"5eca0cc4a869edfc1a657ebed2d5aa68b2682571214ac0d76a1c9c8ef7c90e9b","abstract_canon_sha256":"85f3a46cf60e0ed4453ac73917fd66aaa31d15604f865a673a6da7c07c16f26c"},"schema_version":"1.0"},"canonical_sha256":"69f348281e56a5e6f7428557c8e5342434d85d418d37b53b14c597e46ebcfb2e","source":{"kind":"arxiv","id":"1210.1836","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1836","created_at":"2026-05-18T01:34:05Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1836v1","created_at":"2026-05-18T01:34:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1836","created_at":"2026-05-18T01:34:05Z"},{"alias_kind":"pith_short_12","alias_value":"NHZUQKA6K2S6","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NHZUQKA6K2S6N52C","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NHZUQKA6","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NHZUQKA6K2S6N52CQVL4RZJUEQ","target":"record","payload":{"canonical_record":{"source":{"id":"1210.1836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-05T19:00:37Z","cross_cats_sorted":[],"title_canon_sha256":"5eca0cc4a869edfc1a657ebed2d5aa68b2682571214ac0d76a1c9c8ef7c90e9b","abstract_canon_sha256":"85f3a46cf60e0ed4453ac73917fd66aaa31d15604f865a673a6da7c07c16f26c"},"schema_version":"1.0"},"canonical_sha256":"69f348281e56a5e6f7428557c8e5342434d85d418d37b53b14c597e46ebcfb2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:05.820998Z","signature_b64":"m6wgCmdOUIDweZHZ8gIm78opQj33mrSnXrDAv89ie0XHs9PObmgNsmsu27bnj580kAlExU8Use9luSdWEuAdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69f348281e56a5e6f7428557c8e5342434d85d418d37b53b14c597e46ebcfb2e","last_reissued_at":"2026-05-18T01:34:05.820490Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:05.820490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.1836","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:34:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1scQqZbyRwf7AHtqIoZ9B/CDqowJbDWahSEJH8iVGDUAysYPN5TguRKKb12Y7TWqw0NXyzgR0IgBlUHFZDHFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:51:40.037768Z"},"content_sha256":"932ff1219d967e72180f44684fdde4824d596ff9c80d162071445d74a5fd0f06","schema_version":"1.0","event_id":"sha256:932ff1219d967e72180f44684fdde4824d596ff9c80d162071445d74a5fd0f06"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NHZUQKA6K2S6N52CQVL4RZJUEQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distance magic labeling and two products of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksandra Tepeh, Iztok Peterin, Marcin Anholcer, Sylwia Cichacz","submitted_at":"2012-10-05T19:00:37Z","abstract_excerpt":"Let $G=(V,E)$ be a graph of order $n$. A distance magic labeling of $G$ is a bijection $\\ell \\colon V\\rightarrow {1,...,n}$ for which there exists a positive integer $k$ such that $\\sum_{x\\in N(v)}\\ell (x)=k$ for all $v\\in V $, where $N(v)$ is the neighborhood of $v$. We introduce a natural subclass of distance magic graphs. For this class we show that it is closed for the direct product with regular graphs and closed as a second factor for lexicographic product with regular graphs. In addition, we characterize distance magic graphs among direct product of two cycles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1836","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:34:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tf17G+qwqXZDpTvyUj4PG+i4Iq4KWNfuoYTYNfjkuOp4wjKoZVPmQioXmyMNkC7Ocbgrf5E9NhAPGVHcn2yACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:51:40.038110Z"},"content_sha256":"81e0467e0062b71440adfceb4431ed906461dde7ae9cb3cecd2147ec83f165af","schema_version":"1.0","event_id":"sha256:81e0467e0062b71440adfceb4431ed906461dde7ae9cb3cecd2147ec83f165af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHZUQKA6K2S6N52CQVL4RZJUEQ/bundle.json","state_url":"https://pith.science/pith/NHZUQKA6K2S6N52CQVL4RZJUEQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHZUQKA6K2S6N52CQVL4RZJUEQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T07:51:40Z","links":{"resolver":"https://pith.science/pith/NHZUQKA6K2S6N52CQVL4RZJUEQ","bundle":"https://pith.science/pith/NHZUQKA6K2S6N52CQVL4RZJUEQ/bundle.json","state":"https://pith.science/pith/NHZUQKA6K2S6N52CQVL4RZJUEQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHZUQKA6K2S6N52CQVL4RZJUEQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NHZUQKA6K2S6N52CQVL4RZJUEQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"85f3a46cf60e0ed4453ac73917fd66aaa31d15604f865a673a6da7c07c16f26c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-05T19:00:37Z","title_canon_sha256":"5eca0cc4a869edfc1a657ebed2d5aa68b2682571214ac0d76a1c9c8ef7c90e9b"},"schema_version":"1.0","source":{"id":"1210.1836","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1836","created_at":"2026-05-18T01:34:05Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1836v1","created_at":"2026-05-18T01:34:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1836","created_at":"2026-05-18T01:34:05Z"},{"alias_kind":"pith_short_12","alias_value":"NHZUQKA6K2S6","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NHZUQKA6K2S6N52C","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NHZUQKA6","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:81e0467e0062b71440adfceb4431ed906461dde7ae9cb3cecd2147ec83f165af","target":"graph","created_at":"2026-05-18T01:34:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Let $G=(V,E)$ be a graph of order $n$. A distance magic labeling of $G$ is a bijection $\\ell \\colon V\\rightarrow {1,...,n}$ for which there exists a positive integer $k$ such that $\\sum_{x\\in N(v)}\\ell (x)=k$ for all $v\\in V $, where $N(v)$ is the neighborhood of $v$. We introduce a natural subclass of distance magic graphs. For this class we show that it is closed for the direct product with regular graphs and closed as a second factor for lexicographic product with regular graphs. In addition, we characterize distance magic graphs among direct product of two cycles.","authors_text":"Aleksandra Tepeh, Iztok Peterin, Marcin Anholcer, Sylwia Cichacz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-05T19:00:37Z","title":"Distance magic labeling and two products of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1836","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:932ff1219d967e72180f44684fdde4824d596ff9c80d162071445d74a5fd0f06","target":"record","created_at":"2026-05-18T01:34:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"85f3a46cf60e0ed4453ac73917fd66aaa31d15604f865a673a6da7c07c16f26c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-05T19:00:37Z","title_canon_sha256":"5eca0cc4a869edfc1a657ebed2d5aa68b2682571214ac0d76a1c9c8ef7c90e9b"},"schema_version":"1.0","source":{"id":"1210.1836","kind":"arxiv","version":1}},"canonical_sha256":"69f348281e56a5e6f7428557c8e5342434d85d418d37b53b14c597e46ebcfb2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69f348281e56a5e6f7428557c8e5342434d85d418d37b53b14c597e46ebcfb2e","first_computed_at":"2026-05-18T01:34:05.820490Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:05.820490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m6wgCmdOUIDweZHZ8gIm78opQj33mrSnXrDAv89ie0XHs9PObmgNsmsu27bnj580kAlExU8Use9luSdWEuAdDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:05.820998Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.1836","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:932ff1219d967e72180f44684fdde4824d596ff9c80d162071445d74a5fd0f06","sha256:81e0467e0062b71440adfceb4431ed906461dde7ae9cb3cecd2147ec83f165af"],"state_sha256":"4749c2b878c0e9b498795bb1c97f5b6661e8d4d2c85b71c912bee115ee128285"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8cN9wW0pxBYIXly1LX7OlcYPaKBqA9J4+gcV+u0upynkWRvPG7K1uUg3J7Vf9Xj/jvrms5XoZSv6sAmB1UFjCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:51:40.040052Z","bundle_sha256":"87ee999f7d9d4b7ca22a0d24555cfe99ab16b007b855c548402761608d0ab81d"}}