{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NE6ENGCCIC5RY2THVLQQBUNJLS","short_pith_number":"pith:NE6ENGCC","schema_version":"1.0","canonical_sha256":"693c46984240bb1c6a67aae100d1a95ca7386b51b5b7a8c0bf8640a97ba2f39a","source":{"kind":"arxiv","id":"1702.05879","version":3},"attestation_state":"computed","paper":{"title":"Complexity of Possibly-gapped Histogram and Analysis of Histogram (ANOHT)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Fushing Hsieh, Tania Roy","submitted_at":"2017-02-20T07:07:05Z","abstract_excerpt":"Without unrealistic continuity and smoothness assumptions on a distributional density of one dimensional dataset, constructing an authentic possibly-gapped histogram becomes rather complex. The candidate ensemble is described via a two-layer Ising model, and its size is shown to grow exponentially. This exponential complexity makes any exhaustive search in-feasible and all boundary parameters local. For data compression via Uniformity, the decoding error criterion is nearly independent of sample size. These characteristics nullify statistical model selection techniques, such as Minimum Descrip"},"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":"1702.05879","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-02-20T07:07:05Z","cross_cats_sorted":[],"title_canon_sha256":"883535b31512824be79d11a65fd68b40910197fac8a038f2fb4890eeb2240122","abstract_canon_sha256":"13e6af172619e2a0ea9a017e8a9ed01858934e5e0857b6d1e5edcefa50aea639"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:45.865746Z","signature_b64":"jnpyMbP4jTidoD4sKHbyuzi5hZtUEh9xdw9LV/AFQ5CBh9EemSzreAERs3fLdv6dtrPzlQqdvtbPqp9JJmo4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"693c46984240bb1c6a67aae100d1a95ca7386b51b5b7a8c0bf8640a97ba2f39a","last_reissued_at":"2026-05-18T00:30:45.865077Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:45.865077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Possibly-gapped Histogram and Analysis of Histogram (ANOHT)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Fushing Hsieh, Tania Roy","submitted_at":"2017-02-20T07:07:05Z","abstract_excerpt":"Without unrealistic continuity and smoothness assumptions on a distributional density of one dimensional dataset, constructing an authentic possibly-gapped histogram becomes rather complex. The candidate ensemble is described via a two-layer Ising model, and its size is shown to grow exponentially. This exponential complexity makes any exhaustive search in-feasible and all boundary parameters local. For data compression via Uniformity, the decoding error criterion is nearly independent of sample size. These characteristics nullify statistical model selection techniques, such as Minimum Descrip"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05879","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":"1702.05879","created_at":"2026-05-18T00:30:45.865176+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05879v3","created_at":"2026-05-18T00:30:45.865176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05879","created_at":"2026-05-18T00:30:45.865176+00:00"},{"alias_kind":"pith_short_12","alias_value":"NE6ENGCCIC5R","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NE6ENGCCIC5RY2TH","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NE6ENGCC","created_at":"2026-05-18T12:31:31.346846+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/NE6ENGCCIC5RY2THVLQQBUNJLS","json":"https://pith.science/pith/NE6ENGCCIC5RY2THVLQQBUNJLS.json","graph_json":"https://pith.science/api/pith-number/NE6ENGCCIC5RY2THVLQQBUNJLS/graph.json","events_json":"https://pith.science/api/pith-number/NE6ENGCCIC5RY2THVLQQBUNJLS/events.json","paper":"https://pith.science/paper/NE6ENGCC"},"agent_actions":{"view_html":"https://pith.science/pith/NE6ENGCCIC5RY2THVLQQBUNJLS","download_json":"https://pith.science/pith/NE6ENGCCIC5RY2THVLQQBUNJLS.json","view_paper":"https://pith.science/paper/NE6ENGCC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05879&json=true","fetch_graph":"https://pith.science/api/pith-number/NE6ENGCCIC5RY2THVLQQBUNJLS/graph.json","fetch_events":"https://pith.science/api/pith-number/NE6ENGCCIC5RY2THVLQQBUNJLS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NE6ENGCCIC5RY2THVLQQBUNJLS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NE6ENGCCIC5RY2THVLQQBUNJLS/action/storage_attestation","attest_author":"https://pith.science/pith/NE6ENGCCIC5RY2THVLQQBUNJLS/action/author_attestation","sign_citation":"https://pith.science/pith/NE6ENGCCIC5RY2THVLQQBUNJLS/action/citation_signature","submit_replication":"https://pith.science/pith/NE6ENGCCIC5RY2THVLQQBUNJLS/action/replication_record"}},"created_at":"2026-05-18T00:30:45.865176+00:00","updated_at":"2026-05-18T00:30:45.865176+00:00"}