{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GF7SWB5PFCRIZ7DMPR6DPFG4J6","short_pith_number":"pith:GF7SWB5P","schema_version":"1.0","canonical_sha256":"317f2b07af28a28cfc6c7c7c3794dc4f8e24d512da2c26a67f9c9dae6d7059d6","source":{"kind":"arxiv","id":"1402.5449","version":1},"attestation_state":"computed","paper":{"title":"Circulant graphs and GCD and LCM of Subsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CC","authors_text":"Igor E. Shparlinski, Joachim von zur Gathen","submitted_at":"2014-02-21T23:34:31Z","abstract_excerpt":"Given two sets $A$ and $B$ of integers, we consider the problem of finding a set $S \\subseteq A$ of the smallest possible cardinality such the greatest common divisor of the elements of $S \\cup B$ equals that of those of $A \\cup B$. The particular cases of $B = \\emptyset$ and $\\#B = 1$ are of special interest and have some links with graph theory. We also consider the corresponding question for the least common multiple of the elements. We establish NP-completeness and approximation results for these problems by relating them to the Minimum Cover Problem."},"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":"1402.5449","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-21T23:34:31Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"79c0f51c53941a9b0d413054d9ab66b1c5924bdda53e8b7e3eaa088a63c2eafa","abstract_canon_sha256":"33fb7385c5aded2dd89b63f4c79dc1d531dc7f76e1bb41301c864156ce7c6812"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:21.114017Z","signature_b64":"PPEhZ1X/T3vgfMQ0Jawo4bk0kpGhqm1ni8EfPMi/X61Iv1kB8+L8W8w4csGUdRHnCQ9eaBKsIdCs/94sNkxTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"317f2b07af28a28cfc6c7c7c3794dc4f8e24d512da2c26a67f9c9dae6d7059d6","last_reissued_at":"2026-05-18T02:58:21.113499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:21.113499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circulant graphs and GCD and LCM of Subsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CC","authors_text":"Igor E. Shparlinski, Joachim von zur Gathen","submitted_at":"2014-02-21T23:34:31Z","abstract_excerpt":"Given two sets $A$ and $B$ of integers, we consider the problem of finding a set $S \\subseteq A$ of the smallest possible cardinality such the greatest common divisor of the elements of $S \\cup B$ equals that of those of $A \\cup B$. The particular cases of $B = \\emptyset$ and $\\#B = 1$ are of special interest and have some links with graph theory. We also consider the corresponding question for the least common multiple of the elements. We establish NP-completeness and approximation results for these problems by relating them to the Minimum Cover Problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5449","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":"1402.5449","created_at":"2026-05-18T02:58:21.113576+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.5449v1","created_at":"2026-05-18T02:58:21.113576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5449","created_at":"2026-05-18T02:58:21.113576+00:00"},{"alias_kind":"pith_short_12","alias_value":"GF7SWB5PFCRI","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GF7SWB5PFCRIZ7DM","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GF7SWB5P","created_at":"2026-05-18T12:28:30.664211+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/GF7SWB5PFCRIZ7DMPR6DPFG4J6","json":"https://pith.science/pith/GF7SWB5PFCRIZ7DMPR6DPFG4J6.json","graph_json":"https://pith.science/api/pith-number/GF7SWB5PFCRIZ7DMPR6DPFG4J6/graph.json","events_json":"https://pith.science/api/pith-number/GF7SWB5PFCRIZ7DMPR6DPFG4J6/events.json","paper":"https://pith.science/paper/GF7SWB5P"},"agent_actions":{"view_html":"https://pith.science/pith/GF7SWB5PFCRIZ7DMPR6DPFG4J6","download_json":"https://pith.science/pith/GF7SWB5PFCRIZ7DMPR6DPFG4J6.json","view_paper":"https://pith.science/paper/GF7SWB5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.5449&json=true","fetch_graph":"https://pith.science/api/pith-number/GF7SWB5PFCRIZ7DMPR6DPFG4J6/graph.json","fetch_events":"https://pith.science/api/pith-number/GF7SWB5PFCRIZ7DMPR6DPFG4J6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GF7SWB5PFCRIZ7DMPR6DPFG4J6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GF7SWB5PFCRIZ7DMPR6DPFG4J6/action/storage_attestation","attest_author":"https://pith.science/pith/GF7SWB5PFCRIZ7DMPR6DPFG4J6/action/author_attestation","sign_citation":"https://pith.science/pith/GF7SWB5PFCRIZ7DMPR6DPFG4J6/action/citation_signature","submit_replication":"https://pith.science/pith/GF7SWB5PFCRIZ7DMPR6DPFG4J6/action/replication_record"}},"created_at":"2026-05-18T02:58:21.113576+00:00","updated_at":"2026-05-18T02:58:21.113576+00:00"}