{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MAUTJTSCFYGKUJBUMFCWZWHSBU","short_pith_number":"pith:MAUTJTSC","schema_version":"1.0","canonical_sha256":"602934ce422e0caa243461456cd8f20d35db5a190b0dd6f54d30d3fcd2701535","source":{"kind":"arxiv","id":"2607.01358","version":1},"attestation_state":"computed","paper":{"title":"Beyond Degree: Rooted Motif Signatures for Latent Position Identifiability in Graphon Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Roland Boniface Sogan, Tabea Rebafka","submitted_at":"2026-07-01T18:18:25Z","abstract_excerpt":"Graphon estimation requires structural assumptions to address its intrinsic non-identifiability. A standard approach is degree-based identifiability, where the degree function is assumed to be strictly monotonic. This assumption is rather restrictive and fails for graphons with constant or non-injective degree function, even when distinct latent positions have different connectivity profiles. In this paper, we introduce \\emph{rooted motif signatures} as higher-order node-level representations for graphons. They extend the degree function by recording, at each latent position, the densities of "},"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":"2607.01358","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-07-01T18:18:25Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"ab322f8c224d8bf08a62f6e0f1223532c17aa070d725535b86d73e2f69b7cb13","abstract_canon_sha256":"3f38daad3a43edbe328b2e8d3fbcf117d5bf0079af2835f99f60d4b741fe79ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T00:16:58.257198Z","signature_b64":"lKdHZJ+JcV6kr75fS3bI/8vyFeIVFij/R7BgMbDc4f8+m5jq26NTpuNErA2cj6omOwr70p+IbMtft327vG+SDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"602934ce422e0caa243461456cd8f20d35db5a190b0dd6f54d30d3fcd2701535","last_reissued_at":"2026-07-03T00:16:58.256841Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T00:16:58.256841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Degree: Rooted Motif Signatures for Latent Position Identifiability in Graphon Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Roland Boniface Sogan, Tabea Rebafka","submitted_at":"2026-07-01T18:18:25Z","abstract_excerpt":"Graphon estimation requires structural assumptions to address its intrinsic non-identifiability. A standard approach is degree-based identifiability, where the degree function is assumed to be strictly monotonic. This assumption is rather restrictive and fails for graphons with constant or non-injective degree function, even when distinct latent positions have different connectivity profiles. In this paper, we introduce \\emph{rooted motif signatures} as higher-order node-level representations for graphons. They extend the degree function by recording, at each latent position, the densities of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01358","kind":"arxiv","version":1},"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/2607.01358/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":"2607.01358","created_at":"2026-07-03T00:16:58.256905+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.01358v1","created_at":"2026-07-03T00:16:58.256905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01358","created_at":"2026-07-03T00:16:58.256905+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAUTJTSCFYGK","created_at":"2026-07-03T00:16:58.256905+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAUTJTSCFYGKUJBU","created_at":"2026-07-03T00:16:58.256905+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAUTJTSC","created_at":"2026-07-03T00:16:58.256905+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/MAUTJTSCFYGKUJBUMFCWZWHSBU","json":"https://pith.science/pith/MAUTJTSCFYGKUJBUMFCWZWHSBU.json","graph_json":"https://pith.science/api/pith-number/MAUTJTSCFYGKUJBUMFCWZWHSBU/graph.json","events_json":"https://pith.science/api/pith-number/MAUTJTSCFYGKUJBUMFCWZWHSBU/events.json","paper":"https://pith.science/paper/MAUTJTSC"},"agent_actions":{"view_html":"https://pith.science/pith/MAUTJTSCFYGKUJBUMFCWZWHSBU","download_json":"https://pith.science/pith/MAUTJTSCFYGKUJBUMFCWZWHSBU.json","view_paper":"https://pith.science/paper/MAUTJTSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.01358&json=true","fetch_graph":"https://pith.science/api/pith-number/MAUTJTSCFYGKUJBUMFCWZWHSBU/graph.json","fetch_events":"https://pith.science/api/pith-number/MAUTJTSCFYGKUJBUMFCWZWHSBU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAUTJTSCFYGKUJBUMFCWZWHSBU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAUTJTSCFYGKUJBUMFCWZWHSBU/action/storage_attestation","attest_author":"https://pith.science/pith/MAUTJTSCFYGKUJBUMFCWZWHSBU/action/author_attestation","sign_citation":"https://pith.science/pith/MAUTJTSCFYGKUJBUMFCWZWHSBU/action/citation_signature","submit_replication":"https://pith.science/pith/MAUTJTSCFYGKUJBUMFCWZWHSBU/action/replication_record"}},"created_at":"2026-07-03T00:16:58.256905+00:00","updated_at":"2026-07-03T00:16:58.256905+00:00"}