{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Y7PCETDDYHTV4OOD4AR2WPKEPS","short_pith_number":"pith:Y7PCETDD","canonical_record":{"source":{"id":"1603.07135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-23T11:15:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e04182aa656f848bd97d8a86cd611b65868a0bbd2f4578fe1473284a3df707ef","abstract_canon_sha256":"6f5935cf0fbf7e04b8dfe959f5612b0f0edea948138ae60b4b78d935d854f84a"},"schema_version":"1.0"},"canonical_sha256":"c7de224c63c1e75e39c3e023ab3d447cb73b30cab5508324409f9a5aa93d5fbd","source":{"kind":"arxiv","id":"1603.07135","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07135","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07135v1","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07135","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"Y7PCETDDYHTV","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Y7PCETDDYHTV4OOD","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Y7PCETDD","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Y7PCETDDYHTV4OOD4AR2WPKEPS","target":"record","payload":{"canonical_record":{"source":{"id":"1603.07135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-23T11:15:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e04182aa656f848bd97d8a86cd611b65868a0bbd2f4578fe1473284a3df707ef","abstract_canon_sha256":"6f5935cf0fbf7e04b8dfe959f5612b0f0edea948138ae60b4b78d935d854f84a"},"schema_version":"1.0"},"canonical_sha256":"c7de224c63c1e75e39c3e023ab3d447cb73b30cab5508324409f9a5aa93d5fbd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:24.329244Z","signature_b64":"5aLiccSc66UP7SGa6dUdSulkd3VsLLrBQ2fCkDV0fajka4zaKscp4lepQgig2chsSfQF8DjblYJ0bpKBdLsmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7de224c63c1e75e39c3e023ab3d447cb73b30cab5508324409f9a5aa93d5fbd","last_reissued_at":"2026-05-18T01:18:24.328606Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:24.328606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.07135","source_version":1,"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:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u58Q96vHB91GB7wlgpLll+Sl+wN2li1pkkX/Ln0hQSxz8atNh9sKlvbFVofxdqtLPxqwRhxwyvyM1OuQvtMwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:59:04.205399Z"},"content_sha256":"53f5cbd1c9808ff60e064e95a001a7eeeb812daf622eb25c1802a10d2d790b43","schema_version":"1.0","event_id":"sha256:53f5cbd1c9808ff60e064e95a001a7eeeb812daf622eb25c1802a10d2d790b43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Y7PCETDDYHTV4OOD4AR2WPKEPS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simplicial Complex Entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ioannis Ivrissimtzis, Stefan Dantchev","submitted_at":"2016-03-23T11:15:02Z","abstract_excerpt":"We propose an entropy function for simplicial complices. Its value gives the expected cost of the optimal encoding of sequences of vertices of the complex, when any two vertices belonging to the same simplex are indistinguishable. We show that the proposed entropy function can be computed efficiently. By computing the entropy of several complices consisting of hundreds of simplices, we show that the proposed entropy function can be used in the analysis of the large sequences of simplicial complices that often appear in computational topology applications."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07135","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":""},"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:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pXM0gYRgNTyQadYk4juK1haaNI4L/RhmWVad3ByBK4Mobc2iaA7ycrboZ4yyB6jQIqv0xZh/0MDwTWlRpHRICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:59:04.206130Z"},"content_sha256":"63f0746cfda3675213feb9cb209d9083e03f339bef7c20ebbdf0f5dbfbb5c588","schema_version":"1.0","event_id":"sha256:63f0746cfda3675213feb9cb209d9083e03f339bef7c20ebbdf0f5dbfbb5c588"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y7PCETDDYHTV4OOD4AR2WPKEPS/bundle.json","state_url":"https://pith.science/pith/Y7PCETDDYHTV4OOD4AR2WPKEPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y7PCETDDYHTV4OOD4AR2WPKEPS/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-05-25T12:59:04Z","links":{"resolver":"https://pith.science/pith/Y7PCETDDYHTV4OOD4AR2WPKEPS","bundle":"https://pith.science/pith/Y7PCETDDYHTV4OOD4AR2WPKEPS/bundle.json","state":"https://pith.science/pith/Y7PCETDDYHTV4OOD4AR2WPKEPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y7PCETDDYHTV4OOD4AR2WPKEPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Y7PCETDDYHTV4OOD4AR2WPKEPS","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":"6f5935cf0fbf7e04b8dfe959f5612b0f0edea948138ae60b4b78d935d854f84a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-23T11:15:02Z","title_canon_sha256":"e04182aa656f848bd97d8a86cd611b65868a0bbd2f4578fe1473284a3df707ef"},"schema_version":"1.0","source":{"id":"1603.07135","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07135","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07135v1","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07135","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"Y7PCETDDYHTV","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Y7PCETDDYHTV4OOD","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Y7PCETDD","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:63f0746cfda3675213feb9cb209d9083e03f339bef7c20ebbdf0f5dbfbb5c588","target":"graph","created_at":"2026-05-18T01:18:24Z","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":"We propose an entropy function for simplicial complices. Its value gives the expected cost of the optimal encoding of sequences of vertices of the complex, when any two vertices belonging to the same simplex are indistinguishable. We show that the proposed entropy function can be computed efficiently. By computing the entropy of several complices consisting of hundreds of simplices, we show that the proposed entropy function can be used in the analysis of the large sequences of simplicial complices that often appear in computational topology applications.","authors_text":"Ioannis Ivrissimtzis, Stefan Dantchev","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-23T11:15:02Z","title":"Simplicial Complex Entropy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07135","kind":"arxiv","version":1},"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:53f5cbd1c9808ff60e064e95a001a7eeeb812daf622eb25c1802a10d2d790b43","target":"record","created_at":"2026-05-18T01:18:24Z","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":"6f5935cf0fbf7e04b8dfe959f5612b0f0edea948138ae60b4b78d935d854f84a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-23T11:15:02Z","title_canon_sha256":"e04182aa656f848bd97d8a86cd611b65868a0bbd2f4578fe1473284a3df707ef"},"schema_version":"1.0","source":{"id":"1603.07135","kind":"arxiv","version":1}},"canonical_sha256":"c7de224c63c1e75e39c3e023ab3d447cb73b30cab5508324409f9a5aa93d5fbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7de224c63c1e75e39c3e023ab3d447cb73b30cab5508324409f9a5aa93d5fbd","first_computed_at":"2026-05-18T01:18:24.328606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:24.328606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5aLiccSc66UP7SGa6dUdSulkd3VsLLrBQ2fCkDV0fajka4zaKscp4lepQgig2chsSfQF8DjblYJ0bpKBdLsmDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:24.329244Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.07135","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53f5cbd1c9808ff60e064e95a001a7eeeb812daf622eb25c1802a10d2d790b43","sha256:63f0746cfda3675213feb9cb209d9083e03f339bef7c20ebbdf0f5dbfbb5c588"],"state_sha256":"21cf83f9f06bd36e42ebfd49b3501e8b30148f657e6db4ff5c52e73367d6bc80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GEKklj9IXu9/VG7RxT0/m7EYAkE/ykgoKji/Z1b+sfcS58PadplvVACqWgkkXBMFOU+klQM6JKbRHBJfuu0DBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:59:04.210984Z","bundle_sha256":"615be81f7c067be91a58b49d4a749f60ac3931dad95e1b2e4245949cb85c1a2b"}}