{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:A5VYFLMCKJVNZSYWM2VQG2EQXX","short_pith_number":"pith:A5VYFLMC","schema_version":"1.0","canonical_sha256":"076b82ad82526adccb1666ab036890bde6b44141cdd8bc7985dc1cd33524f47e","source":{"kind":"arxiv","id":"2012.00090","version":1},"attestation_state":"computed","paper":{"title":"Clustering of CODEX clusters","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"astro-ph.CO","authors_text":"Alexis Finoguenov, Charles C. Kirkpatrick, Chris Collins, Eli Rykoff, Jacob Ider Chitham, Johan Comparat, Nelson Padilla, Nicolas Clerc, Sanna Damsted, Valtteri Lindholm","submitted_at":"2020-11-30T20:53:08Z","abstract_excerpt":"Aims. We analyze the autocorrelation function of a large contiguous sample of galaxy clusters, the Constrain Dark Energy with X-ray (CODEX) sample, in which we take particular care of cluster definition. These clusters were X-ray selected using the RASS survey and then identified as galaxy clusters using the code redMaPPer run on the photometry of the SDSS. We develop methods for precisely accounting for the sample selection effects on the clustering and demonstrate their robustness using numerical simulations. Methods. Using the clean CODEX sample, which was obtained by applying a redshift-de"},"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":"2012.00090","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"astro-ph.CO","submitted_at":"2020-11-30T20:53:08Z","cross_cats_sorted":[],"title_canon_sha256":"e9989ee176016bb2516a8ceaade0ca1c4f5714726c61b371e04c8a7fbdb4a717","abstract_canon_sha256":"b699abe89462c40ef788efdf48ece17f91f0266d29f8eb1bb0b5c5fdcbd4be30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:25:08.580133Z","signature_b64":"gmAZ2W1VxdmcBo2ENeeM8ctDCBFP1sMGfaPTnW68zF5wvMMqm8NPDQOJmkT5shmDDfckBONpVEFfuznGgHDmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"076b82ad82526adccb1666ab036890bde6b44141cdd8bc7985dc1cd33524f47e","last_reissued_at":"2026-07-05T04:25:08.579629Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:25:08.579629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering of CODEX clusters","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"astro-ph.CO","authors_text":"Alexis Finoguenov, Charles C. Kirkpatrick, Chris Collins, Eli Rykoff, Jacob Ider Chitham, Johan Comparat, Nelson Padilla, Nicolas Clerc, Sanna Damsted, Valtteri Lindholm","submitted_at":"2020-11-30T20:53:08Z","abstract_excerpt":"Aims. We analyze the autocorrelation function of a large contiguous sample of galaxy clusters, the Constrain Dark Energy with X-ray (CODEX) sample, in which we take particular care of cluster definition. These clusters were X-ray selected using the RASS survey and then identified as galaxy clusters using the code redMaPPer run on the photometry of the SDSS. We develop methods for precisely accounting for the sample selection effects on the clustering and demonstrate their robustness using numerical simulations. Methods. Using the clean CODEX sample, which was obtained by applying a redshift-de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.00090","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.00090/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2012.00090","created_at":"2026-07-05T04:25:08.579690+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.00090v1","created_at":"2026-07-05T04:25:08.579690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.00090","created_at":"2026-07-05T04:25:08.579690+00:00"},{"alias_kind":"pith_short_12","alias_value":"A5VYFLMCKJVN","created_at":"2026-07-05T04:25:08.579690+00:00"},{"alias_kind":"pith_short_16","alias_value":"A5VYFLMCKJVNZSYW","created_at":"2026-07-05T04:25:08.579690+00:00"},{"alias_kind":"pith_short_8","alias_value":"A5VYFLMC","created_at":"2026-07-05T04:25:08.579690+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.04966","citing_title":"Programmable superconducting neuron with intrinsic in-memory computation and dual-timescale plasticity for ultra-efficient neuromorphic computing","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A5VYFLMCKJVNZSYWM2VQG2EQXX","json":"https://pith.science/pith/A5VYFLMCKJVNZSYWM2VQG2EQXX.json","graph_json":"https://pith.science/api/pith-number/A5VYFLMCKJVNZSYWM2VQG2EQXX/graph.json","events_json":"https://pith.science/api/pith-number/A5VYFLMCKJVNZSYWM2VQG2EQXX/events.json","paper":"https://pith.science/paper/A5VYFLMC"},"agent_actions":{"view_html":"https://pith.science/pith/A5VYFLMCKJVNZSYWM2VQG2EQXX","download_json":"https://pith.science/pith/A5VYFLMCKJVNZSYWM2VQG2EQXX.json","view_paper":"https://pith.science/paper/A5VYFLMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.00090&json=true","fetch_graph":"https://pith.science/api/pith-number/A5VYFLMCKJVNZSYWM2VQG2EQXX/graph.json","fetch_events":"https://pith.science/api/pith-number/A5VYFLMCKJVNZSYWM2VQG2EQXX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A5VYFLMCKJVNZSYWM2VQG2EQXX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A5VYFLMCKJVNZSYWM2VQG2EQXX/action/storage_attestation","attest_author":"https://pith.science/pith/A5VYFLMCKJVNZSYWM2VQG2EQXX/action/author_attestation","sign_citation":"https://pith.science/pith/A5VYFLMCKJVNZSYWM2VQG2EQXX/action/citation_signature","submit_replication":"https://pith.science/pith/A5VYFLMCKJVNZSYWM2VQG2EQXX/action/replication_record"}},"created_at":"2026-07-05T04:25:08.579690+00:00","updated_at":"2026-07-05T04:25:08.579690+00:00"}