{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LVFKRGJJI64VLQ4ZIFVHYROPFS","short_pith_number":"pith:LVFKRGJJ","schema_version":"1.0","canonical_sha256":"5d4aa8992947b955c399416a7c45cf2c8cfbbed0e93f9863895c3ceb5bfb372d","source":{"kind":"arxiv","id":"1207.5812","version":1},"attestation_state":"computed","paper":{"title":"Isospectral Compression and Other Useful Isospectral Transformations of Dynamical Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.CD"],"primary_cat":"math.DS","authors_text":"Benjamin Webb, Leonid Bunimovich","submitted_at":"2012-07-24T20:15:52Z","abstract_excerpt":"It is common knowledge that a key dynamical characteristic of a network is its spectrum (the collection of all eigenvalues of the network's weighted adjacency matrix). In \\cite{BW10} we demonstrated that it is possible to reduce a network, considered as a graph, to a smaller network with fewer vertices and edges while preserving the spectrum (or spectral information) of the original network. This procedure allows for the introduction of new equivalence relations between networks, where two networks are spectrally equivalent if they can be reduced to the same network. Additionally, using this t"},"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":"1207.5812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2012-07-24T20:15:52Z","cross_cats_sorted":["nlin.CD"],"title_canon_sha256":"d782f2ac2d13cc094a0b6f03fbd11acc23afcda6da6876ae4d213b10b14f2140","abstract_canon_sha256":"b7b44da9b4fb4d8277d23415dce6db10512fcc22c67117c83e7d42136e0259ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:56:08.137082Z","signature_b64":"dCh7/JI9iv/XHzS30dkECFsEHbQnS4AcwiJS9SDS1tR+LbCgfr6C62VVMRu1AAfGwhwjxtJ1Qrawy6BI/u6rCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d4aa8992947b955c399416a7c45cf2c8cfbbed0e93f9863895c3ceb5bfb372d","last_reissued_at":"2026-05-18T01:56:08.136588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:56:08.136588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Isospectral Compression and Other Useful Isospectral Transformations of Dynamical Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.CD"],"primary_cat":"math.DS","authors_text":"Benjamin Webb, Leonid Bunimovich","submitted_at":"2012-07-24T20:15:52Z","abstract_excerpt":"It is common knowledge that a key dynamical characteristic of a network is its spectrum (the collection of all eigenvalues of the network's weighted adjacency matrix). In \\cite{BW10} we demonstrated that it is possible to reduce a network, considered as a graph, to a smaller network with fewer vertices and edges while preserving the spectrum (or spectral information) of the original network. This procedure allows for the introduction of new equivalence relations between networks, where two networks are spectrally equivalent if they can be reduced to the same network. Additionally, using this t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5812","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":""},"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":"1207.5812","created_at":"2026-05-18T01:56:08.136666+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.5812v1","created_at":"2026-05-18T01:56:08.136666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5812","created_at":"2026-05-18T01:56:08.136666+00:00"},{"alias_kind":"pith_short_12","alias_value":"LVFKRGJJI64V","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LVFKRGJJI64VLQ4Z","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LVFKRGJJ","created_at":"2026-05-18T12:27:14.488303+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/LVFKRGJJI64VLQ4ZIFVHYROPFS","json":"https://pith.science/pith/LVFKRGJJI64VLQ4ZIFVHYROPFS.json","graph_json":"https://pith.science/api/pith-number/LVFKRGJJI64VLQ4ZIFVHYROPFS/graph.json","events_json":"https://pith.science/api/pith-number/LVFKRGJJI64VLQ4ZIFVHYROPFS/events.json","paper":"https://pith.science/paper/LVFKRGJJ"},"agent_actions":{"view_html":"https://pith.science/pith/LVFKRGJJI64VLQ4ZIFVHYROPFS","download_json":"https://pith.science/pith/LVFKRGJJI64VLQ4ZIFVHYROPFS.json","view_paper":"https://pith.science/paper/LVFKRGJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.5812&json=true","fetch_graph":"https://pith.science/api/pith-number/LVFKRGJJI64VLQ4ZIFVHYROPFS/graph.json","fetch_events":"https://pith.science/api/pith-number/LVFKRGJJI64VLQ4ZIFVHYROPFS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LVFKRGJJI64VLQ4ZIFVHYROPFS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LVFKRGJJI64VLQ4ZIFVHYROPFS/action/storage_attestation","attest_author":"https://pith.science/pith/LVFKRGJJI64VLQ4ZIFVHYROPFS/action/author_attestation","sign_citation":"https://pith.science/pith/LVFKRGJJI64VLQ4ZIFVHYROPFS/action/citation_signature","submit_replication":"https://pith.science/pith/LVFKRGJJI64VLQ4ZIFVHYROPFS/action/replication_record"}},"created_at":"2026-05-18T01:56:08.136666+00:00","updated_at":"2026-05-18T01:56:08.136666+00:00"}