{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DSLCTSQIVCC4ELBNNZXHTGNZBC","short_pith_number":"pith:DSLCTSQI","schema_version":"1.0","canonical_sha256":"1c9629ca08a885c22c2d6e6e7999b9088e9ee6b0f8c7ac8f92c77076a220229b","source":{"kind":"arxiv","id":"1412.5498","version":3},"attestation_state":"computed","paper":{"title":"H-Index Manipulation by Merging Articles: Models, Theory, and Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","cs.SI"],"primary_cat":"cs.DL","authors_text":"Christian Komusiewicz, Manuel Sorge, Ren\\'e van Bevern, Rolf Niedermeier, Toby Walsh","submitted_at":"2014-12-17T17:39:53Z","abstract_excerpt":"An author's profile on Google Scholar consists of indexed articles and associated data, such as the number of citations and the H-index. The author is allowed to merge articles; this may affect the H-index. We analyze the (parameterized) computational complexity of maximizing the H-index using article merges. Herein, to model realistic manipulation scenarios, we define a compatibility graph whose edges correspond to plausible merges. Moreover, we consider several different measures for computing the citation count of a merged article. For the measure used by Google Scholar, we give an algorith"},"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":"1412.5498","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DL","submitted_at":"2014-12-17T17:39:53Z","cross_cats_sorted":["cs.DM","cs.DS","cs.SI"],"title_canon_sha256":"6b7681186e849ad97fe980bd9f7d5ab6981d9ac996c074856f0b7c18c2db1163","abstract_canon_sha256":"92cb740317fb4156a19f2f132f625704063f5a37eb082354271d6f390aea161e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:24.143203Z","signature_b64":"pEhjSWip7Mww9oJXlCxoR68FVBlnd/Hgtn1DchBgT21kyyMVLIpd7vGguWtOOHMH4Rih7xKafCVT4KUWgka2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c9629ca08a885c22c2d6e6e7999b9088e9ee6b0f8c7ac8f92c77076a220229b","last_reissued_at":"2026-05-18T00:52:24.142348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:24.142348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"H-Index Manipulation by Merging Articles: Models, Theory, and Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","cs.SI"],"primary_cat":"cs.DL","authors_text":"Christian Komusiewicz, Manuel Sorge, Ren\\'e van Bevern, Rolf Niedermeier, Toby Walsh","submitted_at":"2014-12-17T17:39:53Z","abstract_excerpt":"An author's profile on Google Scholar consists of indexed articles and associated data, such as the number of citations and the H-index. The author is allowed to merge articles; this may affect the H-index. We analyze the (parameterized) computational complexity of maximizing the H-index using article merges. Herein, to model realistic manipulation scenarios, we define a compatibility graph whose edges correspond to plausible merges. Moreover, we consider several different measures for computing the citation count of a merged article. For the measure used by Google Scholar, we give an algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5498","kind":"arxiv","version":3},"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":"1412.5498","created_at":"2026-05-18T00:52:24.142492+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.5498v3","created_at":"2026-05-18T00:52:24.142492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5498","created_at":"2026-05-18T00:52:24.142492+00:00"},{"alias_kind":"pith_short_12","alias_value":"DSLCTSQIVCC4","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DSLCTSQIVCC4ELBN","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DSLCTSQI","created_at":"2026-05-18T12:28:25.294606+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/DSLCTSQIVCC4ELBNNZXHTGNZBC","json":"https://pith.science/pith/DSLCTSQIVCC4ELBNNZXHTGNZBC.json","graph_json":"https://pith.science/api/pith-number/DSLCTSQIVCC4ELBNNZXHTGNZBC/graph.json","events_json":"https://pith.science/api/pith-number/DSLCTSQIVCC4ELBNNZXHTGNZBC/events.json","paper":"https://pith.science/paper/DSLCTSQI"},"agent_actions":{"view_html":"https://pith.science/pith/DSLCTSQIVCC4ELBNNZXHTGNZBC","download_json":"https://pith.science/pith/DSLCTSQIVCC4ELBNNZXHTGNZBC.json","view_paper":"https://pith.science/paper/DSLCTSQI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.5498&json=true","fetch_graph":"https://pith.science/api/pith-number/DSLCTSQIVCC4ELBNNZXHTGNZBC/graph.json","fetch_events":"https://pith.science/api/pith-number/DSLCTSQIVCC4ELBNNZXHTGNZBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DSLCTSQIVCC4ELBNNZXHTGNZBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DSLCTSQIVCC4ELBNNZXHTGNZBC/action/storage_attestation","attest_author":"https://pith.science/pith/DSLCTSQIVCC4ELBNNZXHTGNZBC/action/author_attestation","sign_citation":"https://pith.science/pith/DSLCTSQIVCC4ELBNNZXHTGNZBC/action/citation_signature","submit_replication":"https://pith.science/pith/DSLCTSQIVCC4ELBNNZXHTGNZBC/action/replication_record"}},"created_at":"2026-05-18T00:52:24.142492+00:00","updated_at":"2026-05-18T00:52:24.142492+00:00"}