{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AODSYXPAS3FOL6V5GISDXF4VUQ","short_pith_number":"pith:AODSYXPA","canonical_record":{"source":{"id":"1309.5927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-23T19:26:16Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"ee950a15ac8fbcaca68424659e3b6454b534090625d9c38378b9b3baf3341b3d","abstract_canon_sha256":"0f13da39aa2c101bd10a9f397c7b5b2699ce02ab1c088155b539cf9f56dd743b"},"schema_version":"1.0"},"canonical_sha256":"03872c5de096cae5fabd32243b9795a43bcbfd82abaff6cf0b4b8755c3154c0e","source":{"kind":"arxiv","id":"1309.5927","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5927","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5927v1","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5927","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"AODSYXPAS3FO","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AODSYXPAS3FOL6V5","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AODSYXPA","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AODSYXPAS3FOL6V5GISDXF4VUQ","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-23T19:26:16Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"ee950a15ac8fbcaca68424659e3b6454b534090625d9c38378b9b3baf3341b3d","abstract_canon_sha256":"0f13da39aa2c101bd10a9f397c7b5b2699ce02ab1c088155b539cf9f56dd743b"},"schema_version":"1.0"},"canonical_sha256":"03872c5de096cae5fabd32243b9795a43bcbfd82abaff6cf0b4b8755c3154c0e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:33.700270Z","signature_b64":"pmQKb9y4JadVdpt06mVdfWtMLFV8j9M3g9PhyCJNzGXQLwmKLTwg4MC99ibbsP4vgKH6jPWHs4sUNs/UYiiADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03872c5de096cae5fabd32243b9795a43bcbfd82abaff6cf0b4b8755c3154c0e","last_reissued_at":"2026-05-18T03:12:33.699556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:33.699556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5927","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-18T03:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w06x1C1l3biKQs49F6K5zeVaOpArQ2sBaD8BE8RyeqdgsdwYFzCN37nExooKzh8gWHBHqBnXgZXaU9C9jqmgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:13:20.189126Z"},"content_sha256":"576fa6cb4950f27272389c363180da521c2e12607ddccb8eaceb5cd90f3bf346","schema_version":"1.0","event_id":"sha256:576fa6cb4950f27272389c363180da521c2e12607ddccb8eaceb5cd90f3bf346"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AODSYXPAS3FOL6V5GISDXF4VUQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"XML Compression via DAGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Eric Noeth, Markus Lohrey, Mireille Bousquet-Melou, Sebastian Maneth","submitted_at":"2013-09-23T19:26:16Z","abstract_excerpt":"Unranked trees can be represented using their minimal dag (directed acyclic graph). For XML this achieves high compression ratios due to their repetitive mark up. Unranked trees are often represented through first child/next sibling (fcns) encoded binary trees. We study the difference in size (= number of edges) of minimal dag versus minimal dag of the fcns encoded binary tree. One main finding is that the size of the dag of the binary tree can never be smaller than the square root of the size of the minimal dag, and that there are examples that match this bound. We introduce a new combined st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5927","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-18T03:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DTI97SG2APg3Heky+oqfKcL366I74pXFgp5Uv3Oq5mQVXQV6v0cGq0phyuR6Ksj9L3WHo6QoJH7R8i2ODm43Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:13:20.189852Z"},"content_sha256":"c87b5f78781cefa1f73d338584feb7fae59f9b645bd0504692f7f143cdb7bfa7","schema_version":"1.0","event_id":"sha256:c87b5f78781cefa1f73d338584feb7fae59f9b645bd0504692f7f143cdb7bfa7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AODSYXPAS3FOL6V5GISDXF4VUQ/bundle.json","state_url":"https://pith.science/pith/AODSYXPAS3FOL6V5GISDXF4VUQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AODSYXPAS3FOL6V5GISDXF4VUQ/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-08T14:13:20Z","links":{"resolver":"https://pith.science/pith/AODSYXPAS3FOL6V5GISDXF4VUQ","bundle":"https://pith.science/pith/AODSYXPAS3FOL6V5GISDXF4VUQ/bundle.json","state":"https://pith.science/pith/AODSYXPAS3FOL6V5GISDXF4VUQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AODSYXPAS3FOL6V5GISDXF4VUQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AODSYXPAS3FOL6V5GISDXF4VUQ","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":"0f13da39aa2c101bd10a9f397c7b5b2699ce02ab1c088155b539cf9f56dd743b","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-23T19:26:16Z","title_canon_sha256":"ee950a15ac8fbcaca68424659e3b6454b534090625d9c38378b9b3baf3341b3d"},"schema_version":"1.0","source":{"id":"1309.5927","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5927","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5927v1","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5927","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"AODSYXPAS3FO","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AODSYXPAS3FOL6V5","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AODSYXPA","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:c87b5f78781cefa1f73d338584feb7fae59f9b645bd0504692f7f143cdb7bfa7","target":"graph","created_at":"2026-05-18T03:12:33Z","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":"Unranked trees can be represented using their minimal dag (directed acyclic graph). For XML this achieves high compression ratios due to their repetitive mark up. Unranked trees are often represented through first child/next sibling (fcns) encoded binary trees. We study the difference in size (= number of edges) of minimal dag versus minimal dag of the fcns encoded binary tree. One main finding is that the size of the dag of the binary tree can never be smaller than the square root of the size of the minimal dag, and that there are examples that match this bound. We introduce a new combined st","authors_text":"Eric Noeth, Markus Lohrey, Mireille Bousquet-Melou, Sebastian Maneth","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-23T19:26:16Z","title":"XML Compression via DAGs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5927","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:576fa6cb4950f27272389c363180da521c2e12607ddccb8eaceb5cd90f3bf346","target":"record","created_at":"2026-05-18T03:12:33Z","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":"0f13da39aa2c101bd10a9f397c7b5b2699ce02ab1c088155b539cf9f56dd743b","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-23T19:26:16Z","title_canon_sha256":"ee950a15ac8fbcaca68424659e3b6454b534090625d9c38378b9b3baf3341b3d"},"schema_version":"1.0","source":{"id":"1309.5927","kind":"arxiv","version":1}},"canonical_sha256":"03872c5de096cae5fabd32243b9795a43bcbfd82abaff6cf0b4b8755c3154c0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03872c5de096cae5fabd32243b9795a43bcbfd82abaff6cf0b4b8755c3154c0e","first_computed_at":"2026-05-18T03:12:33.699556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:33.699556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pmQKb9y4JadVdpt06mVdfWtMLFV8j9M3g9PhyCJNzGXQLwmKLTwg4MC99ibbsP4vgKH6jPWHs4sUNs/UYiiADQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:33.700270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5927","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:576fa6cb4950f27272389c363180da521c2e12607ddccb8eaceb5cd90f3bf346","sha256:c87b5f78781cefa1f73d338584feb7fae59f9b645bd0504692f7f143cdb7bfa7"],"state_sha256":"b40669d8e60529ec6ec48b6a2f1173eb87d0200414ba1ba0b8853ee9e29c6dcb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8cXIVZnH1mdNzAuhVpUvAGONUbvT89W4zUh/oE/tjK5XkXc1iymMDEGMIRDl9fUsxDkZVL/cnSGBlsrY+vsADQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:13:20.193386Z","bundle_sha256":"701a4a792bfb3e9a2127f3d3a270c020f07def90129182ddaa45414f55a72779"}}