{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3PZQ62KX6AVLRFELRZ7FTTF6T7","short_pith_number":"pith:3PZQ62KX","schema_version":"1.0","canonical_sha256":"dbf30f6957f02ab8948b8e7e59ccbe9ffab9b02aa7096f8970d5be36ed2a451b","source":{"kind":"arxiv","id":"2411.19319","version":1},"attestation_state":"computed","paper":{"title":"Decomposing zero-dimensional persistent homology over rooted tree quivers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.AT"],"primary_cat":"math.RT","authors_text":"Luis Scoccola, Riju Bindua, Thomas Br\\\"ustle","submitted_at":"2024-11-28T18:46:35Z","abstract_excerpt":"Given a functor from any category into the category of topological spaces, one obtains a linear representation of the category by post-composing the given functor with a homology functor with field coefficients. This construction is fundamental in persistence theory, where it is known as persistent homology, and where the category is typically a poset. Persistence theory is particularly successful when the poset is a finite linearly ordered set, owing to the fact that in this case its category of representations is of finite type. We show that when the poset is a rooted tree poset (a poset wit"},"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":"2411.19319","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2024-11-28T18:46:35Z","cross_cats_sorted":["cs.CG","math.AT"],"title_canon_sha256":"c11b8d03af227f5b3f5e2037aa87eda712147dad8371a25c97c2c0801de6e96b","abstract_canon_sha256":"b186510e316c63d0dad5534a3b2303029c1cac4a33c68431d2cda1ea4f506b29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:00.756106Z","signature_b64":"+VbTlzkITbhZylvY06eoa4g+CB5EUH7MhXCoBy8cyd4ffHLxe1wfRKNks8pmhQF47aaUpejC2vGaovdnxXXRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbf30f6957f02ab8948b8e7e59ccbe9ffab9b02aa7096f8970d5be36ed2a451b","last_reissued_at":"2026-07-05T09:42:00.755596Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:00.755596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposing zero-dimensional persistent homology over rooted tree quivers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.AT"],"primary_cat":"math.RT","authors_text":"Luis Scoccola, Riju Bindua, Thomas Br\\\"ustle","submitted_at":"2024-11-28T18:46:35Z","abstract_excerpt":"Given a functor from any category into the category of topological spaces, one obtains a linear representation of the category by post-composing the given functor with a homology functor with field coefficients. This construction is fundamental in persistence theory, where it is known as persistent homology, and where the category is typically a poset. Persistence theory is particularly successful when the poset is a finite linearly ordered set, owing to the fact that in this case its category of representations is of finite type. We show that when the poset is a rooted tree poset (a poset wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.19319","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/2411.19319/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":"2411.19319","created_at":"2026-07-05T09:42:00.755662+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.19319v1","created_at":"2026-07-05T09:42:00.755662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.19319","created_at":"2026-07-05T09:42:00.755662+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PZQ62KX6AVL","created_at":"2026-07-05T09:42:00.755662+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PZQ62KX6AVLRFEL","created_at":"2026-07-05T09:42:00.755662+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PZQ62KX","created_at":"2026-07-05T09:42:00.755662+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30490","citing_title":"From Frames to Features: Scalable Zigzag Persistence for Binary Video","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3PZQ62KX6AVLRFELRZ7FTTF6T7","json":"https://pith.science/pith/3PZQ62KX6AVLRFELRZ7FTTF6T7.json","graph_json":"https://pith.science/api/pith-number/3PZQ62KX6AVLRFELRZ7FTTF6T7/graph.json","events_json":"https://pith.science/api/pith-number/3PZQ62KX6AVLRFELRZ7FTTF6T7/events.json","paper":"https://pith.science/paper/3PZQ62KX"},"agent_actions":{"view_html":"https://pith.science/pith/3PZQ62KX6AVLRFELRZ7FTTF6T7","download_json":"https://pith.science/pith/3PZQ62KX6AVLRFELRZ7FTTF6T7.json","view_paper":"https://pith.science/paper/3PZQ62KX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.19319&json=true","fetch_graph":"https://pith.science/api/pith-number/3PZQ62KX6AVLRFELRZ7FTTF6T7/graph.json","fetch_events":"https://pith.science/api/pith-number/3PZQ62KX6AVLRFELRZ7FTTF6T7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PZQ62KX6AVLRFELRZ7FTTF6T7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PZQ62KX6AVLRFELRZ7FTTF6T7/action/storage_attestation","attest_author":"https://pith.science/pith/3PZQ62KX6AVLRFELRZ7FTTF6T7/action/author_attestation","sign_citation":"https://pith.science/pith/3PZQ62KX6AVLRFELRZ7FTTF6T7/action/citation_signature","submit_replication":"https://pith.science/pith/3PZQ62KX6AVLRFELRZ7FTTF6T7/action/replication_record"}},"created_at":"2026-07-05T09:42:00.755662+00:00","updated_at":"2026-07-05T09:42:00.755662+00:00"}