{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PYY5G3ASS44HCFYGEKBQIVGBVV","short_pith_number":"pith:PYY5G3AS","schema_version":"1.0","canonical_sha256":"7e31d36c12973871170622830454c1ad6bb048472e39cf43e0cea62c4b6c2a17","source":{"kind":"arxiv","id":"1410.0766","version":1},"attestation_state":"computed","paper":{"title":"On consecutive edge magic total labeling of connected bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bumtle Kang, Ji Yeon Park, Suh-Ryung Kim","submitted_at":"2014-10-03T07:34:58Z","abstract_excerpt":"Since Sedl\\'{a}$\\breve{\\mbox{c}}$ek introduced the notion of magic labeling of a graph in 1963, a variety of magic labelings of a graph have been defined and studied. In this paper, we study consecutive edge magic labelings of a connected bipartite graph. We make a very useful observation that there are only four possible values of $b$ for which a connected bipartite graph has a $b$-edge consecutive magic labeling. On the basis of this fundamental result, we deduce various interesting results on consecutive edge magic labelings of bipartite graphs, especially caterpillars and lobsters, which e"},"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":"1410.0766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-03T07:34:58Z","cross_cats_sorted":[],"title_canon_sha256":"cffd96677a7bd300340f49a79b58489b029e23d23b675c131db5006c21ee15d6","abstract_canon_sha256":"c45d6705f2d290f53ac3d9e9c5a1c0961c093bd17e3872c612b9cbe7e16cc78c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:09.739384Z","signature_b64":"A8F2MLI38zoM48r25hicQFESlXKsZS0qAdqGvaVbQse0rC4jzGsfHKJtm7ixzQ9LZP9SUYNcXUoZ2eNmnCQ1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e31d36c12973871170622830454c1ad6bb048472e39cf43e0cea62c4b6c2a17","last_reissued_at":"2026-05-18T02:41:09.738981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:09.738981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On consecutive edge magic total labeling of connected bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bumtle Kang, Ji Yeon Park, Suh-Ryung Kim","submitted_at":"2014-10-03T07:34:58Z","abstract_excerpt":"Since Sedl\\'{a}$\\breve{\\mbox{c}}$ek introduced the notion of magic labeling of a graph in 1963, a variety of magic labelings of a graph have been defined and studied. In this paper, we study consecutive edge magic labelings of a connected bipartite graph. We make a very useful observation that there are only four possible values of $b$ for which a connected bipartite graph has a $b$-edge consecutive magic labeling. On the basis of this fundamental result, we deduce various interesting results on consecutive edge magic labelings of bipartite graphs, especially caterpillars and lobsters, which e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0766","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":"1410.0766","created_at":"2026-05-18T02:41:09.739040+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.0766v1","created_at":"2026-05-18T02:41:09.739040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0766","created_at":"2026-05-18T02:41:09.739040+00:00"},{"alias_kind":"pith_short_12","alias_value":"PYY5G3ASS44H","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PYY5G3ASS44HCFYG","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PYY5G3AS","created_at":"2026-05-18T12:28:43.426989+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/PYY5G3ASS44HCFYGEKBQIVGBVV","json":"https://pith.science/pith/PYY5G3ASS44HCFYGEKBQIVGBVV.json","graph_json":"https://pith.science/api/pith-number/PYY5G3ASS44HCFYGEKBQIVGBVV/graph.json","events_json":"https://pith.science/api/pith-number/PYY5G3ASS44HCFYGEKBQIVGBVV/events.json","paper":"https://pith.science/paper/PYY5G3AS"},"agent_actions":{"view_html":"https://pith.science/pith/PYY5G3ASS44HCFYGEKBQIVGBVV","download_json":"https://pith.science/pith/PYY5G3ASS44HCFYGEKBQIVGBVV.json","view_paper":"https://pith.science/paper/PYY5G3AS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.0766&json=true","fetch_graph":"https://pith.science/api/pith-number/PYY5G3ASS44HCFYGEKBQIVGBVV/graph.json","fetch_events":"https://pith.science/api/pith-number/PYY5G3ASS44HCFYGEKBQIVGBVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PYY5G3ASS44HCFYGEKBQIVGBVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PYY5G3ASS44HCFYGEKBQIVGBVV/action/storage_attestation","attest_author":"https://pith.science/pith/PYY5G3ASS44HCFYGEKBQIVGBVV/action/author_attestation","sign_citation":"https://pith.science/pith/PYY5G3ASS44HCFYGEKBQIVGBVV/action/citation_signature","submit_replication":"https://pith.science/pith/PYY5G3ASS44HCFYGEKBQIVGBVV/action/replication_record"}},"created_at":"2026-05-18T02:41:09.739040+00:00","updated_at":"2026-05-18T02:41:09.739040+00:00"}