{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FAOO3DSDOCJBMDC4AFXCOGOAA6","short_pith_number":"pith:FAOO3DSD","canonical_record":{"source":{"id":"1305.1880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-08T16:51:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5e396e1dcc461bf72c456da60e5be11d1ac1b1eb532db440503e102693e86b07","abstract_canon_sha256":"ef01f5c31801a698e5b2e2fa01cf0b5eea1e2cff4f5ea5dd5b7c2b69d54a78b5"},"schema_version":"1.0"},"canonical_sha256":"281ced8e437092160c5c016e2719c0078cec0b98cf5dd0f4d36d4af449daa586","source":{"kind":"arxiv","id":"1305.1880","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1880","created_at":"2026-05-18T03:26:10Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1880v1","created_at":"2026-05-18T03:26:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1880","created_at":"2026-05-18T03:26:10Z"},{"alias_kind":"pith_short_12","alias_value":"FAOO3DSDOCJB","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FAOO3DSDOCJBMDC4","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FAOO3DSD","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FAOO3DSDOCJBMDC4AFXCOGOAA6","target":"record","payload":{"canonical_record":{"source":{"id":"1305.1880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-08T16:51:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5e396e1dcc461bf72c456da60e5be11d1ac1b1eb532db440503e102693e86b07","abstract_canon_sha256":"ef01f5c31801a698e5b2e2fa01cf0b5eea1e2cff4f5ea5dd5b7c2b69d54a78b5"},"schema_version":"1.0"},"canonical_sha256":"281ced8e437092160c5c016e2719c0078cec0b98cf5dd0f4d36d4af449daa586","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:10.965202Z","signature_b64":"xFprc4p92CoZXNUSH16bTv9BlVwDBWIEIhPU55C97isTwDnjEA9gkiEE8Y/wBncoOpKQDkXfmPaMVm2QhKaCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"281ced8e437092160c5c016e2719c0078cec0b98cf5dd0f4d36d4af449daa586","last_reissued_at":"2026-05-18T03:26:10.964533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:10.964533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.1880","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-18T03:26:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uIOwWRTj9l4eMEedJM4oMEh08BpiMyMUbWOIFt5+RTMeoZbyneOrn8Z9htTV/0QSOIC8uP4JDad1Zw+bIujZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:51:32.093456Z"},"content_sha256":"609934e94382b674dcc13aeb5add813db9962d372f52cb7f115fc13c1a64890d","schema_version":"1.0","event_id":"sha256:609934e94382b674dcc13aeb5add813db9962d372f52cb7f115fc13c1a64890d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FAOO3DSDOCJBMDC4AFXCOGOAA6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Heuristic for Magic and Antimagic Graph Labellings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Elaheh Vaezpour, Fran\\c{c}ois Bertault, Hebert P\\'erez-Ros\\'es, Mirka Miller, Ramiro Feria-Puron","submitted_at":"2013-05-08T16:51:03Z","abstract_excerpt":"Graph labellings have been a very fruitful area of research in the last four decades. However, despite the staggering number of papers published in the field (over 1000), few general results are available, and most papers deal with particular classes of graphs and methods. Here we approach the problem from the computational viewpoint, and in a quite general way. We present the existence problem of a particular labelling as a combinatorial optimization problem, then we discuss the possible strategies to solve it, and finally we present a heuristic for finding different classes of labellings, li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1880","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-18T03:26:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ItgyVsgpW8h6jTVVKRHpq8gcVzsYrwM0ZgRajJchJL/9DgxWg+UFDLC+vNqi02WvGGJOJpP/iBiil47RICHYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:51:32.094087Z"},"content_sha256":"1577b31d7c8747df2bb21b76df100b8d95ef8c76f81e95704532dadfd56bf5c7","schema_version":"1.0","event_id":"sha256:1577b31d7c8747df2bb21b76df100b8d95ef8c76f81e95704532dadfd56bf5c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FAOO3DSDOCJBMDC4AFXCOGOAA6/bundle.json","state_url":"https://pith.science/pith/FAOO3DSDOCJBMDC4AFXCOGOAA6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FAOO3DSDOCJBMDC4AFXCOGOAA6/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-28T07:51:32Z","links":{"resolver":"https://pith.science/pith/FAOO3DSDOCJBMDC4AFXCOGOAA6","bundle":"https://pith.science/pith/FAOO3DSDOCJBMDC4AFXCOGOAA6/bundle.json","state":"https://pith.science/pith/FAOO3DSDOCJBMDC4AFXCOGOAA6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FAOO3DSDOCJBMDC4AFXCOGOAA6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FAOO3DSDOCJBMDC4AFXCOGOAA6","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":"ef01f5c31801a698e5b2e2fa01cf0b5eea1e2cff4f5ea5dd5b7c2b69d54a78b5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-08T16:51:03Z","title_canon_sha256":"5e396e1dcc461bf72c456da60e5be11d1ac1b1eb532db440503e102693e86b07"},"schema_version":"1.0","source":{"id":"1305.1880","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1880","created_at":"2026-05-18T03:26:10Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1880v1","created_at":"2026-05-18T03:26:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1880","created_at":"2026-05-18T03:26:10Z"},{"alias_kind":"pith_short_12","alias_value":"FAOO3DSDOCJB","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FAOO3DSDOCJBMDC4","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FAOO3DSD","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:1577b31d7c8747df2bb21b76df100b8d95ef8c76f81e95704532dadfd56bf5c7","target":"graph","created_at":"2026-05-18T03:26:10Z","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":"Graph labellings have been a very fruitful area of research in the last four decades. However, despite the staggering number of papers published in the field (over 1000), few general results are available, and most papers deal with particular classes of graphs and methods. Here we approach the problem from the computational viewpoint, and in a quite general way. We present the existence problem of a particular labelling as a combinatorial optimization problem, then we discuss the possible strategies to solve it, and finally we present a heuristic for finding different classes of labellings, li","authors_text":"Elaheh Vaezpour, Fran\\c{c}ois Bertault, Hebert P\\'erez-Ros\\'es, Mirka Miller, Ramiro Feria-Puron","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-08T16:51:03Z","title":"A Heuristic for Magic and Antimagic Graph Labellings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1880","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:609934e94382b674dcc13aeb5add813db9962d372f52cb7f115fc13c1a64890d","target":"record","created_at":"2026-05-18T03:26:10Z","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":"ef01f5c31801a698e5b2e2fa01cf0b5eea1e2cff4f5ea5dd5b7c2b69d54a78b5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-08T16:51:03Z","title_canon_sha256":"5e396e1dcc461bf72c456da60e5be11d1ac1b1eb532db440503e102693e86b07"},"schema_version":"1.0","source":{"id":"1305.1880","kind":"arxiv","version":1}},"canonical_sha256":"281ced8e437092160c5c016e2719c0078cec0b98cf5dd0f4d36d4af449daa586","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"281ced8e437092160c5c016e2719c0078cec0b98cf5dd0f4d36d4af449daa586","first_computed_at":"2026-05-18T03:26:10.964533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:10.964533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xFprc4p92CoZXNUSH16bTv9BlVwDBWIEIhPU55C97isTwDnjEA9gkiEE8Y/wBncoOpKQDkXfmPaMVm2QhKaCCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:10.965202Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1880","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:609934e94382b674dcc13aeb5add813db9962d372f52cb7f115fc13c1a64890d","sha256:1577b31d7c8747df2bb21b76df100b8d95ef8c76f81e95704532dadfd56bf5c7"],"state_sha256":"4ebabd2a7f218dd8853904e2096b262b326444c394d43dd1d249adcefd214c1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWRWPx4vfQhSxAZ5xYoQCH1t751ihc+GXtd6zZA1JvVwRX2qRBSiDaGR+jr22XOiPGAFoavjG0qTut0UHT21AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:51:32.097096Z","bundle_sha256":"bfda5beb93b5f9d4b52ad6d6a17c1f9eb28103d4210d1674617e8fee1ffa0ede"}}