{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AHDELEU2KP5RYS6T6FQKSR7SC4","short_pith_number":"pith:AHDELEU2","schema_version":"1.0","canonical_sha256":"01c645929a53fb1c4bd3f160a947f217392d7d56b544c9076898d28d54d5e7d5","source":{"kind":"arxiv","id":"1608.03045","version":3},"attestation_state":"computed","paper":{"title":"Combinatorial Inference for Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Han Liu, Junwei Lu, Matey Neykov","submitted_at":"2016-08-10T04:47:29Z","abstract_excerpt":"We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global structure of the underlying graph. Examples include testing the graph connectivity, the presence of a cycle of certain size, or the maximum degree of the graph. To begin with, we develop a unified theory for the fundamental limits of a large family of combinatorial inference problems. We propose new concepts including structural packing and buffer entropies to"},"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":"1608.03045","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-08-10T04:47:29Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"b546558e189178eefe18ef44b4b9cdc8d8dfeb3ca0bc28fdef0437807e9a93b4","abstract_canon_sha256":"cd74d8a3de4ad607b15ab68071e7fd6f48ab90d171913d087924ca0f8b5078e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:46.112954Z","signature_b64":"Rddz2IHGr4SlPwA8LVK1XiS2nqZeXzBDkQ+VHOku1gv8k76JXJN7Gna54QtMRI3+q1KZUpNudliHnC4K8JlvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01c645929a53fb1c4bd3f160a947f217392d7d56b544c9076898d28d54d5e7d5","last_reissued_at":"2026-05-18T00:23:46.112443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:46.112443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Inference for Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Han Liu, Junwei Lu, Matey Neykov","submitted_at":"2016-08-10T04:47:29Z","abstract_excerpt":"We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global structure of the underlying graph. Examples include testing the graph connectivity, the presence of a cycle of certain size, or the maximum degree of the graph. To begin with, we develop a unified theory for the fundamental limits of a large family of combinatorial inference problems. We propose new concepts including structural packing and buffer entropies to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03045","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":"1608.03045","created_at":"2026-05-18T00:23:46.112499+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03045v3","created_at":"2026-05-18T00:23:46.112499+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03045","created_at":"2026-05-18T00:23:46.112499+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHDELEU2KP5R","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHDELEU2KP5RYS6T","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHDELEU2","created_at":"2026-05-18T12:30:07.202191+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/AHDELEU2KP5RYS6T6FQKSR7SC4","json":"https://pith.science/pith/AHDELEU2KP5RYS6T6FQKSR7SC4.json","graph_json":"https://pith.science/api/pith-number/AHDELEU2KP5RYS6T6FQKSR7SC4/graph.json","events_json":"https://pith.science/api/pith-number/AHDELEU2KP5RYS6T6FQKSR7SC4/events.json","paper":"https://pith.science/paper/AHDELEU2"},"agent_actions":{"view_html":"https://pith.science/pith/AHDELEU2KP5RYS6T6FQKSR7SC4","download_json":"https://pith.science/pith/AHDELEU2KP5RYS6T6FQKSR7SC4.json","view_paper":"https://pith.science/paper/AHDELEU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03045&json=true","fetch_graph":"https://pith.science/api/pith-number/AHDELEU2KP5RYS6T6FQKSR7SC4/graph.json","fetch_events":"https://pith.science/api/pith-number/AHDELEU2KP5RYS6T6FQKSR7SC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHDELEU2KP5RYS6T6FQKSR7SC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHDELEU2KP5RYS6T6FQKSR7SC4/action/storage_attestation","attest_author":"https://pith.science/pith/AHDELEU2KP5RYS6T6FQKSR7SC4/action/author_attestation","sign_citation":"https://pith.science/pith/AHDELEU2KP5RYS6T6FQKSR7SC4/action/citation_signature","submit_replication":"https://pith.science/pith/AHDELEU2KP5RYS6T6FQKSR7SC4/action/replication_record"}},"created_at":"2026-05-18T00:23:46.112499+00:00","updated_at":"2026-05-18T00:23:46.112499+00:00"}