{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IFWMGPDQIT37AJJIBXJQIP3AKA","short_pith_number":"pith:IFWMGPDQ","schema_version":"1.0","canonical_sha256":"416cc33c7044f7f025280dd3043f60501b0b20a9b78dd7008da1b9f5fdaf5d1f","source":{"kind":"arxiv","id":"1401.2538","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.2538","created_at":"2026-05-18T02:53:29.748407+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.2538v1","created_at":"2026-05-18T02:53:29.748407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2538","created_at":"2026-05-18T02:53:29.748407+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFWMGPDQIT37","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFWMGPDQIT37AJJI","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFWMGPDQ","created_at":"2026-05-18T12:28:33.132498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IFWMGPDQIT37AJJIBXJQIP3AKA","json":"https://pith.science/pith/IFWMGPDQIT37AJJIBXJQIP3AKA.json","graph_json":"https://pith.science/api/pith-number/IFWMGPDQIT37AJJIBXJQIP3AKA/graph.json","events_json":"https://pith.science/api/pith-number/IFWMGPDQIT37AJJIBXJQIP3AKA/events.json","paper":"https://pith.science/paper/IFWMGPDQ"},"agent_actions":{"view_html":"https://pith.science/pith/IFWMGPDQIT37AJJIBXJQIP3AKA","download_json":"https://pith.science/pith/IFWMGPDQIT37AJJIBXJQIP3AKA.json","view_paper":"https://pith.science/paper/IFWMGPDQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.2538&json=true","fetch_graph":"https://pith.science/api/pith-number/IFWMGPDQIT37AJJIBXJQIP3AKA/graph.json","fetch_events":"https://pith.science/api/pith-number/IFWMGPDQIT37AJJIBXJQIP3AKA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFWMGPDQIT37AJJIBXJQIP3AKA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFWMGPDQIT37AJJIBXJQIP3AKA/action/storage_attestation","attest_author":"https://pith.science/pith/IFWMGPDQIT37AJJIBXJQIP3AKA/action/author_attestation","sign_citation":"https://pith.science/pith/IFWMGPDQIT37AJJIBXJQIP3AKA/action/citation_signature","submit_replication":"https://pith.science/pith/IFWMGPDQIT37AJJIBXJQIP3AKA/action/replication_record"}},"created_at":"2026-05-18T02:53:29.748407+00:00","updated_at":"2026-05-18T02:53:29.748407+00:00"}