{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BHLNN2CIX2TK3U6TWGXKGIPXWA","short_pith_number":"pith:BHLNN2CI","schema_version":"1.0","canonical_sha256":"09d6d6e848bea6add3d3b1aea321f7b02aac912197521c608ef72592663f4da0","source":{"kind":"arxiv","id":"2408.11180","version":1},"attestation_state":"computed","paper":{"title":"Any Graph is a Mapper Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.AT","authors_text":"Emilie Purvine, Enrique G Alvarado, Kang-Ju Lee, Robin Belton, Sarah Percival, Sarah Tymochko, Sourabh Palande","submitted_at":"2024-08-20T20:22:56Z","abstract_excerpt":"The Mapper algorithm is a popular tool for visualization and data exploration in topological data analysis. We investigate an inverse problem for the Mapper algorithm: Given a dataset $X$ and a graph $G$, does there exist a set of Mapper parameters such that the output Mapper graph of $X$ is isomorphic to $G$? We provide constructions that affirmatively answer this question. Our results demonstrate that it is possible to engineer Mapper parameters to generate a desired graph."},"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":"2408.11180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2024-08-20T20:22:56Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"e5e02acef07c0a65de4facee815de81735b763fabbc405c6ecc154966022557a","abstract_canon_sha256":"4f24e1e694b4aeaac3d8eba329567937a031add53293136ab6e9a27ebb1bcba1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:57:26.047487Z","signature_b64":"HbQ8+vwAWBdXimRpd+kN7+2vNlS4BYCqPS7V6wAJT7TAv1ckDC73BlUqIkHaSwQ2qMrJVUmPZkZdnCyphD1zBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09d6d6e848bea6add3d3b1aea321f7b02aac912197521c608ef72592663f4da0","last_reissued_at":"2026-07-05T08:57:26.047099Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:57:26.047099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Any Graph is a Mapper Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.AT","authors_text":"Emilie Purvine, Enrique G Alvarado, Kang-Ju Lee, Robin Belton, Sarah Percival, Sarah Tymochko, Sourabh Palande","submitted_at":"2024-08-20T20:22:56Z","abstract_excerpt":"The Mapper algorithm is a popular tool for visualization and data exploration in topological data analysis. We investigate an inverse problem for the Mapper algorithm: Given a dataset $X$ and a graph $G$, does there exist a set of Mapper parameters such that the output Mapper graph of $X$ is isomorphic to $G$? We provide constructions that affirmatively answer this question. Our results demonstrate that it is possible to engineer Mapper parameters to generate a desired graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.11180","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/2408.11180/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":"2408.11180","created_at":"2026-07-05T08:57:26.047151+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.11180v1","created_at":"2026-07-05T08:57:26.047151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.11180","created_at":"2026-07-05T08:57:26.047151+00:00"},{"alias_kind":"pith_short_12","alias_value":"BHLNN2CIX2TK","created_at":"2026-07-05T08:57:26.047151+00:00"},{"alias_kind":"pith_short_16","alias_value":"BHLNN2CIX2TK3U6T","created_at":"2026-07-05T08:57:26.047151+00:00"},{"alias_kind":"pith_short_8","alias_value":"BHLNN2CI","created_at":"2026-07-05T08:57:26.047151+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2504.03865","citing_title":"Towards an Optimal Bound for the Interleaving Distance on Mapper Graphs","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BHLNN2CIX2TK3U6TWGXKGIPXWA","json":"https://pith.science/pith/BHLNN2CIX2TK3U6TWGXKGIPXWA.json","graph_json":"https://pith.science/api/pith-number/BHLNN2CIX2TK3U6TWGXKGIPXWA/graph.json","events_json":"https://pith.science/api/pith-number/BHLNN2CIX2TK3U6TWGXKGIPXWA/events.json","paper":"https://pith.science/paper/BHLNN2CI"},"agent_actions":{"view_html":"https://pith.science/pith/BHLNN2CIX2TK3U6TWGXKGIPXWA","download_json":"https://pith.science/pith/BHLNN2CIX2TK3U6TWGXKGIPXWA.json","view_paper":"https://pith.science/paper/BHLNN2CI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.11180&json=true","fetch_graph":"https://pith.science/api/pith-number/BHLNN2CIX2TK3U6TWGXKGIPXWA/graph.json","fetch_events":"https://pith.science/api/pith-number/BHLNN2CIX2TK3U6TWGXKGIPXWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BHLNN2CIX2TK3U6TWGXKGIPXWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BHLNN2CIX2TK3U6TWGXKGIPXWA/action/storage_attestation","attest_author":"https://pith.science/pith/BHLNN2CIX2TK3U6TWGXKGIPXWA/action/author_attestation","sign_citation":"https://pith.science/pith/BHLNN2CIX2TK3U6TWGXKGIPXWA/action/citation_signature","submit_replication":"https://pith.science/pith/BHLNN2CIX2TK3U6TWGXKGIPXWA/action/replication_record"}},"created_at":"2026-07-05T08:57:26.047151+00:00","updated_at":"2026-07-05T08:57:26.047151+00:00"}