{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Q3DW4ETJYYY6JKFILBKEHBVSYU","short_pith_number":"pith:Q3DW4ETJ","canonical_record":{"source":{"id":"1505.07688","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-28T13:38:40Z","cross_cats_sorted":[],"title_canon_sha256":"568c5c6d801380d07bb49d82a770b094ec8a1296f2d33476ce2b9006378fc741","abstract_canon_sha256":"59492a8def52f74d74853dc8e8d2b6445223f3a00a39e550b6126e883571c572"},"schema_version":"1.0"},"canonical_sha256":"86c76e1269c631e4a8a858544386b2c51da3269e954d31e97f945b101f81151e","source":{"kind":"arxiv","id":"1505.07688","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07688","created_at":"2026-05-18T02:00:56Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07688v1","created_at":"2026-05-18T02:00:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07688","created_at":"2026-05-18T02:00:56Z"},{"alias_kind":"pith_short_12","alias_value":"Q3DW4ETJYYY6","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q3DW4ETJYYY6JKFI","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q3DW4ETJ","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Q3DW4ETJYYY6JKFILBKEHBVSYU","target":"record","payload":{"canonical_record":{"source":{"id":"1505.07688","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-28T13:38:40Z","cross_cats_sorted":[],"title_canon_sha256":"568c5c6d801380d07bb49d82a770b094ec8a1296f2d33476ce2b9006378fc741","abstract_canon_sha256":"59492a8def52f74d74853dc8e8d2b6445223f3a00a39e550b6126e883571c572"},"schema_version":"1.0"},"canonical_sha256":"86c76e1269c631e4a8a858544386b2c51da3269e954d31e97f945b101f81151e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:56.137384Z","signature_b64":"uysP9p5yutdCxhxyi8FcR1zDj3HJ5SZrTfWxJ5AyJY5ie4clB0iVJF2AbPi8FFdeatSgG1o2j7fu+PohFnAVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86c76e1269c631e4a8a858544386b2c51da3269e954d31e97f945b101f81151e","last_reissued_at":"2026-05-18T02:00:56.136434Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:56.136434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.07688","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-18T02:00:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qcVe5nFIw/goofN0hNzIz3mZnoQ+TxbhKOcOaCtX7z3MPpa4glt5zwm3JNGmLPt9iy52621fWsd43HyzKMfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:16:29.841797Z"},"content_sha256":"aec2fa602c1f7741c228c28211c82fc083649c32d5b21a6a3661269201886b2e","schema_version":"1.0","event_id":"sha256:aec2fa602c1f7741c228c28211c82fc083649c32d5b21a6a3661269201886b2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Q3DW4ETJYYY6JKFILBKEHBVSYU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anti-magic labeling of regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Feihuang Chang, Xuding Zhu, Yu-Chang Liang, Zhishi Pan","submitted_at":"2015-05-28T13:38:40Z","abstract_excerpt":"A graph $G=(V,E)$ is antimagic if there is a one-to-one correspondence $f: E \\to \\{1,2,\\ldots, |E|\\}$ such that for any two vertices $u,v$, $\\sum_{e \\in E(u)}f(e) \\ne \\sum_{e\\in E(v)}f(e)$. It is known that bipartite regular graphs are antimagic and non-bipartite regular graphs of odd degree at least three are antimagic. Whether all non-bipartite regular graphs of even degree are antimagic remained an open problem. In this paper, we solve this problem and prove that all even degree regular graphs are antimagic. The paper was submitted to December 2014 by Journal of Graph Theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07688","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-18T02:00:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KE7kvYUCeQtP7ugWQ7JFjVJq2KEf0ddLyxIP9/rkApqbLpS5uzqPFOSVBw16+kA76SzlCKyErmBcgVGXWr0SBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:16:29.842468Z"},"content_sha256":"1b9ade3a94e58c14debc5790352d27a9e930f9d2d8529df319ce05e905f20005","schema_version":"1.0","event_id":"sha256:1b9ade3a94e58c14debc5790352d27a9e930f9d2d8529df319ce05e905f20005"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q3DW4ETJYYY6JKFILBKEHBVSYU/bundle.json","state_url":"https://pith.science/pith/Q3DW4ETJYYY6JKFILBKEHBVSYU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q3DW4ETJYYY6JKFILBKEHBVSYU/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-27T14:16:29Z","links":{"resolver":"https://pith.science/pith/Q3DW4ETJYYY6JKFILBKEHBVSYU","bundle":"https://pith.science/pith/Q3DW4ETJYYY6JKFILBKEHBVSYU/bundle.json","state":"https://pith.science/pith/Q3DW4ETJYYY6JKFILBKEHBVSYU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q3DW4ETJYYY6JKFILBKEHBVSYU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Q3DW4ETJYYY6JKFILBKEHBVSYU","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":"59492a8def52f74d74853dc8e8d2b6445223f3a00a39e550b6126e883571c572","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-28T13:38:40Z","title_canon_sha256":"568c5c6d801380d07bb49d82a770b094ec8a1296f2d33476ce2b9006378fc741"},"schema_version":"1.0","source":{"id":"1505.07688","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07688","created_at":"2026-05-18T02:00:56Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07688v1","created_at":"2026-05-18T02:00:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07688","created_at":"2026-05-18T02:00:56Z"},{"alias_kind":"pith_short_12","alias_value":"Q3DW4ETJYYY6","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q3DW4ETJYYY6JKFI","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q3DW4ETJ","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:1b9ade3a94e58c14debc5790352d27a9e930f9d2d8529df319ce05e905f20005","target":"graph","created_at":"2026-05-18T02:00:56Z","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":"A graph $G=(V,E)$ is antimagic if there is a one-to-one correspondence $f: E \\to \\{1,2,\\ldots, |E|\\}$ such that for any two vertices $u,v$, $\\sum_{e \\in E(u)}f(e) \\ne \\sum_{e\\in E(v)}f(e)$. It is known that bipartite regular graphs are antimagic and non-bipartite regular graphs of odd degree at least three are antimagic. Whether all non-bipartite regular graphs of even degree are antimagic remained an open problem. In this paper, we solve this problem and prove that all even degree regular graphs are antimagic. The paper was submitted to December 2014 by Journal of Graph Theory.","authors_text":"Feihuang Chang, Xuding Zhu, Yu-Chang Liang, Zhishi Pan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-28T13:38:40Z","title":"Anti-magic labeling of regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07688","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:aec2fa602c1f7741c228c28211c82fc083649c32d5b21a6a3661269201886b2e","target":"record","created_at":"2026-05-18T02:00:56Z","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":"59492a8def52f74d74853dc8e8d2b6445223f3a00a39e550b6126e883571c572","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-28T13:38:40Z","title_canon_sha256":"568c5c6d801380d07bb49d82a770b094ec8a1296f2d33476ce2b9006378fc741"},"schema_version":"1.0","source":{"id":"1505.07688","kind":"arxiv","version":1}},"canonical_sha256":"86c76e1269c631e4a8a858544386b2c51da3269e954d31e97f945b101f81151e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86c76e1269c631e4a8a858544386b2c51da3269e954d31e97f945b101f81151e","first_computed_at":"2026-05-18T02:00:56.136434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:00:56.136434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uysP9p5yutdCxhxyi8FcR1zDj3HJ5SZrTfWxJ5AyJY5ie4clB0iVJF2AbPi8FFdeatSgG1o2j7fu+PohFnAVBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:00:56.137384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.07688","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aec2fa602c1f7741c228c28211c82fc083649c32d5b21a6a3661269201886b2e","sha256:1b9ade3a94e58c14debc5790352d27a9e930f9d2d8529df319ce05e905f20005"],"state_sha256":"514291585e3b58a4d9366ae517f3fd8b3b5cf4c7e68152498a253caac76182bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mCdqCt1gbYwe265Kdo4bW9InZjV9q/GEFs57H+PvBub+P+EsBS63Yp2GxyrR86g7S7LuRH6kXnWJriU9KBCIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:16:29.845052Z","bundle_sha256":"a17d03f47be88938b6fbcbc4bac9d1ec5d2fe484f53bf2e7908a2d4d5041493c"}}