{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:UO4CAFBI5CWIM7GY6HPCALUMLM","short_pith_number":"pith:UO4CAFBI","canonical_record":{"source":{"id":"1010.5537","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2010-10-26T23:24:02Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a6ac50b4264bee53a2b4ff91f9e74ee415060a81a54eab5cc7605a08e7cd04b9","abstract_canon_sha256":"7b50f582066179cdde7d88ce17db6ec0fb53e6f14fb8c8cd54f0eb4f60e784e1"},"schema_version":"1.0"},"canonical_sha256":"a3b8201428e8ac867cd8f1de202e8c5b1f3559f2f897dec09f2df2e231a9f396","source":{"kind":"arxiv","id":"1010.5537","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5537","created_at":"2026-05-18T03:55:56Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5537v2","created_at":"2026-05-18T03:55:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5537","created_at":"2026-05-18T03:55:56Z"},{"alias_kind":"pith_short_12","alias_value":"UO4CAFBI5CWI","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UO4CAFBI5CWIM7GY","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UO4CAFBI","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:UO4CAFBI5CWIM7GY6HPCALUMLM","target":"record","payload":{"canonical_record":{"source":{"id":"1010.5537","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2010-10-26T23:24:02Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a6ac50b4264bee53a2b4ff91f9e74ee415060a81a54eab5cc7605a08e7cd04b9","abstract_canon_sha256":"7b50f582066179cdde7d88ce17db6ec0fb53e6f14fb8c8cd54f0eb4f60e784e1"},"schema_version":"1.0"},"canonical_sha256":"a3b8201428e8ac867cd8f1de202e8c5b1f3559f2f897dec09f2df2e231a9f396","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:56.278820Z","signature_b64":"OY8x4kmPOaCptx0EY65x0IGqQ2yyU9SKGmasN1Ih1/2nVtI2fAiGkGp+KqbDfxq+uuucpM0wiWVou1dy8OchDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3b8201428e8ac867cd8f1de202e8c5b1f3559f2f897dec09f2df2e231a9f396","last_reissued_at":"2026-05-18T03:55:56.278143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:56.278143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.5537","source_version":2,"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-18T03:55:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KN/POEDssrvsx+l767+/SZS0vLk73T36Vd4bcbtFKVxpaAINSj6KG4y30C1OCMfgFrLf0HXVJzX6X589CnoiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:36:57.802097Z"},"content_sha256":"311c23edee981dff16ace1db3eef97930cc3d709b103be41e2322017c4b66f0e","schema_version":"1.0","event_id":"sha256:311c23edee981dff16ace1db3eef97930cc3d709b103be41e2322017c4b66f0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:UO4CAFBI5CWIM7GY6HPCALUMLM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using entropy measures for comparison of software traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SE","authors_text":"A. V. Miranskyy, M. Davison, M. Reesor, S. S. Murtaza","submitted_at":"2010-10-26T23:24:02Z","abstract_excerpt":"The analysis of execution paths (also known as software traces) collected from a given software product can help in a number of areas including software testing, software maintenance and program comprehension. The lack of a scalable matching algorithm operating on detailed execution paths motivates the search for an alternative solution.\n  This paper proposes the use of word entropies for the classification of software traces. Using a well-studied defective software as an example, we investigate the application of both Shannon and extended entropies (Landsberg-Vedral, R\\'{e}nyi and Tsallis) to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5537","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":""},"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-18T03:55:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H4jJeYQdmpKX9qF3ci2QA6LSbTfGxVV0wQ3Y/If4ti9NmxipBsBFTTCVu8Haw5X0FK0AY5uw7uBXkYYuJc14Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:36:57.802462Z"},"content_sha256":"33c12627b667e773ab9e67a7e962ae7c1f207cc47f1aba700e1150533be17fd8","schema_version":"1.0","event_id":"sha256:33c12627b667e773ab9e67a7e962ae7c1f207cc47f1aba700e1150533be17fd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UO4CAFBI5CWIM7GY6HPCALUMLM/bundle.json","state_url":"https://pith.science/pith/UO4CAFBI5CWIM7GY6HPCALUMLM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UO4CAFBI5CWIM7GY6HPCALUMLM/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-05T03:36:57Z","links":{"resolver":"https://pith.science/pith/UO4CAFBI5CWIM7GY6HPCALUMLM","bundle":"https://pith.science/pith/UO4CAFBI5CWIM7GY6HPCALUMLM/bundle.json","state":"https://pith.science/pith/UO4CAFBI5CWIM7GY6HPCALUMLM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UO4CAFBI5CWIM7GY6HPCALUMLM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:UO4CAFBI5CWIM7GY6HPCALUMLM","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":"7b50f582066179cdde7d88ce17db6ec0fb53e6f14fb8c8cd54f0eb4f60e784e1","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2010-10-26T23:24:02Z","title_canon_sha256":"a6ac50b4264bee53a2b4ff91f9e74ee415060a81a54eab5cc7605a08e7cd04b9"},"schema_version":"1.0","source":{"id":"1010.5537","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5537","created_at":"2026-05-18T03:55:56Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5537v2","created_at":"2026-05-18T03:55:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5537","created_at":"2026-05-18T03:55:56Z"},{"alias_kind":"pith_short_12","alias_value":"UO4CAFBI5CWI","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UO4CAFBI5CWIM7GY","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UO4CAFBI","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:33c12627b667e773ab9e67a7e962ae7c1f207cc47f1aba700e1150533be17fd8","target":"graph","created_at":"2026-05-18T03:55:56Z","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 analysis of execution paths (also known as software traces) collected from a given software product can help in a number of areas including software testing, software maintenance and program comprehension. The lack of a scalable matching algorithm operating on detailed execution paths motivates the search for an alternative solution.\n  This paper proposes the use of word entropies for the classification of software traces. Using a well-studied defective software as an example, we investigate the application of both Shannon and extended entropies (Landsberg-Vedral, R\\'{e}nyi and Tsallis) to","authors_text":"A. V. Miranskyy, M. Davison, M. Reesor, S. S. Murtaza","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2010-10-26T23:24:02Z","title":"Using entropy measures for comparison of software traces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5537","kind":"arxiv","version":2},"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:311c23edee981dff16ace1db3eef97930cc3d709b103be41e2322017c4b66f0e","target":"record","created_at":"2026-05-18T03:55:56Z","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":"7b50f582066179cdde7d88ce17db6ec0fb53e6f14fb8c8cd54f0eb4f60e784e1","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2010-10-26T23:24:02Z","title_canon_sha256":"a6ac50b4264bee53a2b4ff91f9e74ee415060a81a54eab5cc7605a08e7cd04b9"},"schema_version":"1.0","source":{"id":"1010.5537","kind":"arxiv","version":2}},"canonical_sha256":"a3b8201428e8ac867cd8f1de202e8c5b1f3559f2f897dec09f2df2e231a9f396","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3b8201428e8ac867cd8f1de202e8c5b1f3559f2f897dec09f2df2e231a9f396","first_computed_at":"2026-05-18T03:55:56.278143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:56.278143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OY8x4kmPOaCptx0EY65x0IGqQ2yyU9SKGmasN1Ih1/2nVtI2fAiGkGp+KqbDfxq+uuucpM0wiWVou1dy8OchDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:56.278820Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.5537","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:311c23edee981dff16ace1db3eef97930cc3d709b103be41e2322017c4b66f0e","sha256:33c12627b667e773ab9e67a7e962ae7c1f207cc47f1aba700e1150533be17fd8"],"state_sha256":"e3093a687f09ed9775e92dd8280ec45bf6c40345ecffad92cf6731e03610733e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZUnqskbcUGsB7dgu72W0ssOKhPRw8QdAPu0IFWijn1/D1evyZdK3pcQbXgOEMxohJqifCB2IQvPtz1n9pVdcBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:36:57.804570Z","bundle_sha256":"c008a8635e75d40f9a3cd3160f6ca570f90dd99713d6e86ddc98ec7b0eff7794"}}