{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7JU7DQOPOWZNW5RVFIB4MWTHFL","short_pith_number":"pith:7JU7DQOP","schema_version":"1.0","canonical_sha256":"fa69f1c1cf75b2db76352a03c65a672afd13900dd3b69bdfe8622391a18289ec","source":{"kind":"arxiv","id":"2406.03587","version":1},"attestation_state":"computed","paper":{"title":"Subsuming Complex Networks by Node Walks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Alexandre Benatti, Luciano da F. Costa","submitted_at":"2024-06-05T19:05:58Z","abstract_excerpt":"The concept of node walk in graphs and complex networks has been addressed, consisting of one or more nodes that move into adjacent nodes, henceforth incorporating the respective connections. This type of dynamics is then applied to subsume complex networks. Three types of networks (Erd\\'os- R\\'eny, Barab\\'asi-Albert, as well as a geometric model) are considered, while three node walks heuristics (uniformly random, largest degree, and smallest degree) are taken into account. Several interesting results are obtained and described, including the identification that the subsuming dynamics depend "},"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":"2406.03587","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"physics.soc-ph","submitted_at":"2024-06-05T19:05:58Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"22ce526f6ff3eddc958d82f284294625c4efc656f3757e6ab06ac0f158dc7481","abstract_canon_sha256":"a19bb7e29bd399b500cd1834efc7fbdfe8cf65c4f7b26780c21a2f35a05e1aaa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:13.345921Z","signature_b64":"Gy/x9zbaQMWCExoEeFU04FLplY5f+CbeMwIT+VDBXLdTO8gabLxKmPrL8V3Y4HaCDG3MmOFaZ/5PBeH6tolGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa69f1c1cf75b2db76352a03c65a672afd13900dd3b69bdfe8622391a18289ec","last_reissued_at":"2026-07-05T08:28:13.345460Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:13.345460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subsuming Complex Networks by Node Walks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Alexandre Benatti, Luciano da F. Costa","submitted_at":"2024-06-05T19:05:58Z","abstract_excerpt":"The concept of node walk in graphs and complex networks has been addressed, consisting of one or more nodes that move into adjacent nodes, henceforth incorporating the respective connections. This type of dynamics is then applied to subsume complex networks. Three types of networks (Erd\\'os- R\\'eny, Barab\\'asi-Albert, as well as a geometric model) are considered, while three node walks heuristics (uniformly random, largest degree, and smallest degree) are taken into account. Several interesting results are obtained and described, including the identification that the subsuming dynamics depend "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.03587","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/2406.03587/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":"2406.03587","created_at":"2026-07-05T08:28:13.345519+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.03587v1","created_at":"2026-07-05T08:28:13.345519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.03587","created_at":"2026-07-05T08:28:13.345519+00:00"},{"alias_kind":"pith_short_12","alias_value":"7JU7DQOPOWZN","created_at":"2026-07-05T08:28:13.345519+00:00"},{"alias_kind":"pith_short_16","alias_value":"7JU7DQOPOWZNW5RV","created_at":"2026-07-05T08:28:13.345519+00:00"},{"alias_kind":"pith_short_8","alias_value":"7JU7DQOP","created_at":"2026-07-05T08:28:13.345519+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/7JU7DQOPOWZNW5RVFIB4MWTHFL","json":"https://pith.science/pith/7JU7DQOPOWZNW5RVFIB4MWTHFL.json","graph_json":"https://pith.science/api/pith-number/7JU7DQOPOWZNW5RVFIB4MWTHFL/graph.json","events_json":"https://pith.science/api/pith-number/7JU7DQOPOWZNW5RVFIB4MWTHFL/events.json","paper":"https://pith.science/paper/7JU7DQOP"},"agent_actions":{"view_html":"https://pith.science/pith/7JU7DQOPOWZNW5RVFIB4MWTHFL","download_json":"https://pith.science/pith/7JU7DQOPOWZNW5RVFIB4MWTHFL.json","view_paper":"https://pith.science/paper/7JU7DQOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.03587&json=true","fetch_graph":"https://pith.science/api/pith-number/7JU7DQOPOWZNW5RVFIB4MWTHFL/graph.json","fetch_events":"https://pith.science/api/pith-number/7JU7DQOPOWZNW5RVFIB4MWTHFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7JU7DQOPOWZNW5RVFIB4MWTHFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7JU7DQOPOWZNW5RVFIB4MWTHFL/action/storage_attestation","attest_author":"https://pith.science/pith/7JU7DQOPOWZNW5RVFIB4MWTHFL/action/author_attestation","sign_citation":"https://pith.science/pith/7JU7DQOPOWZNW5RVFIB4MWTHFL/action/citation_signature","submit_replication":"https://pith.science/pith/7JU7DQOPOWZNW5RVFIB4MWTHFL/action/replication_record"}},"created_at":"2026-07-05T08:28:13.345519+00:00","updated_at":"2026-07-05T08:28:13.345519+00:00"}