{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:265NS4OSHXRZJEJB4OXBFHPSH6","short_pith_number":"pith:265NS4OS","schema_version":"1.0","canonical_sha256":"d7bad971d23de3949121e3ae129df23f9ffd6c2c9dcae3d683f85f7050328947","source":{"kind":"arxiv","id":"1401.7640","version":3},"attestation_state":"computed","paper":{"title":"Modulus of families of walks on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CV"],"primary_cat":"math.CO","authors_text":"Faryad Darabi Sahneh, Max Goering, Nathan Albin, Pietro Poggi-Corradini","submitted_at":"2014-01-29T20:02:45Z","abstract_excerpt":"We introduce the notion of modulus of families of walks on graphs. We show how Beurling's famous criterion for extremality, that was formulated in the continuous case, can be interpreted on graphs as an instance of the Karush-Kuhn-Tucker conditions. We then develop an algorithm to numerically compute modulus using Beurling's criterion as our guide."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1401.7640","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-29T20:02:45Z","cross_cats_sorted":["math.CV"],"title_canon_sha256":"bd2afea8524af10d1b02cb18be11cfd9a0ffca4066c32cd130a7b8b118ded1f3","abstract_canon_sha256":"99c61e4e2985dc997627d79478d614c850a5276f9c094812a8640157ae568f18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:04.991166Z","signature_b64":"ixGcYFlr58ZOiSvkZwYDDRgpa9x8vk7zeHusq/JSYzUhjV6azDzrcUPKYTou6CIe+gXNvShab5egC8Brruf5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7bad971d23de3949121e3ae129df23f9ffd6c2c9dcae3d683f85f7050328947","last_reissued_at":"2026-05-18T00:45:04.990604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:04.990604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modulus of families of walks on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CV"],"primary_cat":"math.CO","authors_text":"Faryad Darabi Sahneh, Max Goering, Nathan Albin, Pietro Poggi-Corradini","submitted_at":"2014-01-29T20:02:45Z","abstract_excerpt":"We introduce the notion of modulus of families of walks on graphs. We show how Beurling's famous criterion for extremality, that was formulated in the continuous case, can be interpreted on graphs as an instance of the Karush-Kuhn-Tucker conditions. We then develop an algorithm to numerically compute modulus using Beurling's criterion as our guide."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7640","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.7640","created_at":"2026-05-18T00:45:04.990685+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7640v3","created_at":"2026-05-18T00:45:04.990685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7640","created_at":"2026-05-18T00:45:04.990685+00:00"},{"alias_kind":"pith_short_12","alias_value":"265NS4OSHXRZ","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"265NS4OSHXRZJEJB","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"265NS4OS","created_at":"2026-05-18T12:28:09.283467+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/265NS4OSHXRZJEJB4OXBFHPSH6","json":"https://pith.science/pith/265NS4OSHXRZJEJB4OXBFHPSH6.json","graph_json":"https://pith.science/api/pith-number/265NS4OSHXRZJEJB4OXBFHPSH6/graph.json","events_json":"https://pith.science/api/pith-number/265NS4OSHXRZJEJB4OXBFHPSH6/events.json","paper":"https://pith.science/paper/265NS4OS"},"agent_actions":{"view_html":"https://pith.science/pith/265NS4OSHXRZJEJB4OXBFHPSH6","download_json":"https://pith.science/pith/265NS4OSHXRZJEJB4OXBFHPSH6.json","view_paper":"https://pith.science/paper/265NS4OS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7640&json=true","fetch_graph":"https://pith.science/api/pith-number/265NS4OSHXRZJEJB4OXBFHPSH6/graph.json","fetch_events":"https://pith.science/api/pith-number/265NS4OSHXRZJEJB4OXBFHPSH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/265NS4OSHXRZJEJB4OXBFHPSH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/265NS4OSHXRZJEJB4OXBFHPSH6/action/storage_attestation","attest_author":"https://pith.science/pith/265NS4OSHXRZJEJB4OXBFHPSH6/action/author_attestation","sign_citation":"https://pith.science/pith/265NS4OSHXRZJEJB4OXBFHPSH6/action/citation_signature","submit_replication":"https://pith.science/pith/265NS4OSHXRZJEJB4OXBFHPSH6/action/replication_record"}},"created_at":"2026-05-18T00:45:04.990685+00:00","updated_at":"2026-05-18T00:45:04.990685+00:00"}