{"as_of":"2026-08-08T22:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a826c3b2b3aa5e8071e05aa84e2f74dd60bd9addff22d9252905c3d2ba1a9438","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-08T06:32:00.761636+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-06T08:33:12.129171Z","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:930ab2bebb1503c1c2c3f127721ea3e02699ffa86621f14dd9dbbf37f0ee9052","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-06T08:33:12.129171Z","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:9511aaaaaa4fea3286c593288548408c0bbe4f713ecee5d560bb01123d5b5bc7","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-06T08:33:12.129171Z","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:ab09aad14df747ecd3a8598f7db42d08f5e61f94067003796b51603c766eeb36","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-06T08:33:12.129171Z","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:db989564db7da872685d64b6c1c1b155afa083840527aea056143ecfb06d504e","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-06T08:33:12.129171Z","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:dfa95b84242279c0050f023cb8d0008c9dc369b1f3f8078134383656bee23a44","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-06T08:33:12.129171Z","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:5a946ab6d6d9ba98f92202262ce83aab96383590e4511e7a1d8aeff683c02611","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-06T08:33:12.129171Z","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:acc0cbf37169fa55124fde185821a7d49bd635167c6b796793bb9d4fe63f3f54","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-06T08:33:12.129171Z","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:eed4b66da85639a2b8714d7ccfea6e41b8e692a622638f6e5fb495aabdd83122","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-06T08:33:12.129171Z","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:00b1a01d2f9b62f79b1c2f4e16ad7dbecfdda8ce829cf3d1eb04d28560b1fdff","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-06T08:33:12.129171Z","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:1ae57c53fb9ec30e78e9b0af5323baca9047e67d1f85c4f15bd3d9f3692bb63e","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-06T08:33:12.129171Z","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:892d6165c86065f33617a485c2577a57fadc2d1e40d32bed34bbdac3a62a7506","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-06T08:33:12.129171Z","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:e08c936b1edbae044d439227e40d6a5ffc57ee8ecee40db8eb5138029e642e71","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-06T08:33:12.129171Z","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:fe858c267928a0085d4b4dd81f7d71607b191efa6b68261dc2b17fef66cd05a1","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-06T08:33:12.129171Z","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:e6a58b035c41e47cd54aa0c6b04988f372a3571c9f07473b5888fa8daa55b8af","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-06T08:33:12.129171Z","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:dd07127218876578066c40d08640bf6fbe4300053eeef532bbbd6852fa0469f5","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-06T08:33:12.129171Z","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:cf69e1d39903e19868b7e07afceabcc0eb123409240a7e9efded33abc1b470d9","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-06T08:33:12.129171Z","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:74a1101903879e34da2653f36106fcbbcaac474f84ee9b5d6131c78c0d6f16e1","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-06T08:33:12.129171Z","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:545f6a9b320fffaa858760e4fea2ae0a9bcd695a4303eaeb804198db4beea37a","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-06T08:33:12.129171Z","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:4e3a06ecbe3f4277601c74c2fd1e4db1200954577289c1bf8243bd677db77c99","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-06T08:33:12.129171Z","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:90c2d2117cc348658a7e8e3bdc2df389348517ffe896a8f18ce37bf566ed19c7","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-06T08:33:12.129171Z","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:2d8d9e48aecfd6da612bbd44b5811ed8344e6cec1cad39bd96729a710c68be17","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-06T08:33:12.129171Z","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:cfa198a608fea249ff4ef23d59a850999bc69347af2ecf369a7b2fc38fd1ef74","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-06T08:33:12.129171Z","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:0d2398cd027d19589509381d637be107d5c8387eba0d2cdaa636f6f7e5d9f545","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-06T08:33:12.129171Z","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:71c64a1865ef62a49ebf04a12c6c0f40f4005787fcfc434e8265c169366d49fb","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-06T08:33:12.129171Z","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:9a267b061491841720f8ff9a994c53ba15c9aceaefb09ad35151290281849a2e","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-06T08:33:12.129171Z","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:9c667f0996e78a4b9750967257ba522909617906b6702bebde6368c0f0cd8417","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-06T08:33:12.129171Z","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:7190543734f4844306a0ae6e66980a105afa02febad6c82d9fffa8ed6ddd916c","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-06T08:33:12.129171Z","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:ef61c121647f1ebdd28efc2a6c688e35c9425df4ca2f998b7d2879643439df34","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-06T08:33:12.129171Z","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:9862bcb7d4b47f424cc018c1eacce1b9b2ab6ec50fb9a1a4fc7fa32399aa67e7","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-06T08:33:12.129171Z","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:d385278c4afdff25267b67e9f23ea365e9170f78d6233207243e72886c0ef0f0","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-06T08:33:12.129171Z","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:fe8b5455832f1620edd86b6453d8e00e000f3e0054a7e5a1452251ecfed2960d","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-06T08:33:12.129171Z","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:fb9e299f540ae4ef106d6f371be1431abef51eec0c4b10da9f1ace084348e002","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-06T08:33:12.129171Z","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:ab0195bbd56517aa44a34d798f62fbffd9cea481ea1c4b3a57a9443fdd1ba87b","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-06T08:33:12.129171Z","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:6c6dd70c63de802482b2fef54cb1ec56dd9ccceff7add8fec4ae3e30605485ee","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-06T08:33:12.129171Z","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:baf2496c051cb7f1fc1255aa4ca2685037fe7d2eee3b3b6fc71095c81ab48c72","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-06T08:33:12.129171Z","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:4fb2ee36fe856d5cb2fc292c9b5a95a528e6789111d2a9ce2a083fa03784fb6f","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-06T08:33:12.129171Z","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:d6559fd5af4934b4bc0046804c8bf6111fd4ea05d6163763227a965cda14bff9","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-06T08:33:12.129171Z","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:e838c65f931433648e4180af8622d51768ca2a10c98925025f080f040e933427","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-06T08:33:12.129171Z","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:ba43ba55c232761d6bdef9cc15ef27a889946b24842c169ce834c1c3f3658897","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-06T08:33:12.129171Z","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:f7195be9acddde929e6287c10a1d58d2115e624aca7ddf6a3e90165c98f79a05","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-06T08:33:12.129171Z","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:6297a750d6a0ac062f6499df55ea356d2a3c59ec28240837f9cddca2fe27e6f9","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-06T08:33:12.129171Z","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:346794bda50f0f887472b8764b8ab302bc98692ec28d3656da640fd1a8518354","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-06T08:33:12.129171Z","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:9ee6de27f1f0ceb0d5544486aa389e536e560ec52724e482f6c1cbac268cc083","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-06T08:33:12.129171Z","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:7c1ff212d29eb3d1f500254b0d54f778f130db4e9b79727a4157eaa965a823cc","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-06T08:33:12.129171Z","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:68a2e1e3bf63c42b04877eb0da689efee655d4a6489defbfe45f89ca377a7b3e","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-06T08:33:12.129171Z","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:ec6637ce3fb35bfbd1b02d4be7b48f638353f96fbbae8b0992a1284b5cbe1d77","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-06T08:33:12.129171Z","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:4cc8ec195b445698394c7da7c25ed472596cff4ead44512a869cf138478767ac","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-06T08:33:12.129171Z","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:190274aff36bfea2a78eca48b38ff4939ac9b4337f95a732c9ab5e763c8d5b90","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-06T08:33:12.129171Z","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:c155998f8936a8a10cb8bbab29ac2543a9a71f75bd855c8701ca5ee94f5c2225","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-06T08:33:12.129171Z","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:affeda3921ab18d2a410474fe0fc118678e2d493242266639a8fed95eef1cdcc","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-06T08:33:12.129171Z","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:53ab234924afa95f59dfd3b6941003e1b86442355af1530e9e9fa1bfccbc3002","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-06T08:33:12.129171Z","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:7fd0d3058cd0fb75741fc1f94939670983f54a180d92468bad8f1a111f40c915","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-06T08:33:12.129171Z","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:02bf67868f940cb19ed4c1f4ba809f12528fdc68ec1af4347a1d3089ef416cc2","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-06T08:33:12.129171Z","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:34a9515d4a6d42e52380c54a3914bda25de7e3153192cd904db692fae98d69c7","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-06T08:33:12.129171Z","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:4001428dde3ba19c84d894522b9b4fa7835c9fcd3d2e725ff2cccfb2fbc2bfea","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-06T08:33:12.129171Z","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:c97f32cd21e4d9c4051fa612c8f54ba14e93fa57446a240eef0677835d9222eb","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-06T08:33:12.129171Z","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:7a3660996dc6f6a167751f3aea08c128db5086f18f5bce78ce153af40c9814bd","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-06T08:33:12.129171Z","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:0074f8a54f1f549b993a843a60f969c74b4f262b3c384395f3faf410eacdec11","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-06T08:33:12.129171Z","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:74d8629b3e23119cf20a982c56df3b2bab3a4ab9f2909f6dddafb063457cced2","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-06T08:33:12.129171Z","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:1cdd64939b2f329fd412f36be575b183b9e470cfc2b543a0ed961c516ee2d5af","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-06T08:33:12.129171Z","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:8f00c90916f83cfe2049a8b7323186158472e65a91fb039617625454df63e73d","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-06T08:33:12.129171Z","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:0e249ca1012afc42ad0ad3a9338fb37b939dbaf302b62f485f5819291da3a8c5","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-06T08:33:12.129171Z","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:a230c4db5fb174720e5ebe457597ed26fcc29c78144c1c4cc4d40b71cc763221","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-06T08:33:12.129171Z","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:82d02c133f19eac43cd8999924f3bc874b824e2da7b1de085942eaa74b276366","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-07-06T11:54:57.307811Z","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-06T08:33:12.129171Z","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:2cf1f637a712d0013bf14990dc4dce46452a57d45ba7ea305215e26ce700455a","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-06T08:33:12.129171Z","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:a6cf6ab81d91316b24dc3787c76099bb9c394025c47d1013dc8f80c6191d4d3d","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-05T20:54:22.654878Z","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-06T08:33:12.129171Z","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:ec2a415f852bd8b036c0cb5284701ad21385b08d06bba5cc38078d5cab4d1fbc","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-06T08:33:12.129171Z","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:9a727d4a35a93285c2005f7d3c7a78f863030fa850127c48489ac33008c1be78","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-06T08:33:12.129171Z","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:d9adb4f58425fbc0a6db83cc23f0f35a7a0e4cc883c0470997623d8d5bb159b6","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-06T08:33:12.129171Z","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:207dc31fe8268694264fe0f69e049797937a8f2696243095f1e6e6d567ccc7ce","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-06T08:33:12.129171Z","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:8cdd04355f0f0e9d560cd464d19fd2e638d6b2c4d1159dce6aab58687a53a12c","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-06T08:33:12.129171Z","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:4263e609946415135aa4e10290a3e7d1050c56f29f6f49f5c6308d1663271e9a","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-06T08:33:12.129171Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 72 of 72 outbound references and 0 inbound Pith citation observations for arXiv:2607.24506."}