{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SEGIVIIHF5IAPCL6H3W6OETOVL","short_pith_number":"pith:SEGIVIIH","schema_version":"1.0","canonical_sha256":"910c8aa1072f5007897e3eede7126eaad419ae7739d255db5baf412ddb97e71c","source":{"kind":"arxiv","id":"1511.07305","version":2},"attestation_state":"computed","paper":{"title":"Block Matrix Formulations for Evolving Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Caterina Fenu, Desmond J. Higham","submitted_at":"2015-11-23T16:47:13Z","abstract_excerpt":"Many types of pairwise interaction take the form of a fixed set of nodes with edges that appear and disappear over time. In the case of discrete-time evolution, the resulting evolving network may be represented by a time-ordered sequence of adjacency matrices. We consider here the issue of representing the system as a single, higher dimensional block matrix, built from the individual time-slices. We focus on the task of computing network centrality measures. From a modeling perspective, we show that there is a suitable block formulation that allows us to recover dynamic centrality measures res"},"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.07305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-11-23T16:47:13Z","cross_cats_sorted":["cs.NA","math.NA","physics.soc-ph"],"title_canon_sha256":"1cdaa96d1b1663ef209414d7d39e16a089b1d0d3f98e06624e9a11149d3f50b3","abstract_canon_sha256":"9b9f3e26fdf0ebfca7632d977af5e1340d4d2f896a5174f9c57804e5b1bf9619"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:06.588810Z","signature_b64":"79k2BBYKqfRu0gMtEO01xr0ADRzubOY7w/+5fojDqkQclwdtnqZ6ilsr2vN/VPjaTg0neWqAAmgpJsLNwvC2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"910c8aa1072f5007897e3eede7126eaad419ae7739d255db5baf412ddb97e71c","last_reissued_at":"2026-05-17T23:49:06.588179Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:06.588179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Block Matrix Formulations for Evolving Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Caterina Fenu, Desmond J. Higham","submitted_at":"2015-11-23T16:47:13Z","abstract_excerpt":"Many types of pairwise interaction take the form of a fixed set of nodes with edges that appear and disappear over time. In the case of discrete-time evolution, the resulting evolving network may be represented by a time-ordered sequence of adjacency matrices. We consider here the issue of representing the system as a single, higher dimensional block matrix, built from the individual time-slices. We focus on the task of computing network centrality measures. From a modeling perspective, we show that there is a suitable block formulation that allows us to recover dynamic centrality measures res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07305","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.07305","created_at":"2026-05-17T23:49:06.588269+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07305v2","created_at":"2026-05-17T23:49:06.588269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07305","created_at":"2026-05-17T23:49:06.588269+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEGIVIIHF5IA","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEGIVIIHF5IAPCL6","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEGIVIIH","created_at":"2026-05-18T12:29:39.896362+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/SEGIVIIHF5IAPCL6H3W6OETOVL","json":"https://pith.science/pith/SEGIVIIHF5IAPCL6H3W6OETOVL.json","graph_json":"https://pith.science/api/pith-number/SEGIVIIHF5IAPCL6H3W6OETOVL/graph.json","events_json":"https://pith.science/api/pith-number/SEGIVIIHF5IAPCL6H3W6OETOVL/events.json","paper":"https://pith.science/paper/SEGIVIIH"},"agent_actions":{"view_html":"https://pith.science/pith/SEGIVIIHF5IAPCL6H3W6OETOVL","download_json":"https://pith.science/pith/SEGIVIIHF5IAPCL6H3W6OETOVL.json","view_paper":"https://pith.science/paper/SEGIVIIH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07305&json=true","fetch_graph":"https://pith.science/api/pith-number/SEGIVIIHF5IAPCL6H3W6OETOVL/graph.json","fetch_events":"https://pith.science/api/pith-number/SEGIVIIHF5IAPCL6H3W6OETOVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEGIVIIHF5IAPCL6H3W6OETOVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEGIVIIHF5IAPCL6H3W6OETOVL/action/storage_attestation","attest_author":"https://pith.science/pith/SEGIVIIHF5IAPCL6H3W6OETOVL/action/author_attestation","sign_citation":"https://pith.science/pith/SEGIVIIHF5IAPCL6H3W6OETOVL/action/citation_signature","submit_replication":"https://pith.science/pith/SEGIVIIHF5IAPCL6H3W6OETOVL/action/replication_record"}},"created_at":"2026-05-17T23:49:06.588269+00:00","updated_at":"2026-05-17T23:49:06.588269+00:00"}