{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3A6DFPYOZMULLWSWPPFGVHTGIA","short_pith_number":"pith:3A6DFPYO","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"},"canonical_sha256":"d83c32bf0ecb28b5da567bca6a9e664023b35c3e1f7ea8876ba879bf8c1381c5","source":{"kind":"arxiv","id":"1511.05254","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05254","created_at":"2026-05-18T00:32:21Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05254v2","created_at":"2026-05-18T00:32:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05254","created_at":"2026-05-18T00:32:21Z"},{"alias_kind":"pith_short_12","alias_value":"3A6DFPYOZMUL","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3A6DFPYOZMULLWSW","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3A6DFPYO","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3A6DFPYOZMULLWSWPPFGVHTGIA","target":"record","payload":{"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"},"canonical_sha256":"d83c32bf0ecb28b5da567bca6a9e664023b35c3e1f7ea8876ba879bf8c1381c5","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"},"source_kind":"arxiv","source_id":"1511.05254","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:32:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U/x1t0M2Pi07lFlEjsvm3H9q1KFRYAAB8mKp9U3zUklYWqZJM5vKr30OAS6Cj73xnLUVMOqeejJ85lNxNv5jBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:21:26.646937Z"},"content_sha256":"624771ae33991ff89302dd5bbf3fdb8512d15fb68d3094ea0b3afc113d94483c","schema_version":"1.0","event_id":"sha256:624771ae33991ff89302dd5bbf3fdb8512d15fb68d3094ea0b3afc113d94483c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3A6DFPYOZMULLWSWPPFGVHTGIA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:32:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dDBsiHp6rq7VhdmKZ1tcpMLhn/pGQZaZEhd0m0XDaVYMaD2x60znJCLZuVrHH19jvNCpzZeqxOv5iYRLVrb7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:21:26.647295Z"},"content_sha256":"1ac6f42e83fb402f8be4b3986cdb66660ace5670b7076ece24f8fd0948136297","schema_version":"1.0","event_id":"sha256:1ac6f42e83fb402f8be4b3986cdb66660ace5670b7076ece24f8fd0948136297"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3A6DFPYOZMULLWSWPPFGVHTGIA/bundle.json","state_url":"https://pith.science/pith/3A6DFPYOZMULLWSWPPFGVHTGIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3A6DFPYOZMULLWSWPPFGVHTGIA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T10:21:26Z","links":{"resolver":"https://pith.science/pith/3A6DFPYOZMULLWSWPPFGVHTGIA","bundle":"https://pith.science/pith/3A6DFPYOZMULLWSWPPFGVHTGIA/bundle.json","state":"https://pith.science/pith/3A6DFPYOZMULLWSWPPFGVHTGIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3A6DFPYOZMULLWSWPPFGVHTGIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3A6DFPYOZMULLWSWPPFGVHTGIA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b5211d29912d114fd695337b05bb416439b00f9c8d85bddbd3d74dba2c0d0cb8","cross_cats_sorted":["cs.DM","cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-11-17T02:38:03Z","title_canon_sha256":"cfffeb3625f49a9e0662fb8e89eb7dd98f14f9d840aec5fa79b754c29c41a229"},"schema_version":"1.0","source":{"id":"1511.05254","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05254","created_at":"2026-05-18T00:32:21Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05254v2","created_at":"2026-05-18T00:32:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05254","created_at":"2026-05-18T00:32:21Z"},{"alias_kind":"pith_short_12","alias_value":"3A6DFPYOZMUL","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3A6DFPYOZMULLWSW","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3A6DFPYO","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:1ac6f42e83fb402f8be4b3986cdb66660ace5670b7076ece24f8fd0948136297","target":"graph","created_at":"2026-05-18T00:32:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Andrea Montanari, Hamid Javadi","cross_cats":["cs.DM","cs.IT","math.IT","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-11-17T02:38:03Z","title":"A Statistical Model for Motifs Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05254","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:624771ae33991ff89302dd5bbf3fdb8512d15fb68d3094ea0b3afc113d94483c","target":"record","created_at":"2026-05-18T00:32:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b5211d29912d114fd695337b05bb416439b00f9c8d85bddbd3d74dba2c0d0cb8","cross_cats_sorted":["cs.DM","cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-11-17T02:38:03Z","title_canon_sha256":"cfffeb3625f49a9e0662fb8e89eb7dd98f14f9d840aec5fa79b754c29c41a229"},"schema_version":"1.0","source":{"id":"1511.05254","kind":"arxiv","version":2}},"canonical_sha256":"d83c32bf0ecb28b5da567bca6a9e664023b35c3e1f7ea8876ba879bf8c1381c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d83c32bf0ecb28b5da567bca6a9e664023b35c3e1f7ea8876ba879bf8c1381c5","first_computed_at":"2026-05-18T00:32:21.599168Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:21.599168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ShCrpanWBKgaPJR+wpvpgSfiMMWXpsz5dJN3okEyAyNxBkbS1tWGNzxdRN6ZSnZSF7TlyFCoJFt3TpQs2yxFBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:21.599798Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05254","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:624771ae33991ff89302dd5bbf3fdb8512d15fb68d3094ea0b3afc113d94483c","sha256:1ac6f42e83fb402f8be4b3986cdb66660ace5670b7076ece24f8fd0948136297"],"state_sha256":"4495a674adc7c710bdbcacb9176b39aaa6b0097008bc4afdd20a44d9b79de10c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4PI/RHoLWwKmAoAivUTo/uXFqryQnk3gsoaYhhB2nZxzzTanOOg+08VETJaBzK6hKzwOU2D47AQup3WeYuf9Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:21:26.649346Z","bundle_sha256":"ee00fce6ed6f4083c7e515b6c9bc65d184de1dadd24a4f2bbd236547bd15a75f"}}