{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XRCM3WRNFCCHFCI76VTBCOFQZT","short_pith_number":"pith:XRCM3WRN","schema_version":"1.0","canonical_sha256":"bc44cdda2d288472891ff5661138b0ccf184540253d74d10670cf59faa17a474","source":{"kind":"arxiv","id":"2412.14864","version":1},"attestation_state":"computed","paper":{"title":"Characterising the dynamics of unlabelled temporal networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.CD","physics.data-an"],"primary_cat":"physics.soc-ph","authors_text":"Annalisa Caligiuri, Lucas Lacasa, Tobias Galla","submitted_at":"2024-12-19T13:59:48Z","abstract_excerpt":"Networks model the architecture backbone of complex systems. The backbone itself can change over time leading to what is called `temporal networks'. Interpreting temporal networks as trajectories in graph space of a latent graph dynamics has recently enabled the extension of concepts and tools from dynamical systems and time series to networks. Here we address temporal networks with unlabelled nodes, a case that has received relatively little attention so far. Situations in which node labelling cannot be tracked over time often emerge in practice due to technical challenges, or privacy constra"},"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":"2412.14864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2024-12-19T13:59:48Z","cross_cats_sorted":["nlin.CD","physics.data-an"],"title_canon_sha256":"ca9556c63853256c954d82b7caa505c1fa021ec448a1d53e423807e176322b3c","abstract_canon_sha256":"d5d2153db94b8bb2e85f5cfb4376d9369a3f8efa6515a892b88fad9c9e5409f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:51:53.751309Z","signature_b64":"fvIpQEvPwmUYJOoak16o5l8isul9nW5yBc5vJ1m9ZXmcllQi8AeTaQmqImScWamtCyqs1LH1DazAlv/JK3kICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc44cdda2d288472891ff5661138b0ccf184540253d74d10670cf59faa17a474","last_reissued_at":"2026-07-05T09:51:53.750910Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:51:53.750910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterising the dynamics of unlabelled temporal networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.CD","physics.data-an"],"primary_cat":"physics.soc-ph","authors_text":"Annalisa Caligiuri, Lucas Lacasa, Tobias Galla","submitted_at":"2024-12-19T13:59:48Z","abstract_excerpt":"Networks model the architecture backbone of complex systems. The backbone itself can change over time leading to what is called `temporal networks'. Interpreting temporal networks as trajectories in graph space of a latent graph dynamics has recently enabled the extension of concepts and tools from dynamical systems and time series to networks. Here we address temporal networks with unlabelled nodes, a case that has received relatively little attention so far. Situations in which node labelling cannot be tracked over time often emerge in practice due to technical challenges, or privacy constra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.14864","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/2412.14864/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":"2412.14864","created_at":"2026-07-05T09:51:53.750968+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.14864v1","created_at":"2026-07-05T09:51:53.750968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.14864","created_at":"2026-07-05T09:51:53.750968+00:00"},{"alias_kind":"pith_short_12","alias_value":"XRCM3WRNFCCH","created_at":"2026-07-05T09:51:53.750968+00:00"},{"alias_kind":"pith_short_16","alias_value":"XRCM3WRNFCCHFCI7","created_at":"2026-07-05T09:51:53.750968+00:00"},{"alias_kind":"pith_short_8","alias_value":"XRCM3WRN","created_at":"2026-07-05T09:51:53.750968+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11873","citing_title":"Maximizing Reachability via Shifting of Temporal Paths","ref_index":174,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XRCM3WRNFCCHFCI76VTBCOFQZT","json":"https://pith.science/pith/XRCM3WRNFCCHFCI76VTBCOFQZT.json","graph_json":"https://pith.science/api/pith-number/XRCM3WRNFCCHFCI76VTBCOFQZT/graph.json","events_json":"https://pith.science/api/pith-number/XRCM3WRNFCCHFCI76VTBCOFQZT/events.json","paper":"https://pith.science/paper/XRCM3WRN"},"agent_actions":{"view_html":"https://pith.science/pith/XRCM3WRNFCCHFCI76VTBCOFQZT","download_json":"https://pith.science/pith/XRCM3WRNFCCHFCI76VTBCOFQZT.json","view_paper":"https://pith.science/paper/XRCM3WRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.14864&json=true","fetch_graph":"https://pith.science/api/pith-number/XRCM3WRNFCCHFCI76VTBCOFQZT/graph.json","fetch_events":"https://pith.science/api/pith-number/XRCM3WRNFCCHFCI76VTBCOFQZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XRCM3WRNFCCHFCI76VTBCOFQZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XRCM3WRNFCCHFCI76VTBCOFQZT/action/storage_attestation","attest_author":"https://pith.science/pith/XRCM3WRNFCCHFCI76VTBCOFQZT/action/author_attestation","sign_citation":"https://pith.science/pith/XRCM3WRNFCCHFCI76VTBCOFQZT/action/citation_signature","submit_replication":"https://pith.science/pith/XRCM3WRNFCCHFCI76VTBCOFQZT/action/replication_record"}},"created_at":"2026-07-05T09:51:53.750968+00:00","updated_at":"2026-07-05T09:51:53.750968+00:00"}