{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:APFYKB6OUDJ2C6GYWNSGJO4Q3O","short_pith_number":"pith:APFYKB6O","schema_version":"1.0","canonical_sha256":"03cb8507cea0d3a178d8b36464bb90dbaa20818358051a89edc91c67986ea6b3","source":{"kind":"arxiv","id":"2511.10625","version":3},"attestation_state":"computed","paper":{"title":"Model-oriented Graph Distances via Partially Ordered Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Armeen Taeb, F. Richard Guo, Leonard Henckel","submitted_at":"2025-11-13T18:50:21Z","abstract_excerpt":"A well-defined distance on the parameter space is key to evaluating estimators, ensuring consistency, and building confidence sets. While there are typically standard distances to adopt in a continuous space, this is not the case for combinatorial parameters such as graphs that represent statistical models. Defined on the graphs alone, existing proposals like the structural Hamming distance ignore the structure of the model space and can thus exhibit undesirable behaviors. We propose a model-oriented framework for defining the distance between graphs that is applicable across different graph c"},"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":"2511.10625","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-11-13T18:50:21Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"c9099ec0f8a8e013938dac8b88418dd0c65012445204866b3584a05f13a81233","abstract_canon_sha256":"27dc086a2bee02af864a8555a9438b989c36892f3acd87f5bcd7c64a53a62901"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:17:42.876369Z","signature_b64":"pCfIMp+ZZag1aQYLMaWFGOQHrBkIbr4i3nuUq7RvRMvNDsqdPju/xu+c9Dt/L5Rqd8PtSKipWoWNCLmP3CGIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03cb8507cea0d3a178d8b36464bb90dbaa20818358051a89edc91c67986ea6b3","last_reissued_at":"2026-07-01T01:17:42.875755Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:17:42.875755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model-oriented Graph Distances via Partially Ordered Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Armeen Taeb, F. Richard Guo, Leonard Henckel","submitted_at":"2025-11-13T18:50:21Z","abstract_excerpt":"A well-defined distance on the parameter space is key to evaluating estimators, ensuring consistency, and building confidence sets. While there are typically standard distances to adopt in a continuous space, this is not the case for combinatorial parameters such as graphs that represent statistical models. Defined on the graphs alone, existing proposals like the structural Hamming distance ignore the structure of the model space and can thus exhibit undesirable behaviors. We propose a model-oriented framework for defining the distance between graphs that is applicable across different graph c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.10625","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2511.10625/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2511.10625","created_at":"2026-07-01T01:17:42.875838+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.10625v3","created_at":"2026-07-01T01:17:42.875838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.10625","created_at":"2026-07-01T01:17:42.875838+00:00"},{"alias_kind":"pith_short_12","alias_value":"APFYKB6OUDJ2","created_at":"2026-07-01T01:17:42.875838+00:00"},{"alias_kind":"pith_short_16","alias_value":"APFYKB6OUDJ2C6GY","created_at":"2026-07-01T01:17:42.875838+00:00"},{"alias_kind":"pith_short_8","alias_value":"APFYKB6O","created_at":"2026-07-01T01:17:42.875838+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/APFYKB6OUDJ2C6GYWNSGJO4Q3O","json":"https://pith.science/pith/APFYKB6OUDJ2C6GYWNSGJO4Q3O.json","graph_json":"https://pith.science/api/pith-number/APFYKB6OUDJ2C6GYWNSGJO4Q3O/graph.json","events_json":"https://pith.science/api/pith-number/APFYKB6OUDJ2C6GYWNSGJO4Q3O/events.json","paper":"https://pith.science/paper/APFYKB6O"},"agent_actions":{"view_html":"https://pith.science/pith/APFYKB6OUDJ2C6GYWNSGJO4Q3O","download_json":"https://pith.science/pith/APFYKB6OUDJ2C6GYWNSGJO4Q3O.json","view_paper":"https://pith.science/paper/APFYKB6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.10625&json=true","fetch_graph":"https://pith.science/api/pith-number/APFYKB6OUDJ2C6GYWNSGJO4Q3O/graph.json","fetch_events":"https://pith.science/api/pith-number/APFYKB6OUDJ2C6GYWNSGJO4Q3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/APFYKB6OUDJ2C6GYWNSGJO4Q3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/APFYKB6OUDJ2C6GYWNSGJO4Q3O/action/storage_attestation","attest_author":"https://pith.science/pith/APFYKB6OUDJ2C6GYWNSGJO4Q3O/action/author_attestation","sign_citation":"https://pith.science/pith/APFYKB6OUDJ2C6GYWNSGJO4Q3O/action/citation_signature","submit_replication":"https://pith.science/pith/APFYKB6OUDJ2C6GYWNSGJO4Q3O/action/replication_record"}},"created_at":"2026-07-01T01:17:42.875838+00:00","updated_at":"2026-07-01T01:17:42.875838+00:00"}