{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NI6SHCYI7QCD7ENLGEOHMSZHMX","short_pith_number":"pith:NI6SHCYI","schema_version":"1.0","canonical_sha256":"6a3d238b08fc043f91ab311c764b2765f58af98d992cf58e64f6784b255d32af","source":{"kind":"arxiv","id":"2412.04889","version":2},"attestation_state":"computed","paper":{"title":"Super-Polynomial Growth of the Generalized Persistence Diagram","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.AT","authors_text":"Donghan Kim, Wonjun Lee, Woojin Kim","submitted_at":"2024-12-06T09:39:36Z","abstract_excerpt":"The Generalized Persistence Diagram (GPD) for multi-parameter persistence naturally extends the classical notion of persistence diagram for one-parameter persistence. However, unlike its classical counterpart, computing the GPD remains a significant challenge. The main hurdle is that, while the GPD is defined as the M\\\"obius inversion of the Generalized Rank Invariant (GRI), computing the GRI is intractable due to the formidable size of its domain, i.e., the set of all connected and convex subsets in a finite grid in $\\mathbb{R}^d$ with $d \\geq 2$. This computational intractability suggests se"},"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":"2412.04889","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2024-12-06T09:39:36Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"561a5df744aa6b6a6dbfb78c1ca6b37ca37d2e62ae24f9e55fddff93ea6005ac","abstract_canon_sha256":"dc73d1e5b4749d140aad118e0ef4469de2b98ef54db63dd93be01003f62bb109"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:49:11.606589Z","signature_b64":"Tb02w0dI9M59RklFpB+kJu5UGvyzJ2StLCX2+Fle/XTGsgE9TVjHSFRiN5Rkfiv6WeXZo49womffwtzIXT3uAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a3d238b08fc043f91ab311c764b2765f58af98d992cf58e64f6784b255d32af","last_reissued_at":"2026-07-05T10:49:11.606095Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:49:11.606095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Super-Polynomial Growth of the Generalized Persistence Diagram","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.AT","authors_text":"Donghan Kim, Wonjun Lee, Woojin Kim","submitted_at":"2024-12-06T09:39:36Z","abstract_excerpt":"The Generalized Persistence Diagram (GPD) for multi-parameter persistence naturally extends the classical notion of persistence diagram for one-parameter persistence. However, unlike its classical counterpart, computing the GPD remains a significant challenge. The main hurdle is that, while the GPD is defined as the M\\\"obius inversion of the Generalized Rank Invariant (GRI), computing the GRI is intractable due to the formidable size of its domain, i.e., the set of all connected and convex subsets in a finite grid in $\\mathbb{R}^d$ with $d \\geq 2$. This computational intractability suggests se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.04889","kind":"arxiv","version":2},"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/2412.04889/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":"2412.04889","created_at":"2026-07-05T10:49:11.606155+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.04889v2","created_at":"2026-07-05T10:49:11.606155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.04889","created_at":"2026-07-05T10:49:11.606155+00:00"},{"alias_kind":"pith_short_12","alias_value":"NI6SHCYI7QCD","created_at":"2026-07-05T10:49:11.606155+00:00"},{"alias_kind":"pith_short_16","alias_value":"NI6SHCYI7QCD7ENL","created_at":"2026-07-05T10:49:11.606155+00:00"},{"alias_kind":"pith_short_8","alias_value":"NI6SHCYI","created_at":"2026-07-05T10:49:11.606155+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.05900","citing_title":"Sparsification of the Generalized Persistence Diagrams for Scalability through Gradient Descent","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NI6SHCYI7QCD7ENLGEOHMSZHMX","json":"https://pith.science/pith/NI6SHCYI7QCD7ENLGEOHMSZHMX.json","graph_json":"https://pith.science/api/pith-number/NI6SHCYI7QCD7ENLGEOHMSZHMX/graph.json","events_json":"https://pith.science/api/pith-number/NI6SHCYI7QCD7ENLGEOHMSZHMX/events.json","paper":"https://pith.science/paper/NI6SHCYI"},"agent_actions":{"view_html":"https://pith.science/pith/NI6SHCYI7QCD7ENLGEOHMSZHMX","download_json":"https://pith.science/pith/NI6SHCYI7QCD7ENLGEOHMSZHMX.json","view_paper":"https://pith.science/paper/NI6SHCYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.04889&json=true","fetch_graph":"https://pith.science/api/pith-number/NI6SHCYI7QCD7ENLGEOHMSZHMX/graph.json","fetch_events":"https://pith.science/api/pith-number/NI6SHCYI7QCD7ENLGEOHMSZHMX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NI6SHCYI7QCD7ENLGEOHMSZHMX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NI6SHCYI7QCD7ENLGEOHMSZHMX/action/storage_attestation","attest_author":"https://pith.science/pith/NI6SHCYI7QCD7ENLGEOHMSZHMX/action/author_attestation","sign_citation":"https://pith.science/pith/NI6SHCYI7QCD7ENLGEOHMSZHMX/action/citation_signature","submit_replication":"https://pith.science/pith/NI6SHCYI7QCD7ENLGEOHMSZHMX/action/replication_record"}},"created_at":"2026-07-05T10:49:11.606155+00:00","updated_at":"2026-07-05T10:49:11.606155+00:00"}