{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3A6DFPYOZMULLWSWPPFGVHTGIA","short_pith_number":"pith:3A6DFPYO","schema_version":"1.0","canonical_sha256":"d83c32bf0ecb28b5da567bca6a9e664023b35c3e1f7ea8876ba879bf8c1381c5","source":{"kind":"arxiv","id":"1511.05254","version":2},"attestation_state":"computed","paper":{"title":"A Statistical Model for Motifs Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Andrea Montanari, Hamid Javadi","submitted_at":"2015-11-17T02:38:03Z","abstract_excerpt":"We consider a statistical model for the problem of finding subgraphs with specified topology in an otherwise random graph. This task plays an important role in the analysis of social and biological networks. In these types of networks, small subgraphs with a specific structure have important functional roles, and they are referred to as `motifs.'\n  Within this model, one or multiple copies of a subgraph is added (`planted') in an Erd\\H{o}s-Renyi random graph with $n$ vertices and edge probability $q_0$. We ask whether the resulting graph can be distinguished reliably from a pure Erd\\H{o}s-Reny"},"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":"1511.05254","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-11-17T02:38:03Z","cross_cats_sorted":["cs.DM","cs.IT","math.IT","stat.TH"],"title_canon_sha256":"cfffeb3625f49a9e0662fb8e89eb7dd98f14f9d840aec5fa79b754c29c41a229","abstract_canon_sha256":"b5211d29912d114fd695337b05bb416439b00f9c8d85bddbd3d74dba2c0d0cb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:21.599798Z","signature_b64":"ShCrpanWBKgaPJR+wpvpgSfiMMWXpsz5dJN3okEyAyNxBkbS1tWGNzxdRN6ZSnZSF7TlyFCoJFt3TpQs2yxFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d83c32bf0ecb28b5da567bca6a9e664023b35c3e1f7ea8876ba879bf8c1381c5","last_reissued_at":"2026-05-18T00:32:21.599168Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:21.599168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Statistical Model for Motifs Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Andrea Montanari, Hamid Javadi","submitted_at":"2015-11-17T02:38:03Z","abstract_excerpt":"We consider a statistical model for the problem of finding subgraphs with specified topology in an otherwise random graph. This task plays an important role in the analysis of social and biological networks. In these types of networks, small subgraphs with a specific structure have important functional roles, and they are referred to as `motifs.'\n  Within this model, one or multiple copies of a subgraph is added (`planted') in an Erd\\H{o}s-Renyi random graph with $n$ vertices and edge probability $q_0$. We ask whether the resulting graph can be distinguished reliably from a pure Erd\\H{o}s-Reny"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05254","kind":"arxiv","version":2},"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":"1511.05254","created_at":"2026-05-18T00:32:21.599276+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.05254v2","created_at":"2026-05-18T00:32:21.599276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05254","created_at":"2026-05-18T00:32:21.599276+00:00"},{"alias_kind":"pith_short_12","alias_value":"3A6DFPYOZMUL","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3A6DFPYOZMULLWSW","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3A6DFPYO","created_at":"2026-05-18T12:29:02.477457+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/3A6DFPYOZMULLWSWPPFGVHTGIA","json":"https://pith.science/pith/3A6DFPYOZMULLWSWPPFGVHTGIA.json","graph_json":"https://pith.science/api/pith-number/3A6DFPYOZMULLWSWPPFGVHTGIA/graph.json","events_json":"https://pith.science/api/pith-number/3A6DFPYOZMULLWSWPPFGVHTGIA/events.json","paper":"https://pith.science/paper/3A6DFPYO"},"agent_actions":{"view_html":"https://pith.science/pith/3A6DFPYOZMULLWSWPPFGVHTGIA","download_json":"https://pith.science/pith/3A6DFPYOZMULLWSWPPFGVHTGIA.json","view_paper":"https://pith.science/paper/3A6DFPYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.05254&json=true","fetch_graph":"https://pith.science/api/pith-number/3A6DFPYOZMULLWSWPPFGVHTGIA/graph.json","fetch_events":"https://pith.science/api/pith-number/3A6DFPYOZMULLWSWPPFGVHTGIA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3A6DFPYOZMULLWSWPPFGVHTGIA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3A6DFPYOZMULLWSWPPFGVHTGIA/action/storage_attestation","attest_author":"https://pith.science/pith/3A6DFPYOZMULLWSWPPFGVHTGIA/action/author_attestation","sign_citation":"https://pith.science/pith/3A6DFPYOZMULLWSWPPFGVHTGIA/action/citation_signature","submit_replication":"https://pith.science/pith/3A6DFPYOZMULLWSWPPFGVHTGIA/action/replication_record"}},"created_at":"2026-05-18T00:32:21.599276+00:00","updated_at":"2026-05-18T00:32:21.599276+00:00"}