{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YCHYJD65D6FFXMZJ2POL6RBRYR","short_pith_number":"pith:YCHYJD65","schema_version":"1.0","canonical_sha256":"c08f848fdd1f8a5bb329d3dcbf4431c46c714dd9410a9a8be8bbe9fef4ec31e8","source":{"kind":"arxiv","id":"2101.12560","version":1},"attestation_state":"computed","paper":{"title":"The iterated local transitivity model for hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Anthony Bonato, Melissa A. Huggan, Natalie C. Behague, Rehan Malik, Trent G. Marbach","submitted_at":"2021-01-29T13:23:54Z","abstract_excerpt":"Complex networks are pervasive in the real world, capturing dyadic interactions between pairs of vertices, and a large corpus has emerged on their mining and modeling. However, many phenomena are comprised of polyadic interactions between more than two vertices. Such complex hypergraphs range from emails among groups of individuals, scholarly collaboration, or joint interactions of proteins in living cells.\n  A key generative principle within social and other complex networks is transitivity, where friends of friends are more likely friends. The previously proposed Iterated Local Transitivity "},"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":"2101.12560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2021-01-29T13:23:54Z","cross_cats_sorted":[],"title_canon_sha256":"29d5aedde9e05386bffddeed377ec07de8b2e13392c893c5353c6f87aa64be57","abstract_canon_sha256":"aaf6a3eb68b99c6387e3d42ce91f12d0e07064a0deed2f84908643aaa0b74c1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:10:45.440396Z","signature_b64":"oS6RbV2dfAzZ32iguLKhgIl4Lpj6ep+ux82qMGVFyMrcD4XUhoY9UkE4jHWU67eHiP0DcFGixlOb7VoG7T9eAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c08f848fdd1f8a5bb329d3dcbf4431c46c714dd9410a9a8be8bbe9fef4ec31e8","last_reissued_at":"2026-07-05T02:10:45.439938Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:10:45.439938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The iterated local transitivity model for hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Anthony Bonato, Melissa A. Huggan, Natalie C. Behague, Rehan Malik, Trent G. Marbach","submitted_at":"2021-01-29T13:23:54Z","abstract_excerpt":"Complex networks are pervasive in the real world, capturing dyadic interactions between pairs of vertices, and a large corpus has emerged on their mining and modeling. However, many phenomena are comprised of polyadic interactions between more than two vertices. Such complex hypergraphs range from emails among groups of individuals, scholarly collaboration, or joint interactions of proteins in living cells.\n  A key generative principle within social and other complex networks is transitivity, where friends of friends are more likely friends. The previously proposed Iterated Local Transitivity "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.12560","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/2101.12560/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":"2101.12560","created_at":"2026-07-05T02:10:45.439997+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.12560v1","created_at":"2026-07-05T02:10:45.439997+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.12560","created_at":"2026-07-05T02:10:45.439997+00:00"},{"alias_kind":"pith_short_12","alias_value":"YCHYJD65D6FF","created_at":"2026-07-05T02:10:45.439997+00:00"},{"alias_kind":"pith_short_16","alias_value":"YCHYJD65D6FFXMZJ","created_at":"2026-07-05T02:10:45.439997+00:00"},{"alias_kind":"pith_short_8","alias_value":"YCHYJD65","created_at":"2026-07-05T02:10:45.439997+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/YCHYJD65D6FFXMZJ2POL6RBRYR","json":"https://pith.science/pith/YCHYJD65D6FFXMZJ2POL6RBRYR.json","graph_json":"https://pith.science/api/pith-number/YCHYJD65D6FFXMZJ2POL6RBRYR/graph.json","events_json":"https://pith.science/api/pith-number/YCHYJD65D6FFXMZJ2POL6RBRYR/events.json","paper":"https://pith.science/paper/YCHYJD65"},"agent_actions":{"view_html":"https://pith.science/pith/YCHYJD65D6FFXMZJ2POL6RBRYR","download_json":"https://pith.science/pith/YCHYJD65D6FFXMZJ2POL6RBRYR.json","view_paper":"https://pith.science/paper/YCHYJD65","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.12560&json=true","fetch_graph":"https://pith.science/api/pith-number/YCHYJD65D6FFXMZJ2POL6RBRYR/graph.json","fetch_events":"https://pith.science/api/pith-number/YCHYJD65D6FFXMZJ2POL6RBRYR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YCHYJD65D6FFXMZJ2POL6RBRYR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YCHYJD65D6FFXMZJ2POL6RBRYR/action/storage_attestation","attest_author":"https://pith.science/pith/YCHYJD65D6FFXMZJ2POL6RBRYR/action/author_attestation","sign_citation":"https://pith.science/pith/YCHYJD65D6FFXMZJ2POL6RBRYR/action/citation_signature","submit_replication":"https://pith.science/pith/YCHYJD65D6FFXMZJ2POL6RBRYR/action/replication_record"}},"created_at":"2026-07-05T02:10:45.439997+00:00","updated_at":"2026-07-05T02:10:45.439997+00:00"}