{"as_of":"2026-08-20T07:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c0ca65cf201d1b9f12c35510fde271376efa7e50a79ede5f0afdc62091bd7000","coverage":[{"denominator":72,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":72,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T12:59:33.079112Z","state":"measured"},{"denominator":72,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":72,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.24506/citation-record","integrity":"/paper/2607.24506/integrity","json":"/paper/2607.24506/citation-record.json","paper":"/paper/2607.24506"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.783712Z","title":"Complex network topology of transportation systems.Transport reviews, 33(6):658–685, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.783712Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:2ffae006c7839a1b24f10dcdf9abcf5d5133f911a0827064b0eae7231da728f1","observation_id":"597be160-5dfc-42ec-989f-b9e1273de6f9","resolution":{"observed_at":"2026-07-31T12:59:32.783712Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.788483Z","title":"The network analysis of urban streets: a primal approach","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.788483Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:4a41048bbbd15284636322c662d11ed117d6aa8a51275f56477bebf2bf050a4c","observation_id":"0e889712-07b4-46a8-9970-f7353bea9953","resolution":{"observed_at":"2026-07-31T12:59:32.788483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.792844Z","title":"The network analysis of urban streets: a dual approach","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.792844Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:f71815d4e31d0aad562e8261e725d712c3da4c9a9fa52bb258939dff8835e805","observation_id":"e9b5a74f-22cc-4f50-b345-e45c6ac31315","resolution":{"observed_at":"2026-07-31T12:59:32.792844Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.797436Z","title":"Network harness: Metropo- lis public transport.Physica A: Statistical Mechanics and its Applications, 380:585–591, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.797436Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:4534e1d76083b38b40a17021286ebbab44c7ff6d3d9bdee9bfab1b89d9b3a310","observation_id":"1dc8c85f-2c6d-4392-a33f-f65d7bd94674","resolution":{"observed_at":"2026-07-31T12:59:32.797436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.801877Z","title":"Role of road network features in the evaluation of incident impacts on urban traffic mobility.Transportation research part B: methodological, 117:101–116, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.801877Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:14fc27b61536f0e8419d08f02bbb1f4c895d7fcbd6b6f9afe542a9a0b4a82751","observation_id":"f3ac4eab-01da-416c-b530-d20d75a8f921","resolution":{"observed_at":"2026-07-31T12:59:32.801877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.806704Z","title":"Statistical analysis of 22 public transport networks in poland","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.806704Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:8bef5d89bd19b782be240ed865fbf290a480d1458141f5b7ed14d3af8263ad4b","observation_id":"51f2e282-224b-4060-8539-213933641b16","resolution":{"observed_at":"2026-07-31T12:59:32.806704Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.811424Z","title":"Enforcing optimal routing through dynamic avoid- ance maps.Transportation Research Part B: Methodological, 149:118–137, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.811424Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:e87d7f83dae126a107abf5741fbfc987f140e2addb32710f367b8d09008c72b9","observation_id":"b2945ce2-8b0b-47dc-92d3-82de4a93e91b","resolution":{"observed_at":"2026-07-31T12:59:32.811424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.815244Z","title":"On the spatial partitioning of urban transportation networks.Trans- portation Research Part B: Methodological, 46(10):1639–1656, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.815244Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:f353122b78f4fe156030e6ec91a4a8eb09cfee4cacf3dbf2333fb32094227b28","observation_id":"d30240cf-0b55-47f8-ab92-e57d3beebc98","resolution":{"observed_at":"2026-07-31T12:59:32.815244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.819288Z","title":"Identification of communities in urban mobility networks using multi-layer graphs of network traffic.Transportation Research Part C: Emerging Technologies, 89:254–267, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.819288Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:d9b19b50e9ad3bf53191ef3aec3d4316892cb2688fc7891e0e1614dfe2472f3b","observation_id":"a1710eaa-91ad-4a72-b148-6e0e649c3939","resolution":{"observed_at":"2026-07-31T12:59:32.819288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.823280Z","title":"A statistical method for estimating predictable differences between daily traffic flow profiles.Transportation Research Part B: Methodological, 95:196–213, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.823280Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:753b1b259060b02f36f8e4d9c57401efc398a1f8ddd73caecd0cee7378d38c71","observation_id":"f8c7e323-c12b-4b4e-970c-264afa8c36a7","resolution":{"observed_at":"2026-07-31T12:59:32.823280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.827205Z","title":"Valuing travel time variability: Characteristics of the travel time distribution on an urban road.Transportation Research Part C: Emerging Technologies, 24:83–101, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.827205Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:778875713d08d37d6d1d354d8ef7cfa8f6c908150782a7b1a2f0091deecaa966","observation_id":"4c2f4e85-5220-477a-8e69-5cc8e207f925","resolution":{"observed_at":"2026-07-31T12:59:32.827205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.831146Z","title":"Clustering of heterogeneous networks with directional flows based on “snake” similarities.Transportation Research Part B: Methodological, 91:250– 269, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.831146Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:a49c56b9273e76f32cf50cd6925e2ad70a2dbaf686cb861dc4aefc2a026d0d20","observation_id":"7d860566-bd93-4e7c-9a75-d4dd5c2c9ac6","resolution":{"observed_at":"2026-07-31T12:59:32.831146Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.835213Z","title":"Current trends in road traffic network division for distributed or parallel road traffic simulation","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.835213Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:62d0d8b9b99542c0a0b2c27ec3faecab7e102094ae99e8576d5da6d5cde82382","observation_id":"23a06e2b-2ba9-4f41-a550-a3574247ed16","resolution":{"observed_at":"2026-07-31T12:59:32.835213Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.839161Z","title":"A decomposition approach to the static traffic assignment problem.Transportation Research Part B: Methodological, 105:270–296, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.839161Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:ec33f5d8c98ea58ffc72ef471321de7712c01b23f321928359301a3659388424","observation_id":"93be8c2a-1896-481d-9e80-038c110778bd","resolution":{"observed_at":"2026-07-31T12:59:32.839161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.844559Z","title":"A partitioning strategy for nonuniform problems on multiproces- sors.IEEE Transactions on Computers, 100(5):570–580, 1987","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.844559Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:2e7fda80b7a1087345cd72370f0130a71e019d5498a207873e8538c83a01a55c","observation_id":"fd127865-8168-4ea4-8c3c-ed3c0fe9eaf6","resolution":{"observed_at":"2026-07-31T12:59:32.844559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.848654Z","title":"Spartsim: A space partitioning guided by road network for distributed traffic simulations","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.848654Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:852424f6d626d9a3193ee360fb7a3ae4f6aafc753f5184463ec9c30725e3861d","observation_id":"a83febe7-0744-4aa9-a1c9-ced7ace24703","resolution":{"observed_at":"2026-07-31T12:59:32.848654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.853009Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.853009Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:e2a0d0e441fea3580b5e6c2f0641a9c1df7c0a728b03489c79efd0646e863f63","observation_id":"eccbc88d-b2c2-4dce-9664-829cc1383844","resolution":{"observed_at":"2026-07-31T12:59:32.853009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.857053Z","title":"Vu, and Christopher Leckie","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.857053Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:71429c20eb7424d5b295cd428a6c56f0d110cae66b4584acffc611bab38b9669","observation_id":"d7807a47-6c89-4378-b831-6d17bfba6913","resolution":{"observed_at":"2026-07-31T12:59:32.857053Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.861182Z","title":"Road network partitioning method based on canopyk-means clustering algorithm.Archives of Transport, 54(2):95–106, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.861182Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:ea6448becd0ed6333bc2bb25905f25b50618131d9cd7139bcd6d1a56b2ebed3a","observation_id":"29f470ce-8923-47a4-af0b-2f6787db271d","resolution":{"observed_at":"2026-07-31T12:59:32.861182Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.865212Z","title":"Dynamics of heterogeneity in urban net- works: aggregated traffic modeling and hierarchical control.Transportation Research Part B: Method- ological, 74:1–19, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.865212Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:c51c0b11f26a51e979841ac3c92f7d5693b19bfb2b505831b916d2f8dec5c5ea","observation_id":"604ffea5-d6f6-46a6-b713-cfeb85bd3167","resolution":{"observed_at":"2026-07-31T12:59:32.865212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.869299Z","title":"Mode differentiation in par- titioning of mixed bi-modal urban networks.Transportmetrica B: Transport Dynamics, 11(1):463–485, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.869299Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:65e4cdb31f7c69114ee73fc882d4d1cd5d63bcf2cedb4bfc0c2d689895f19daf","observation_id":"5e9c2cf1-d20a-4eeb-86ce-72e1b973503a","resolution":{"observed_at":"2026-07-31T12:59:32.869299Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.873204Z","title":"Exploring dynamic urban mobility patterns from traffic flow data using community detection.Annals of GIS, 30(4):435–454, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.873204Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:af9c00f2db352d30d2c0372922e6acc6ace357bb15b219149eda2c0f82679342","observation_id":"b072a991-bbbc-466e-9f19-28d7fe638d9f","resolution":{"observed_at":"2026-07-31T12:59:32.873204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.877054Z","title":"Comparing community detection algorithms in transport networks via points of interest.IEEE Access, 6:29729–29738, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.877054Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:af83ea20505fe93184cad4723e507bd2eb33d089175570cedbf08518e4a7996d","observation_id":"4ce6e05d-6bf4-4063-995f-e336f363486b","resolution":{"observed_at":"2026-07-31T12:59:32.877054Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.883206Z","title":"Analyzing a multilayer comprehen- sive passenger transport network through overlapping community detection.Transportation Research Record, 2678(11):1517–1532, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.883206Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:4fa0ba7079f205d8fbd28476f07a026d76ca0569be23a0f388eede37da92f1fc","observation_id":"eaa073b6-511d-4be3-bc10-6e38b338f78f","resolution":{"observed_at":"2026-07-31T12:59:32.883206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.887349Z","title":"Designing bike networks using the concept of network clusters.Applied network science, 3(1):12, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.887349Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:586decbb012ebd90c649816f37c59b028ac44af7800886ecab68f2aa4e51f44b","observation_id":"3146891e-943c-4fb5-8512-110b1b1bd015","resolution":{"observed_at":"2026-07-31T12:59:32.887349Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.891435Z","title":"The structure of spatial networks and communities in bicycle sharing systems.PloS One, 8(9):e74685, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.891435Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:0b2b62fa75c3b255db8ad56d8078713be8be15f1c2115ba505df7aa61d286195","observation_id":"1456fa7a-8760-4a94-b0cb-acd1962a7473","resolution":{"observed_at":"2026-07-31T12:59:32.891435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.895381Z","title":"Exploring the spatiotemporal patterns of shared bicycle usage: a case study of metrobike in austin, texas.Computational Urban Science, 5(1):52, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.895381Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:8e8b1754a0c655e632d0395f6a786bdc790c4cf1b45bdd239c58a674412dceb3","observation_id":"fe948a09-1c29-4e5d-9228-f00c878aa138","resolution":{"observed_at":"2026-07-31T12:59:32.895381Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.899333Z","title":"Study on community detection method for morning and evening peak shared bicycle trips in urban areas: A case study of six districts in beijing","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.899333Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:2a60ee07732e90d9364df003e0f3e5649cce7f2eb00dfe426a83ae19c0d3b720","observation_id":"75cc9c17-7d0e-4770-8077-cdd8567eab35","resolution":{"observed_at":"2026-07-31T12:59:32.899333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.903892Z","title":"A survey of kernel and spectral methods for clustering.Pattern recognition, 41(1):176–190, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.903892Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:3d1cf2179be51aad0cc0238b627fe01b5fe8e9f993287b9124b666f9b86c53bd","observation_id":"2fb7c8a7-dc9a-458f-b59e-d83b49e6c5eb","resolution":{"observed_at":"2026-07-31T12:59:32.903892Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.907881Z","title":"An efficient heuristic procedure for partitioning graphs.The Bell system technical journal, 49(2):291–307, 1970","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.907881Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:5d8ddd4b9ec7133280fbfdf4891798a920e2088ff729309441511f621506a7e5","observation_id":"b2045935-5d36-4b2b-81cd-18ff44d7db51","resolution":{"observed_at":"2026-07-31T12:59:32.907881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.912294Z","title":"Metis: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.912294Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:bc82bd63753f79b60013cac10b040653110fb0abe3a9adec4f5ea0f68dd4707d","observation_id":"aa30b859-ba38-4565-9bd3-4e674ce92a6e","resolution":{"observed_at":"2026-07-31T12:59:32.912294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.916213Z","title":"Partitioning of urban transportation networks utilizing real-world traffic parameters for distributed simulation in sumo","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.916213Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:b09df2be959ae33083c13be3064eab3753528e79442c0bcfadd7c7c661c08635","observation_id":"cf8d3956-f286-445e-aa0b-f14b60c620b1","resolution":{"observed_at":"2026-07-31T12:59:32.916213Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.920767Z","title":"A graph partitioning algorithm for parallel agent-based road traffic simulation","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.920767Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:0283ce7ae2614b615426632140e2383a883b384dc2b576b77c8dde47fbd1e428","observation_id":"0bcebf3b-a00a-436b-926d-e348797a1d90","resolution":{"observed_at":"2026-07-31T12:59:32.920767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.924968Z","title":"Normalized cuts and image segmentation.IEEE Transactions on pattern analysis and machine intelligence, 22(8):888–905, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.924968Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:9bdaa016b4cc1e558e783aaafebd3b0d4bc65660f62f339635a1358424155e0f","observation_id":"2cfe6595-84c6-49ff-915e-3f23a68806ec","resolution":{"observed_at":"2026-07-31T12:59:32.924968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.929066Z","title":"Investigating transport network vulnerability by capacity weighted spectral analysis.Transportation Research Part B: Methodological, 99:251–266, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.929066Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:ad166f79ff19218c765cf4a3773e55bc0730f874a5460856b431a714463a3647","observation_id":"7ce713b6-8517-4337-8e53-9cc1dc917233","resolution":{"observed_at":"2026-07-31T12:59:32.929066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.932960Z","title":"Evolutionary spectral clustering by incorporating temporal smoothness","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.932960Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:4945f0747f7877eef671375bfffd602cf6b505742d0b520fd397508ec95e8198","observation_id":"4449e83e-6c83-40ef-8ef4-ff11f717fd38","resolution":{"observed_at":"2026-07-31T12:59:32.932960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.937763Z","title":"Partitioning of transporta- tion networks by efficient evolutionary clustering and density peaks.Algorithms, 15(3):76, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.937763Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:3ac74db4bf87aa9ed744c9a9e3c62baa5d444d880d9b3f2c656fc87c66112c4c","observation_id":"7ec7753a-4c39-4c26-b6d1-8d933f2885f3","resolution":{"observed_at":"2026-07-31T12:59:32.937763Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.941663Z","title":"Symnmf: nonnegative low-rank approximation of a simi- larity matrix for graph clustering.Journal of Global Optimization, 62(3):545–574, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.941663Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:509b9dc31314e068c3e6b9a25e7b74f75313e60a7c0e79a2cf6a91cbca5bf1ee","observation_id":"06c1c7d0-35b0-471c-9b0e-ce2003615b77","resolution":{"observed_at":"2026-07-31T12:59:32.941663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.945984Z","title":"A new combinatorial characteristic parameter for clustering-based traffic network partitioning.IEEE Access, 7:40175–40182, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.945984Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:47f1bf0359f656345ee5b11f8a6a3f8b2c515446186f4890acf7da89554d2907","observation_id":"71ff4389-bd36-4335-9d3e-7e38a1dfa8f4","resolution":{"observed_at":"2026-07-31T12:59:32.945984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.949769Z","title":"Finding community structure in very large networks.Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, 70(6):066111, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.949769Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:82aaa706dec0f88ba790a57c1f3e049c4e9345c074bbc35a71e6ce2db88354d3","observation_id":"8f32b259-12ab-486e-adf1-b6535aa56aec","resolution":{"observed_at":"2026-07-31T12:59:32.949769Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.953608Z","title":"Fast unfolding of communities in large networks.Journal of statistical mechanics: theory and experiment, 2008(10):P10008, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.953608Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:76354d0f1779d1a78f5b75b5d7cc1d978b9a396cba8adae44502de4333e60a4a","observation_id":"a06cefdb-6303-425e-b5f4-17b056d45c1a","resolution":{"observed_at":"2026-07-31T12:59:32.953608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.957418Z","title":"Shared bicycles in a city: A signal processing and data analysis perspective.Advances in Complex Sys- tems, 14(03):415–438, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.957418Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:7678e7fdaa19c5542f2dcbc4e9eb6c15d198c55e5469de38211a7ad08dfca5cb","observation_id":"c318a9d1-da5b-4b36-a6c8-a969d5c2e541","resolution":{"observed_at":"2026-07-31T12:59:32.957418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.961215Z","title":"Multi-scale analysis of the european airspace using network community de- tection.PloS One, 9(5):e94414, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.961215Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:081d2a5609e85f3e3218880923eb57c83c138084756ece617ffd9ef0498b1137","observation_id":"1355f58b-1e3c-4b19-846e-9cb419529ed0","resolution":{"observed_at":"2026-07-31T12:59:32.961215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.965148Z","title":"General optimization tech- nique for high-quality community detection in complex networks.Physical Review E, 90(1):012811, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.965148Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:8623571994a1d05a071b44f6c1a73a1bddf669dbc41ed24650644aba29354363","observation_id":"aba562e3-3147-404d-a98f-3f309d0ca521","resolution":{"observed_at":"2026-07-31T12:59:32.965148Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.969391Z","title":"Identifying spatial structure of travel modes through community detection method","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.969391Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:c269058be7b6bca857b7887065a04f1caad1e923907c0049edb19957a2169702","observation_id":"7100862a-710f-4898-b2e6-e25e9d76e739","resolution":{"observed_at":"2026-07-31T12:59:32.969391Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.973159Z","title":"From louvain to leiden: guaranteeing well- connected communities.Scientific reports, 9(1):1–12, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.973159Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:a4ab353414407ce3c00cd1acf7fd3ad24ed5baaf5a860983f2d5fa6918d6be5e","observation_id":"062d332b-92cd-4b0f-a6b3-8af8e9d59b32","resolution":{"observed_at":"2026-07-31T12:59:32.973159Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.977630Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.977630Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:1a07afd3ac08f4ed645effb3bf8314eccb08a9d8c846ad802890d23cacdae0d6","observation_id":"6a9b15dc-71c5-4cad-8a03-47cfefa77f7d","resolution":{"observed_at":"2026-07-31T12:59:32.977630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.981604Z","title":"Maps of random walks on complex networks reveal community structure.Proceedings of the national academy of sciences, 105(4):1118–1123, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.981604Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:3ab55652bf64c144b36910810ec9d49ade0631ee40774893bf8a87df52c5b5a4","observation_id":"139c22ad-3022-4ede-a1d8-6f1682d19138","resolution":{"observed_at":"2026-07-31T12:59:32.981604Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.985234Z","title":"Computing communities in large networks using random walks","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.985234Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:5dead365c750df2b2925eb71876614c17b8c76be0a523f012fc981b99ba31006","observation_id":"224f7d31-9c4c-4ad0-ad75-47234b90ec0b","resolution":{"observed_at":"2026-07-31T12:59:32.985234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.988821Z","title":"How good is recursive bisection?SIAM Journal on Scientific Computing, 18(5):1436–1445, 1997","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.988821Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:643e315fbd6f526efcae8c2a23708c2af8da712cd6058ae81b29b8019ffe8685","observation_id":"c0658b95-430c-46c7-b574-8833938ddc79","resolution":{"observed_at":"2026-07-31T12:59:32.988821Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.992453Z","title":"An improved road network partition algorithm for parallel micro- scopic traffic simulation","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.992453Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:af62e368f934fb789f1b57e67ba320b48d74d3a9d6a84c58e17ca8784d18d805","observation_id":"0355638d-5455-448e-84ec-8fe94d5c6d0a","resolution":{"observed_at":"2026-07-31T12:59:32.992453Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:32.996755Z","title":"Algorithm as 136: Ak-means clustering algorithm.Journal of the royal statistical society","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:32.996755Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:4bcc8eec5230b0ee8f7173b56f818353ca2fe1af654a7723be0bc2895f2d1340","observation_id":"20296688-0c8c-4826-bdde-d9f5be7cfdf9","resolution":{"observed_at":"2026-07-31T12:59:32.996755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:33.002752Z","title":"Generalized net- work voronoi diagrams: Concepts, computational methods, and applications.International Journal of Geographical Information Science, 22(9):965–994, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.002752Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:9c215bff4e816f9da293f5f20bcda9ac61331b58e8a1ae62a857335a8327ad69","observation_id":"e94c1ad1-8463-4938-b24b-935630de65f9","resolution":{"observed_at":"2026-07-31T12:59:33.002752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:33.006793Z","title":"A spatio-temporal co-clustering framework for discovering mobility patterns: A study of manhattan taxi data.IEEE Access, 9:34338– 34351, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.006793Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:0b23952ccf0ec89cf7663150cb47a3f4af94572c7bc76dc975b89e15d2911652","observation_id":"b2379e4c-32bd-4e11-998b-c1c072463ec1","resolution":{"observed_at":"2026-07-31T12:59:33.006793Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:33.010659Z","title":"Victs: A novel network partition algorithm for scal- able agent-based modeling of mass evacuation.Computers, Environment and Urban Systems, 80:101452, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.010659Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:aea1b4f25e9f4d095a67901cf2ad3b7879b68dea6074a2613bde2aeb4e362667","observation_id":"0ced219b-2a7c-46fd-90cb-f471ba40d06d","resolution":{"observed_at":"2026-07-31T12:59:33.010659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:33.014714Z","title":"Survey of spectral clustering based on graph theory.Pattern Recognition, 151:110366, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.014714Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:0e70773cbd9064ae589998e3a1a4d3c780a4c521144da5b94f60726b77eb64fd","observation_id":"81177096-504d-4858-9c73-f0b3c1889a56","resolution":{"observed_at":"2026-07-31T12:59:33.014714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:33.018709Z","title":"Finding and evaluating community structure in networks.Phys- ical review E, 69(2):026113, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.018709Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:587a915b39b8a968ddbba66b61140c338961bc63be19604de74cad0b24d170ca","observation_id":"90a8949d-d8be-481b-b1b9-19ae544b57f5","resolution":{"observed_at":"2026-07-31T12:59:33.018709Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:33.022597Z","title":"Finding overlapping communities in multilayer networks.PloS One, 13(4):e0188747, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.022597Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:681c412db901a405df14c5f613a58ee6f876b64c6c415facdffd8bc03a6c6334","observation_id":"6fb1fcbc-521e-46cf-b426-7954342302b8","resolution":{"observed_at":"2026-07-31T12:59:33.022597Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:33.026832Z","title":"Least squares quantization in pcm.IEEE transactions on information theory, 28(2):129–137, 1982","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.026832Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:9bd731960ced22aa2c2378f2090fd58b6a7febcd591fb34ce06235cdd3533816","observation_id":"e712f854-136d-4fae-9019-af3cb93c15d6","resolution":{"observed_at":"2026-07-31T12:59:33.026832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:33.031156Z","title":"Dynamic time warping algorithm review.Information and Computer Science Department University of Hawaii at Manoa Honolulu, USA, 855(1-23):40, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.031156Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:585e8a079bdb9b9cbf469ea232fb14d57526027501590786915e63c9402e943f","observation_id":"4a43be95-963f-4e7a-8815-f29f05b0789e","resolution":{"observed_at":"2026-07-31T12:59:33.031156Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:33.035213Z","title":"A modified hausdorff distance for object matching","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.035213Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:3a4b81e7e45242deeef7c4f551c4255f5282364701b4d7c034812f1936197228","observation_id":"18bfc9d8-8430-4acb-9ef2-57362d9d8a5b","resolution":{"observed_at":"2026-07-31T12:59:33.035213Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:33.039117Z","title":"Community detection in node-attributed social networks: a survey.Computer Science Review, 37:100286, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.039117Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:a7f1e671be9f63a432e834d505e88369258d6587f1259d45c9ac1206af0bf40f","observation_id":"91e74228-47cc-4da7-84ae-55507c855b37","resolution":{"observed_at":"2026-07-31T12:59:33.039117Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:33.042947Z","title":"Gromov-wasserstein averaging of kernel and distance matrices","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.042947Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:57e7c10fcfde146a233706d0273c3cd6eb3dfd2951a27f54d42de2c70e4427df","observation_id":"1f30f464-af59-469c-a75a-78deb16df172","resolution":{"observed_at":"2026-07-31T12:59:33.042947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:33.047067Z","title":"Gromov–wasserstein distances and the metric approach to object matching.Founda- tions of computational mathematics, 11(4):417–487, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.047067Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:d6562f611e429fe3e4112c8396a05c802d0f5915f478b2d40172a5c97f7e058f","observation_id":"6a665d4a-db3f-4c10-afb6-1c75c99edb35","resolution":{"observed_at":"2026-07-31T12:59:33.047067Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.02753","last_updated":"2022-03-01T16:28:47Z","snapshot_observed_at":"2026-08-18T08:56:33.758008Z","submitted_at":"2021-10-06T13:38:31Z","title":"Semi-relaxed Gromov-Wasserstein divergence with applications on graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.02753","snapshot_observed_at":"2026-07-31T12:59:33.051220Z","title":"Semi-relaxed gromov-wasserstein divergence with applications on graphs.arXiv preprint arXiv:2110.02753, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.051220Z"},"links":{"cited_paper":"/paper/2110.02753","citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:c4bd5bff0cfe98d91770365ee3e32e5ba97945c093c84536aa79e450a71315e8","observation_id":"8077ee22-fcdc-44d3-ad25-968634ce9cb2","resolution":{"observed_at":"2026-07-31T12:59:33.051220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:33.055497Z","title":"Optimal transport for structured data with application on graphs","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.055497Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:7c1f58968a3bbe2b1577809e289f94bd87d7e0288b93d82c3b30fc5b14348879","observation_id":"88c2b0d3-1b7a-44c7-9655-a6029f804951","resolution":{"observed_at":"2026-07-31T12:59:33.055497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.15570","last_updated":"2026-06-24T14:45:59Z","snapshot_observed_at":"2026-08-16T14:13:50.762303Z","submitted_at":"2025-12-17T16:25:42Z","title":"Optimal Transport-Based Clustering of Attributed Graphs with an Application to Road Traffic Data","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.15570","snapshot_observed_at":"2026-07-31T12:59:33.059125Z","title":"Optimal transport-based clustering of attributed graphs with an application to road traffic data.arXiv preprint arXiv:2512.15570, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.059125Z"},"links":{"cited_paper":"/paper/2512.15570","citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:5e50bc4c93d6be13e85dad383bab8c96d9278ccd8af25cb5a5e3627d5c93a2bc","observation_id":"88f504d6-5214-40ac-877a-9957c2c0135a","resolution":{"observed_at":"2026-07-31T12:59:33.059125Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:33.063448Z","title":"Pot: Python optimal transport.Journal of Machine Learning Research, 22(78):1–8, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.063448Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:3298181e462ba5ff2c868351cedca3d74c4bcc9e4d97dd6e4b13a5492ad5a2b4","observation_id":"52320953-e3d3-4d39-8874-dce3f9de70d4","resolution":{"observed_at":"2026-07-31T12:59:33.063448Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:33.067531Z","title":"Cross- comparison of network clustering methods: Potential macroscopic fundamental diagram (mfd)-based applications.Transportation Research Record, 2679(12):514–532, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.067531Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:c71b5e3966c991d00f6b6f1a5555403355f93920a30e43932643c0171ea261f8","observation_id":"08f3fc87-c74e-4c28-9e68-1c88ca3eb752","resolution":{"observed_at":"2026-07-31T12:59:33.067531Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:33.071464Z","title":"Modularity and community structure in networks.Proceedings of the national academy of sciences, 103(23):8577–8582, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.071464Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:6f103c545d39f3f459ed150d804756fe6ab8e1424836aeacecf9236de03fb359","observation_id":"4fea4445-7bcf-4f5c-9687-bc2eb54f8589","resolution":{"observed_at":"2026-07-31T12:59:33.071464Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:33.075223Z","title":"Lessons from thirteen years of the london cycle hire scheme: A review of evidence.Multimodal Transportation, 3(3):100156, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.075223Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:df4264782a276d9c3fe0331c2083bc0f71067910861ce231c21f2a463c98b74c","observation_id":"4c39e842-f13d-4306-89e4-c2522e28024a","resolution":{"observed_at":"2026-07-31T12:59:33.075223Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:59:33.079112Z","title":"Community structures, interactions and dynamics in london’s bicycle sharing network","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-07-31T12:59:33.079112Z"},"links":{"citing_paper":"/paper/2607.24506"},"observation_digest":"sha256:3f4f7191f66df3bd3f74a10510327857eed75335f841eb26280d98097fb64259","observation_id":"c2a5ce6b-b2bc-4799-884f-c1fab243b479","resolution":{"observed_at":"2026-07-31T12:59:33.079112Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.24506","last_updated":"2026-07-27T14:39:31Z","latest_version":1,"primary_category":"stat.AP","snapshot_observed_at":"2026-08-09T17:07:35.721263Z","submitted_at":"2026-07-27T14:39:31Z","title":"Integrating Structure and Attributes for Transportation Network Partitioning via Optimal Transport"},"reference_resolution":{"displayed":72,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":72,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":72},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 72 of 72 outbound references and 0 inbound Pith citation observations for arXiv:2607.24506."}