{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OUPUY3EBVDEK5CRP2OUG5UWMPP","short_pith_number":"pith:OUPUY3EB","schema_version":"1.0","canonical_sha256":"751f4c6c81a8c8ae8a2fd3a86ed2cc7bcfee769b9d1553b9bb58c70fa1c8d10c","source":{"kind":"arxiv","id":"1312.6490","version":3},"attestation_state":"computed","paper":{"title":"Book inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Laszlo Csirmaz","submitted_at":"2013-12-23T09:20:48Z","abstract_excerpt":"Information theoretical inequalities have strong ties with polymatroids and their representability. A polymatroid is entropic if its rank function is given by the Shannon entropy of the subsets of some discrete random variables. The book is a special iterated adhesive extension of a polymatroid with the property that entropic polymatroids have $n$-page book extensions over an arbitrary spine. We prove that every polymatroid has an $n$-page book extension over a single element and over an all-but-one-element spine. Consequently, for polymatroids on four elements, only book extensions over a two"},"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":"1312.6490","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-23T09:20:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2e0a22f59d17d965b7fd120b38e2fb522359daa8c7f2e20a7884a4a7f242e0ee","abstract_canon_sha256":"03ac9ffdcdda2ecd1fffc6595c749f45abf7a3dd3de99596a23660eabdd75c80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:51.677618Z","signature_b64":"3xwVw+2by2xBMEln9coqDF4wa5VGxP3omabqdx9S12kgzYOsgz+15O6cjpGI06TAZk2jaNKEbDkyA4HwcZeNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"751f4c6c81a8c8ae8a2fd3a86ed2cc7bcfee769b9d1553b9bb58c70fa1c8d10c","last_reissued_at":"2026-05-18T02:50:51.677165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:51.677165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Book inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Laszlo Csirmaz","submitted_at":"2013-12-23T09:20:48Z","abstract_excerpt":"Information theoretical inequalities have strong ties with polymatroids and their representability. A polymatroid is entropic if its rank function is given by the Shannon entropy of the subsets of some discrete random variables. The book is a special iterated adhesive extension of a polymatroid with the property that entropic polymatroids have $n$-page book extensions over an arbitrary spine. We prove that every polymatroid has an $n$-page book extension over a single element and over an all-but-one-element spine. Consequently, for polymatroids on four elements, only book extensions over a two"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6490","kind":"arxiv","version":3},"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":"1312.6490","created_at":"2026-05-18T02:50:51.677232+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6490v3","created_at":"2026-05-18T02:50:51.677232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6490","created_at":"2026-05-18T02:50:51.677232+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUPUY3EBVDEK","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUPUY3EBVDEK5CRP","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUPUY3EB","created_at":"2026-05-18T12:27:54.935989+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/OUPUY3EBVDEK5CRP2OUG5UWMPP","json":"https://pith.science/pith/OUPUY3EBVDEK5CRP2OUG5UWMPP.json","graph_json":"https://pith.science/api/pith-number/OUPUY3EBVDEK5CRP2OUG5UWMPP/graph.json","events_json":"https://pith.science/api/pith-number/OUPUY3EBVDEK5CRP2OUG5UWMPP/events.json","paper":"https://pith.science/paper/OUPUY3EB"},"agent_actions":{"view_html":"https://pith.science/pith/OUPUY3EBVDEK5CRP2OUG5UWMPP","download_json":"https://pith.science/pith/OUPUY3EBVDEK5CRP2OUG5UWMPP.json","view_paper":"https://pith.science/paper/OUPUY3EB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6490&json=true","fetch_graph":"https://pith.science/api/pith-number/OUPUY3EBVDEK5CRP2OUG5UWMPP/graph.json","fetch_events":"https://pith.science/api/pith-number/OUPUY3EBVDEK5CRP2OUG5UWMPP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUPUY3EBVDEK5CRP2OUG5UWMPP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUPUY3EBVDEK5CRP2OUG5UWMPP/action/storage_attestation","attest_author":"https://pith.science/pith/OUPUY3EBVDEK5CRP2OUG5UWMPP/action/author_attestation","sign_citation":"https://pith.science/pith/OUPUY3EBVDEK5CRP2OUG5UWMPP/action/citation_signature","submit_replication":"https://pith.science/pith/OUPUY3EBVDEK5CRP2OUG5UWMPP/action/replication_record"}},"created_at":"2026-05-18T02:50:51.677232+00:00","updated_at":"2026-05-18T02:50:51.677232+00:00"}