{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IFWMGPDQIT37AJJIBXJQIP3AKA","short_pith_number":"pith:IFWMGPDQ","canonical_record":{"source":{"id":"1401.2538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-11T15:01:49Z","cross_cats_sorted":[],"title_canon_sha256":"da150a7d5e7a9fc9d8329e04b3d9640647afc0c2549776be9c4e255ca470fe3a","abstract_canon_sha256":"fcf7481afc06e9bbc95bc2964d1447a845cfb2aa04ce156c443967bcc43d5500"},"schema_version":"1.0"},"canonical_sha256":"416cc33c7044f7f025280dd3043f60501b0b20a9b78dd7008da1b9f5fdaf5d1f","source":{"kind":"arxiv","id":"1401.2538","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2538","created_at":"2026-05-18T02:53:29Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2538v1","created_at":"2026-05-18T02:53:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2538","created_at":"2026-05-18T02:53:29Z"},{"alias_kind":"pith_short_12","alias_value":"IFWMGPDQIT37","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IFWMGPDQIT37AJJI","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IFWMGPDQ","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IFWMGPDQIT37AJJIBXJQIP3AKA","target":"record","payload":{"canonical_record":{"source":{"id":"1401.2538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-11T15:01:49Z","cross_cats_sorted":[],"title_canon_sha256":"da150a7d5e7a9fc9d8329e04b3d9640647afc0c2549776be9c4e255ca470fe3a","abstract_canon_sha256":"fcf7481afc06e9bbc95bc2964d1447a845cfb2aa04ce156c443967bcc43d5500"},"schema_version":"1.0"},"canonical_sha256":"416cc33c7044f7f025280dd3043f60501b0b20a9b78dd7008da1b9f5fdaf5d1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:29.748979Z","signature_b64":"hTZEBNYZHGmHplBBFxWzuxnq6jRZJCCXFlecWa1s6KYgTTKrMkSFpoeZgZlflNpW3q+1vZK5/TS+xd8wls1eDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"416cc33c7044f7f025280dd3043f60501b0b20a9b78dd7008da1b9f5fdaf5d1f","last_reissued_at":"2026-05-18T02:53:29.748278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:29.748278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.2538","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-18T02:53:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u3YKYfVB7wcV1me/C1A3kdCgYceS2VfStC/n29kIzdTQFXEUxcjFtrncTshGbvRQT34+Hsf7nQW73OxIOj9RAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T11:26:22.221198Z"},"content_sha256":"560a6bede4de2b1293d3b855a04f660f82eb9d7488d811fefa94aabd96314949","schema_version":"1.0","event_id":"sha256:560a6bede4de2b1293d3b855a04f660f82eb9d7488d811fefa94aabd96314949"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IFWMGPDQIT37AJJIBXJQIP3AKA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hsueh-I Lu","submitted_at":"2014-01-11T15:01:49Z","abstract_excerpt":"A $\\textit{compression scheme}$ $A$ for a class $\\mathbb{G}$ of graphs consists of an encoding algorithm $\\textit{Encode}_A$ that computes a binary string $\\textit{Code}_A(G)$ for any given graph $G$ in $\\mathbb{G}$ and a decoding algorithm $\\textit{Decode}_A$ that recovers $G$ from $\\textit{Code}_A(G)$. A compression scheme $A$ for $\\mathbb{G}$ is $\\textit{optimal}$ if both $\\textit{Encode}_A$ and $\\textit{Decode}_A$ run in linear time and the number of bits of $\\textit{Code}_A(G)$ for any $n$-node graph $G$ in $\\mathbb{G}$ is information-theoretically optimal to within lower-order terms. Tre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2538","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-18T02:53:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JG7v4L4cI9K+ySZDPeD2Q48nVn7hzVi2DLV0iiezqzFiAU0o8qn71DJJS/nQBoqDBoeCgxPjtKyP9dXQetxyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T11:26:22.221547Z"},"content_sha256":"76cddd3cb668db2359e7ad4f6687d184603e92505d9bf5794f57ccb6aca026a9","schema_version":"1.0","event_id":"sha256:76cddd3cb668db2359e7ad4f6687d184603e92505d9bf5794f57ccb6aca026a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFWMGPDQIT37AJJIBXJQIP3AKA/bundle.json","state_url":"https://pith.science/pith/IFWMGPDQIT37AJJIBXJQIP3AKA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFWMGPDQIT37AJJIBXJQIP3AKA/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-07-03T11:26:22Z","links":{"resolver":"https://pith.science/pith/IFWMGPDQIT37AJJIBXJQIP3AKA","bundle":"https://pith.science/pith/IFWMGPDQIT37AJJIBXJQIP3AKA/bundle.json","state":"https://pith.science/pith/IFWMGPDQIT37AJJIBXJQIP3AKA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFWMGPDQIT37AJJIBXJQIP3AKA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IFWMGPDQIT37AJJIBXJQIP3AKA","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":"fcf7481afc06e9bbc95bc2964d1447a845cfb2aa04ce156c443967bcc43d5500","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-11T15:01:49Z","title_canon_sha256":"da150a7d5e7a9fc9d8329e04b3d9640647afc0c2549776be9c4e255ca470fe3a"},"schema_version":"1.0","source":{"id":"1401.2538","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2538","created_at":"2026-05-18T02:53:29Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2538v1","created_at":"2026-05-18T02:53:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2538","created_at":"2026-05-18T02:53:29Z"},{"alias_kind":"pith_short_12","alias_value":"IFWMGPDQIT37","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IFWMGPDQIT37AJJI","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IFWMGPDQ","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:76cddd3cb668db2359e7ad4f6687d184603e92505d9bf5794f57ccb6aca026a9","target":"graph","created_at":"2026-05-18T02:53:29Z","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":"A $\\textit{compression scheme}$ $A$ for a class $\\mathbb{G}$ of graphs consists of an encoding algorithm $\\textit{Encode}_A$ that computes a binary string $\\textit{Code}_A(G)$ for any given graph $G$ in $\\mathbb{G}$ and a decoding algorithm $\\textit{Decode}_A$ that recovers $G$ from $\\textit{Code}_A(G)$. A compression scheme $A$ for $\\mathbb{G}$ is $\\textit{optimal}$ if both $\\textit{Encode}_A$ and $\\textit{Decode}_A$ run in linear time and the number of bits of $\\textit{Code}_A(G)$ for any $n$-node graph $G$ in $\\mathbb{G}$ is information-theoretically optimal to within lower-order terms. Tre","authors_text":"Hsueh-I Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-11T15:01:49Z","title":"Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2538","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:560a6bede4de2b1293d3b855a04f660f82eb9d7488d811fefa94aabd96314949","target":"record","created_at":"2026-05-18T02:53:29Z","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":"fcf7481afc06e9bbc95bc2964d1447a845cfb2aa04ce156c443967bcc43d5500","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-11T15:01:49Z","title_canon_sha256":"da150a7d5e7a9fc9d8329e04b3d9640647afc0c2549776be9c4e255ca470fe3a"},"schema_version":"1.0","source":{"id":"1401.2538","kind":"arxiv","version":1}},"canonical_sha256":"416cc33c7044f7f025280dd3043f60501b0b20a9b78dd7008da1b9f5fdaf5d1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"416cc33c7044f7f025280dd3043f60501b0b20a9b78dd7008da1b9f5fdaf5d1f","first_computed_at":"2026-05-18T02:53:29.748278Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:29.748278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hTZEBNYZHGmHplBBFxWzuxnq6jRZJCCXFlecWa1s6KYgTTKrMkSFpoeZgZlflNpW3q+1vZK5/TS+xd8wls1eDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:29.748979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2538","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:560a6bede4de2b1293d3b855a04f660f82eb9d7488d811fefa94aabd96314949","sha256:76cddd3cb668db2359e7ad4f6687d184603e92505d9bf5794f57ccb6aca026a9"],"state_sha256":"1fbfebc75d282a323a6aef58f043d4dc9c2f61312607dfece785ed22c865ac2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xuPvtYKEyvpESg+g4d2F2nNkRSvBYb8fASkyKrz7um+T09m2WM1kWGYfTDsk6c6FmcoKt7VgpueCb/TrIWHIBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T11:26:22.223385Z","bundle_sha256":"e40e4ef33390f959df40c7467c85061f251736de1c52974fca88afcec5fecbcc"}}