{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TAXBQANGI2R47FVAGROF4GINPI","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":"9603d7d229f7bc734c6546a65eec003627e40a9a106a64769ce4de063bdc4b90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-24T02:21:47Z","title_canon_sha256":"4265513eb03c1db1e656a7b785e1d70094ca49b0247b56255b728801a78694e1"},"schema_version":"1.0","source":{"id":"1306.5497","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5497","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5497v1","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5497","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"pith_short_12","alias_value":"TAXBQANGI2R4","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"TAXBQANGI2R47FVA","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"TAXBQANG","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:213b5a8eab9e30b9f3ba078f5a4252ade959d561d7b89f67558c2e8ea6057fde","target":"graph","created_at":"2026-05-18T03:20:07Z","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 Huffman coding algorithm is interpreted in the lattice of partitions of the source alphabet. Maximal chains in the partition lattice correspond to linear extensions of tree orders, and those among the chains that exhibit a simple greedy property correspond precisely to executions of the Huffman algorithm.","authors_text":"Stephan Foldes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-24T02:21:47Z","title":"Huffman coding as an algorithm to construct chains in partition lattices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5497","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:de32dfdd46b8ed91346a4a34d6f6e5632cee39a5b491c49b5ad8422e57b66ad4","target":"record","created_at":"2026-05-18T03:20:07Z","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":"9603d7d229f7bc734c6546a65eec003627e40a9a106a64769ce4de063bdc4b90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-24T02:21:47Z","title_canon_sha256":"4265513eb03c1db1e656a7b785e1d70094ca49b0247b56255b728801a78694e1"},"schema_version":"1.0","source":{"id":"1306.5497","kind":"arxiv","version":1}},"canonical_sha256":"982e1801a646a3cf96a0345c5e190d7a116644bb2b3c7a8494a07c4e23205aeb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"982e1801a646a3cf96a0345c5e190d7a116644bb2b3c7a8494a07c4e23205aeb","first_computed_at":"2026-05-18T03:20:07.878917Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:07.878917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MMq3t5vbc3fIub+taC1lIoUO1p8Y6wJwif4MKesWr3BpnqrrmM1LU9n+vQM3qVlnii+pRWtR90AeeJp6WMRaAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:07.879598Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.5497","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de32dfdd46b8ed91346a4a34d6f6e5632cee39a5b491c49b5ad8422e57b66ad4","sha256:213b5a8eab9e30b9f3ba078f5a4252ade959d561d7b89f67558c2e8ea6057fde"],"state_sha256":"9f5c9f073208e170eefa40b92fb48335921c5a2c8ef7a7dd0d2b6c502e2368b2"}