{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MMDVFHSCONWO7HDMBBUNTK5NY3","short_pith_number":"pith:MMDVFHSC","schema_version":"1.0","canonical_sha256":"6307529e42736cef9c6c0868d9abadc6c57688119fc402e031e16a86e36968d2","source":{"kind":"arxiv","id":"1712.09477","version":1},"attestation_state":"computed","paper":{"title":"The Strongly Antimagic labelings of Double Spiders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fei-Huang Chang, Pinhui Chin, Wei-Tian Li, Zhishi Pan","submitted_at":"2017-12-27T02:05:47Z","abstract_excerpt":"A graph $G=(V,E)$ is strongly antimagic, if there is a bijective mapping $f: E \\to \\{1,2,\\ldots,|E|\\}$ such that for any two vertices $u\\neq v$, not only $\\sum_{e \\in E(u)}f(e) \\ne \\sum_{e\\in E(v)}f(e)$ and also $\\sum_{e \\in E(u)}f(e) < \\sum_{e\\in E(v)}f(e)$ whenever $\\deg(u)< \\deg(v) $, where $E(u)$ is the set of edges incident to $u$. In this paper, we prove that double spiders, the trees contains exactly two vertices of degree at least 3, are strongly antimagic."},"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":"1712.09477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-27T02:05:47Z","cross_cats_sorted":[],"title_canon_sha256":"70c4d97b87e9d9d886d9be4cc521d37963ca399b33b07ed5cb15d2d812aeb75a","abstract_canon_sha256":"f55bc2afde3c8deeadf377386e2449d2aa72bc8b7754b9eba9fbc51b7b804f00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:08.271151Z","signature_b64":"/zQHhJAmWMtUh4cv60q+Comn4JtlqPhLAF4zK/Wrb2qwSFhizbGGtWGqhuTJAy2EbQsOzi3owunAgRYTq9odDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6307529e42736cef9c6c0868d9abadc6c57688119fc402e031e16a86e36968d2","last_reissued_at":"2026-05-18T00:27:08.270507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:08.270507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Strongly Antimagic labelings of Double Spiders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fei-Huang Chang, Pinhui Chin, Wei-Tian Li, Zhishi Pan","submitted_at":"2017-12-27T02:05:47Z","abstract_excerpt":"A graph $G=(V,E)$ is strongly antimagic, if there is a bijective mapping $f: E \\to \\{1,2,\\ldots,|E|\\}$ such that for any two vertices $u\\neq v$, not only $\\sum_{e \\in E(u)}f(e) \\ne \\sum_{e\\in E(v)}f(e)$ and also $\\sum_{e \\in E(u)}f(e) < \\sum_{e\\in E(v)}f(e)$ whenever $\\deg(u)< \\deg(v) $, where $E(u)$ is the set of edges incident to $u$. In this paper, we prove that double spiders, the trees contains exactly two vertices of degree at least 3, are strongly antimagic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09477","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":"1712.09477","created_at":"2026-05-18T00:27:08.270611+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.09477v1","created_at":"2026-05-18T00:27:08.270611+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09477","created_at":"2026-05-18T00:27:08.270611+00:00"},{"alias_kind":"pith_short_12","alias_value":"MMDVFHSCONWO","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MMDVFHSCONWO7HDM","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MMDVFHSC","created_at":"2026-05-18T12:31:31.346846+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/MMDVFHSCONWO7HDMBBUNTK5NY3","json":"https://pith.science/pith/MMDVFHSCONWO7HDMBBUNTK5NY3.json","graph_json":"https://pith.science/api/pith-number/MMDVFHSCONWO7HDMBBUNTK5NY3/graph.json","events_json":"https://pith.science/api/pith-number/MMDVFHSCONWO7HDMBBUNTK5NY3/events.json","paper":"https://pith.science/paper/MMDVFHSC"},"agent_actions":{"view_html":"https://pith.science/pith/MMDVFHSCONWO7HDMBBUNTK5NY3","download_json":"https://pith.science/pith/MMDVFHSCONWO7HDMBBUNTK5NY3.json","view_paper":"https://pith.science/paper/MMDVFHSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.09477&json=true","fetch_graph":"https://pith.science/api/pith-number/MMDVFHSCONWO7HDMBBUNTK5NY3/graph.json","fetch_events":"https://pith.science/api/pith-number/MMDVFHSCONWO7HDMBBUNTK5NY3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MMDVFHSCONWO7HDMBBUNTK5NY3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MMDVFHSCONWO7HDMBBUNTK5NY3/action/storage_attestation","attest_author":"https://pith.science/pith/MMDVFHSCONWO7HDMBBUNTK5NY3/action/author_attestation","sign_citation":"https://pith.science/pith/MMDVFHSCONWO7HDMBBUNTK5NY3/action/citation_signature","submit_replication":"https://pith.science/pith/MMDVFHSCONWO7HDMBBUNTK5NY3/action/replication_record"}},"created_at":"2026-05-18T00:27:08.270611+00:00","updated_at":"2026-05-18T00:27:08.270611+00:00"}