{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RF6ZELIAUKVIMZS7RURFI5DJMJ","short_pith_number":"pith:RF6ZELIA","canonical_record":{"source":{"id":"1503.07444","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-03-25T16:26:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bab9ac1e107f41f8600136e0147c2850fda45c0923668bf00c5977eb16d2f8e4","abstract_canon_sha256":"a1a63764334e519e100dd4b38fd06b7d58a4ff8c747eb9b7116e3c75ce1fe0e8"},"schema_version":"1.0"},"canonical_sha256":"897d922d00a2aa86665f8d22547469624e21bcf548767d58e886cfb868e2b53f","source":{"kind":"arxiv","id":"1503.07444","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07444","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07444v4","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07444","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"pith_short_12","alias_value":"RF6ZELIAUKVI","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RF6ZELIAUKVIMZS7","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RF6ZELIA","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RF6ZELIAUKVIMZS7RURFI5DJMJ","target":"record","payload":{"canonical_record":{"source":{"id":"1503.07444","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-03-25T16:26:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bab9ac1e107f41f8600136e0147c2850fda45c0923668bf00c5977eb16d2f8e4","abstract_canon_sha256":"a1a63764334e519e100dd4b38fd06b7d58a4ff8c747eb9b7116e3c75ce1fe0e8"},"schema_version":"1.0"},"canonical_sha256":"897d922d00a2aa86665f8d22547469624e21bcf548767d58e886cfb868e2b53f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:10.367977Z","signature_b64":"yAkGcByz6vsjQn2DKDd06v7pp5wWKokU8ae2Tmw8acm/CnYWaOLMbHGepMd8yuh55VTsr2TdGqS7zG042738Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"897d922d00a2aa86665f8d22547469624e21bcf548767d58e886cfb868e2b53f","last_reissued_at":"2026-05-18T01:00:10.367370Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:10.367370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.07444","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:00:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dKfw4kuXAOfYXqunrNK7NBgeze5xjIJnK7fNqtlylYwFwt5pKePLZRZb+91YGmu67T5xXdO95FB+sbKPJVFsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:26:55.626965Z"},"content_sha256":"fcaa73447a52748eae81aa0c7185973bf218045ccc4db5325b8f962956eb0d80","schema_version":"1.0","event_id":"sha256:fcaa73447a52748eae81aa0c7185973bf218045ccc4db5325b8f962956eb0d80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RF6ZELIAUKVIMZS7RURFI5DJMJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Building Efficient and Compact Data Structures for Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Jean-Daniel Boissonnat, Karthik C. S., S\\'ebastien Tavenas","submitted_at":"2015-03-25T16:26:30Z","abstract_excerpt":"The Simplex Tree (ST) is a recently introduced data structure that can represent abstract simplicial complexes of any dimension and allows efficient implementation of a large range of basic operations on simplicial complexes. In this paper, we show how to optimally compress the Simplex Tree while retaining its functionalities. In addition, we propose two new data structures called the Maximal Simplex Tree (MxST) and the Simplex Array List (SAL). We analyze the compressed Simplex Tree, the Maximal Simplex Tree, and the Simplex Array List under various settings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07444","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:00:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zNO0BoYxytUr5ZBYIMHVGqBULansVsra4ZHoSMhlAWieVK5AkYAuTa+Cbrc47RiDhcO2dvrLjGND+E9dVwAKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:26:55.627325Z"},"content_sha256":"8436ef9a377f097513f853b8a116b89fb6b3248a5d54fcea6dc5774ce5e50c6e","schema_version":"1.0","event_id":"sha256:8436ef9a377f097513f853b8a116b89fb6b3248a5d54fcea6dc5774ce5e50c6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RF6ZELIAUKVIMZS7RURFI5DJMJ/bundle.json","state_url":"https://pith.science/pith/RF6ZELIAUKVIMZS7RURFI5DJMJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RF6ZELIAUKVIMZS7RURFI5DJMJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T23:26:55Z","links":{"resolver":"https://pith.science/pith/RF6ZELIAUKVIMZS7RURFI5DJMJ","bundle":"https://pith.science/pith/RF6ZELIAUKVIMZS7RURFI5DJMJ/bundle.json","state":"https://pith.science/pith/RF6ZELIAUKVIMZS7RURFI5DJMJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RF6ZELIAUKVIMZS7RURFI5DJMJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RF6ZELIAUKVIMZS7RURFI5DJMJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a1a63764334e519e100dd4b38fd06b7d58a4ff8c747eb9b7116e3c75ce1fe0e8","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-03-25T16:26:30Z","title_canon_sha256":"bab9ac1e107f41f8600136e0147c2850fda45c0923668bf00c5977eb16d2f8e4"},"schema_version":"1.0","source":{"id":"1503.07444","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07444","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07444v4","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07444","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"pith_short_12","alias_value":"RF6ZELIAUKVI","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RF6ZELIAUKVIMZS7","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RF6ZELIA","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:8436ef9a377f097513f853b8a116b89fb6b3248a5d54fcea6dc5774ce5e50c6e","target":"graph","created_at":"2026-05-18T01:00:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The Simplex Tree (ST) is a recently introduced data structure that can represent abstract simplicial complexes of any dimension and allows efficient implementation of a large range of basic operations on simplicial complexes. In this paper, we show how to optimally compress the Simplex Tree while retaining its functionalities. In addition, we propose two new data structures called the Maximal Simplex Tree (MxST) and the Simplex Array List (SAL). We analyze the compressed Simplex Tree, the Maximal Simplex Tree, and the Simplex Array List under various settings.","authors_text":"Jean-Daniel Boissonnat, Karthik C. S., S\\'ebastien Tavenas","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-03-25T16:26:30Z","title":"Building Efficient and Compact Data Structures for Simplicial Complexes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07444","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fcaa73447a52748eae81aa0c7185973bf218045ccc4db5325b8f962956eb0d80","target":"record","created_at":"2026-05-18T01:00:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a1a63764334e519e100dd4b38fd06b7d58a4ff8c747eb9b7116e3c75ce1fe0e8","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-03-25T16:26:30Z","title_canon_sha256":"bab9ac1e107f41f8600136e0147c2850fda45c0923668bf00c5977eb16d2f8e4"},"schema_version":"1.0","source":{"id":"1503.07444","kind":"arxiv","version":4}},"canonical_sha256":"897d922d00a2aa86665f8d22547469624e21bcf548767d58e886cfb868e2b53f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"897d922d00a2aa86665f8d22547469624e21bcf548767d58e886cfb868e2b53f","first_computed_at":"2026-05-18T01:00:10.367370Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:10.367370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yAkGcByz6vsjQn2DKDd06v7pp5wWKokU8ae2Tmw8acm/CnYWaOLMbHGepMd8yuh55VTsr2TdGqS7zG042738Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:10.367977Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.07444","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcaa73447a52748eae81aa0c7185973bf218045ccc4db5325b8f962956eb0d80","sha256:8436ef9a377f097513f853b8a116b89fb6b3248a5d54fcea6dc5774ce5e50c6e"],"state_sha256":"a236984957f702f992a463e627b498f84d1adcda5471f0830387edc996d3c299"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LuIAP2xEz85Br8657noxsl7G6jOitKwskEKswvD55HXWKVAGpxBv537Y2YlBf84Fgy7D7MlBYjlIPujh4f57Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T23:26:55.629471Z","bundle_sha256":"b35e1a49596753014a73ab1a33696338454e4e4aaee697006bbac72c16f1d2df"}}