{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:G2ZUTS4HXPO4X25ZQ5MTG37UN3","short_pith_number":"pith:G2ZUTS4H","canonical_record":{"source":{"id":"0902.0251","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2009-02-02T11:22:28Z","cross_cats_sorted":["math-ph","math.FA","math.MP"],"title_canon_sha256":"3a895f93f308b8bd22e9bcb8283c7166f256aac39153b4632478de6f22fc63d2","abstract_canon_sha256":"2f0ad46ab9a5391d2f4d2b99c9d0d00814b45a19741b66d49226f0187d6f2725"},"schema_version":"1.0"},"canonical_sha256":"36b349cb87bbddcbebb98759336ff46ed5d8d3f3ca1fc2ccf98bf1924a0bbabc","source":{"kind":"arxiv","id":"0902.0251","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.0251","created_at":"2026-05-18T04:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"0902.0251v2","created_at":"2026-05-18T04:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.0251","created_at":"2026-05-18T04:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"G2ZUTS4HXPO4","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"G2ZUTS4HXPO4X25Z","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"G2ZUTS4H","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:G2ZUTS4HXPO4X25ZQ5MTG37UN3","target":"record","payload":{"canonical_record":{"source":{"id":"0902.0251","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2009-02-02T11:22:28Z","cross_cats_sorted":["math-ph","math.FA","math.MP"],"title_canon_sha256":"3a895f93f308b8bd22e9bcb8283c7166f256aac39153b4632478de6f22fc63d2","abstract_canon_sha256":"2f0ad46ab9a5391d2f4d2b99c9d0d00814b45a19741b66d49226f0187d6f2725"},"schema_version":"1.0"},"canonical_sha256":"36b349cb87bbddcbebb98759336ff46ed5d8d3f3ca1fc2ccf98bf1924a0bbabc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:01.184448Z","signature_b64":"VM6IDAJvxUsMKzgBzoxuacYTp4AwEZgCspB0nLLY37yvWHb8j+6kJm6vzimbrr8Rfq1L7YwM6QAA+Uf6tsOGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36b349cb87bbddcbebb98759336ff46ed5d8d3f3ca1fc2ccf98bf1924a0bbabc","last_reissued_at":"2026-05-18T04:22:01.183994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:01.183994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0902.0251","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"57G+ErveneSbY4zadyVERwEXTUL9aqQ6ff+JH2g1t+I+stQEOETvlbUda9pZpa31/VbTz5TrNzr6qxCioQhqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:24:01.714686Z"},"content_sha256":"dcc44b1a4e9293d995abdbaff891df41e2654d8d072691cde9888608e5af8cc2","schema_version":"1.0","event_id":"sha256:dcc44b1a4e9293d995abdbaff891df41e2654d8d072691cde9888608e5af8cc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:G2ZUTS4HXPO4X25ZQ5MTG37UN3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The L2 strong maximum principle on arbitrary countable networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.FA","math.MP"],"primary_cat":"math.AP","authors_text":"Stefano Cardanobile","submitted_at":"2009-02-02T11:22:28Z","abstract_excerpt":"We study the strong maximum principle for the heat equation associated with the Dirichlet form on countable networks. We start by analyzing the boundedness properties of the incidence operators on a countable network. Subsequently, we prove that the strong maximum principle is equivalent to the underlying graph being connected after deletion of the nodes with infinite degree. Using this result, we prove that the number of connected components of the graph with respect to the heat flow equals the number of maximal invariant ideals of the adjacency matrix."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.0251","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lM4BQh0XJQXY+aH1kPnlL4MLuksjXsvInY/ZsUoX4u2sIbw/50LIiGKJZD2SVqTqdk+kDbvg+jnggwhgvDrpCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:24:01.715543Z"},"content_sha256":"8463b9d49956b81ad733375ddc2f8efada321587ede257d21fa8f8e20cebe1d2","schema_version":"1.0","event_id":"sha256:8463b9d49956b81ad733375ddc2f8efada321587ede257d21fa8f8e20cebe1d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G2ZUTS4HXPO4X25ZQ5MTG37UN3/bundle.json","state_url":"https://pith.science/pith/G2ZUTS4HXPO4X25ZQ5MTG37UN3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G2ZUTS4HXPO4X25ZQ5MTG37UN3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T01:24:01Z","links":{"resolver":"https://pith.science/pith/G2ZUTS4HXPO4X25ZQ5MTG37UN3","bundle":"https://pith.science/pith/G2ZUTS4HXPO4X25ZQ5MTG37UN3/bundle.json","state":"https://pith.science/pith/G2ZUTS4HXPO4X25ZQ5MTG37UN3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G2ZUTS4HXPO4X25ZQ5MTG37UN3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:G2ZUTS4HXPO4X25ZQ5MTG37UN3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2f0ad46ab9a5391d2f4d2b99c9d0d00814b45a19741b66d49226f0187d6f2725","cross_cats_sorted":["math-ph","math.FA","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2009-02-02T11:22:28Z","title_canon_sha256":"3a895f93f308b8bd22e9bcb8283c7166f256aac39153b4632478de6f22fc63d2"},"schema_version":"1.0","source":{"id":"0902.0251","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.0251","created_at":"2026-05-18T04:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"0902.0251v2","created_at":"2026-05-18T04:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.0251","created_at":"2026-05-18T04:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"G2ZUTS4HXPO4","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"G2ZUTS4HXPO4X25Z","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"G2ZUTS4H","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:8463b9d49956b81ad733375ddc2f8efada321587ede257d21fa8f8e20cebe1d2","target":"graph","created_at":"2026-05-18T04:22:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study the strong maximum principle for the heat equation associated with the Dirichlet form on countable networks. We start by analyzing the boundedness properties of the incidence operators on a countable network. Subsequently, we prove that the strong maximum principle is equivalent to the underlying graph being connected after deletion of the nodes with infinite degree. Using this result, we prove that the number of connected components of the graph with respect to the heat flow equals the number of maximal invariant ideals of the adjacency matrix.","authors_text":"Stefano Cardanobile","cross_cats":["math-ph","math.FA","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2009-02-02T11:22:28Z","title":"The L2 strong maximum principle on arbitrary countable networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.0251","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dcc44b1a4e9293d995abdbaff891df41e2654d8d072691cde9888608e5af8cc2","target":"record","created_at":"2026-05-18T04:22:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2f0ad46ab9a5391d2f4d2b99c9d0d00814b45a19741b66d49226f0187d6f2725","cross_cats_sorted":["math-ph","math.FA","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2009-02-02T11:22:28Z","title_canon_sha256":"3a895f93f308b8bd22e9bcb8283c7166f256aac39153b4632478de6f22fc63d2"},"schema_version":"1.0","source":{"id":"0902.0251","kind":"arxiv","version":2}},"canonical_sha256":"36b349cb87bbddcbebb98759336ff46ed5d8d3f3ca1fc2ccf98bf1924a0bbabc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36b349cb87bbddcbebb98759336ff46ed5d8d3f3ca1fc2ccf98bf1924a0bbabc","first_computed_at":"2026-05-18T04:22:01.183994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:01.183994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VM6IDAJvxUsMKzgBzoxuacYTp4AwEZgCspB0nLLY37yvWHb8j+6kJm6vzimbrr8Rfq1L7YwM6QAA+Uf6tsOGDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:01.184448Z","signed_message":"canonical_sha256_bytes"},"source_id":"0902.0251","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dcc44b1a4e9293d995abdbaff891df41e2654d8d072691cde9888608e5af8cc2","sha256:8463b9d49956b81ad733375ddc2f8efada321587ede257d21fa8f8e20cebe1d2"],"state_sha256":"111d09982823fafc4099e14e297bb5edaf9c704f14c57d8897655879543659b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EM22SFtze5IWKj3eFdIp8aOgL/ZIVT61CEwXYgJtS+qPbxCKqG9746NPEDGBBfUFUayYl7F+ktl1WINX/1QgDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:24:01.720301Z","bundle_sha256":"ee2cf6d4a62984460a2ffd85fae9b76a5f584f65a7181d9f4739c3d1a48bea94"}}